[INFO] cloning repository https://github.com/tan-wei/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/tan-wei/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] b4dd414a0480399e01b34a8da915646b65e4d250 [INFO] testing tan-wei/leetcode-rust against master#595316b4006932405a63862d8fe65f71a6356293 for pr-128254 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust" "/workspace/builds/worker-2-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/tan-wei/leetcode-rust on toolchain 595316b4006932405a63862d8fe65f71a6356293 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+595316b4006932405a63862d8fe65f71a6356293" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-2-tc1/source/.cargo/config.toml [INFO] started tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] finished tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] tweaked toml for git repo https://github.com/tan-wei/leetcode-rust written to /workspace/builds/worker-2-tc1/source/Cargo.toml [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+595316b4006932405a63862d8fe65f71a6356293" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 300 packages to latest compatible versions [INFO] [stderr] Adding addr2line v0.22.0 (latest: v0.24.1) [INFO] [stderr] Adding aead v0.3.2 (latest: v0.5.2) [INFO] [stderr] Adding aes v0.6.0 (latest: v0.8.4) [INFO] [stderr] Adding aes-gcm v0.8.0 (latest: v0.10.3) [INFO] [stderr] Adding aes-soft v0.6.4 (latest: v0.99.99) [INFO] [stderr] Adding aesni v0.10.0 (latest: v0.99.99) [INFO] [stderr] Adding async-channel v1.9.0 (latest: v2.3.1) [INFO] [stderr] Adding async-io v1.13.0 (latest: v2.3.3) [INFO] [stderr] Adding async-lock v2.8.0 (latest: v3.4.0) [INFO] [stderr] Adding autocfg v0.1.8 (latest: v1.3.0) [INFO] [stderr] Adding base64 v0.13.1 (latest: v0.22.1) [INFO] [stderr] Adding bitflags v1.3.2 (latest: v2.6.0) [INFO] [stderr] Adding block-buffer v0.9.0 (latest: v0.10.4) [INFO] [stderr] Adding bytes v0.5.6 (latest: v1.7.1) [INFO] [stderr] Adding cipher v0.2.5 (latest: v0.4.4) [INFO] [stderr] Adding cloudabi v0.0.3 (latest: v0.1.0) [INFO] [stderr] Adding cookie v0.14.4 (latest: v0.18.1) [INFO] [stderr] Adding cpuid-bool v0.2.0 (latest: v0.99.99) [INFO] [stderr] Adding crypto-mac v0.10.0 (latest: v0.11.1) [INFO] [stderr] Adding ctr v0.6.0 (latest: v0.9.2) [INFO] [stderr] Adding digest v0.9.0 (latest: v0.10.7) [INFO] [stderr] Adding event-listener v2.5.3 (latest: v5.3.1) [INFO] [stderr] Adding fastrand v1.9.0 (latest: v2.1.0) [INFO] [stderr] Adding flume v0.9.2 (latest: v0.11.0) [INFO] [stderr] Adding foreign-types v0.3.2 (latest: v0.5.0) [INFO] [stderr] Adding foreign-types-shared v0.1.1 (latest: v0.3.1) [INFO] [stderr] Adding futures-lite v1.13.0 (latest: v2.3.0) [INFO] [stderr] Adding generic-array v0.14.7 (latest: v1.1.0) [INFO] [stderr] Adding getrandom v0.1.16 (latest: v0.2.15) [INFO] [stderr] Adding ghash v0.3.1 (latest: v0.5.1) [INFO] [stderr] Adding gimli v0.29.0 (latest: v0.31.0) [INFO] [stderr] Adding gloo-timers v0.2.6 (latest: v0.3.0) [INFO] [stderr] Adding hermit-abi v0.3.9 (latest: v0.4.0) [INFO] [stderr] Adding hkdf v0.10.0 (latest: v0.12.4) [INFO] [stderr] Adding hmac v0.10.1 (latest: v0.12.1) [INFO] [stderr] Adding http v0.2.12 (latest: v1.1.0) [INFO] [stderr] Adding idna v0.5.0 (latest: v1.0.2) [INFO] [stderr] Adding infer v0.2.3 (latest: v0.16.0) [INFO] [stderr] Adding io-lifetimes v1.0.11 (latest: v2.0.3) [INFO] [stderr] Adding isahc v0.9.14 (latest: v1.7.2) [INFO] [stderr] Adding linux-raw-sys v0.3.8 (latest: v0.6.4) [INFO] [stderr] Adding linux-raw-sys v0.4.14 (latest: v0.6.4) [INFO] [stderr] Adding miniz_oxide v0.7.4 (latest: v0.8.0) [INFO] [stderr] Adding polling v2.8.0 (latest: v3.7.2) [INFO] [stderr] Adding polyval v0.4.5 (latest: v0.6.2) [INFO] [stderr] Adding rand v0.6.5 (latest: v0.8.5) [INFO] [stderr] Adding rand v0.7.3 (latest: v0.8.5) [INFO] [stderr] Adding rand_chacha v0.1.1 (latest: v0.3.1) [INFO] [stderr] Adding rand_chacha v0.2.2 (latest: v0.3.1) [INFO] [stderr] Adding rand_core v0.3.1 (latest: v0.6.4) [INFO] [stderr] Adding rand_core v0.4.2 (latest: v0.6.4) [INFO] [stderr] Adding rand_core v0.5.1 (latest: v0.6.4) [INFO] [stderr] Adding rand_hc v0.1.0 (latest: v0.3.2) [INFO] [stderr] Adding rand_hc v0.2.0 (latest: v0.3.2) [INFO] [stderr] Adding rand_isaac v0.1.1 (latest: v0.3.0) [INFO] [stderr] Adding rand_jitter v0.1.4 (latest: v0.4.0) [INFO] [stderr] Adding rand_os v0.1.3 (latest: v0.2.2) [INFO] [stderr] Adding rand_pcg v0.1.2 (latest: v0.3.1) [INFO] [stderr] Adding rand_xorshift v0.1.1 (latest: v0.3.0) [INFO] [stderr] Adding rdrand v0.4.0 (latest: v0.8.3) [INFO] [stderr] Adding rustc_version v0.2.3 (latest: v0.4.0) [INFO] [stderr] Adding rustix v0.37.27 (latest: v0.38.34) [INFO] [stderr] Adding semver v0.9.0 (latest: v1.0.23) [INFO] [stderr] Adding semver-parser v0.7.0 (latest: v0.10.2) [INFO] [stderr] Adding serde_qs v0.8.5 (latest: v0.13.0) [INFO] [stderr] Adding sha1 v0.6.1 (latest: v0.10.6) [INFO] [stderr] Adding sha2 v0.9.9 (latest: v0.10.8) [INFO] [stderr] Adding socket2 v0.4.10 (latest: v0.5.7) [INFO] [stderr] Adding spinning_top v0.2.5 (latest: v0.3.0) [INFO] [stderr] Adding standback v0.2.17 (latest: v0.4.4) [INFO] [stderr] Adding syn v1.0.109 (latest: v2.0.72) [INFO] [stderr] Adding system-configuration v0.5.1 (latest: v0.6.0) [INFO] [stderr] Adding system-configuration-sys v0.5.0 (latest: v0.6.0) [INFO] [stderr] Adding time v0.2.27 (latest: v0.3.36) [INFO] [stderr] Adding time-macros v0.1.1 (latest: v0.2.18) [INFO] [stderr] Adding universal-hash v0.4.0 (latest: v0.5.1) [INFO] [stderr] Adding wasi v0.9.0+wasi-snapshot-preview1 (latest: v0.13.1+wasi-0.2.0) [INFO] [stderr] Adding wasi v0.11.0+wasi-snapshot-preview1 (latest: v0.13.1+wasi-0.2.0) [INFO] [stderr] Adding windows-sys v0.48.0 (latest: v0.59.0) [INFO] [stderr] Adding windows-sys v0.52.0 (latest: v0.59.0) [INFO] [stderr] Adding windows-targets v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_aarch64_gnullvm v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_aarch64_msvc v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_i686_gnu v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_i686_msvc v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_gnu v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_gnullvm v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_msvc v0.48.5 (latest: v0.52.6) [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+595316b4006932405a63862d8fe65f71a6356293" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded serde_qs v0.8.5 [INFO] [stderr] Downloaded http-body v1.0.1 [INFO] [stderr] Downloaded autocfg v0.1.8 [INFO] [stderr] Downloaded sha1_smol v1.0.1 [INFO] [stderr] Downloaded assert_float_eq v1.1.3 [INFO] [stderr] Downloaded zstd-safe v7.2.1 [INFO] [stderr] Downloaded rustls-pemfile v2.1.3 [INFO] [stderr] Downloaded rustls-pki-types v1.8.0 [INFO] [stderr] Downloaded hyper-util v0.1.7 [INFO] [stderr] Downloaded spinning_top v0.2.5 [INFO] [stderr] Downloaded flume v0.9.2 [INFO] [stderr] Downloaded async-compression v0.4.12 [INFO] [stderr] Downloaded http-client v6.5.3 [INFO] [stderr] Downloaded surf v2.3.2 [INFO] [stderr] Downloaded isahc v0.9.14 [INFO] [stderr] Downloaded rustls-webpki v0.102.6 [INFO] [stderr] Downloaded object v0.36.3 [INFO] [stderr] Downloaded rustls v0.23.12 [INFO] [stderr] Downloaded zstd-sys v2.0.13+zstd.1.5.6 [INFO] [stderr] Downloaded libz-sys v1.1.18 [INFO] [stderr] Downloaded http-types v2.12.0 [INFO] [stderr] Downloaded curl-sys v0.4.74+curl-8.9.0 [INFO] [stderr] Downloaded libnghttp2-sys v0.1.10+1.61.0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+595316b4006932405a63862d8fe65f71a6356293" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 870c83f34d9cf1fbe946a59881cf5938844a6e7e8d9248e9a7e8aa86fb554fec [INFO] running `Command { std: "docker" "start" "-a" "870c83f34d9cf1fbe946a59881cf5938844a6e7e8d9248e9a7e8aa86fb554fec", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "870c83f34d9cf1fbe946a59881cf5938844a6e7e8d9248e9a7e8aa86fb554fec", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "870c83f34d9cf1fbe946a59881cf5938844a6e7e8d9248e9a7e8aa86fb554fec", kill_on_drop: false }` [INFO] [stdout] 870c83f34d9cf1fbe946a59881cf5938844a6e7e8d9248e9a7e8aa86fb554fec [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+595316b4006932405a63862d8fe65f71a6356293" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] c292c16e8741c1caae5cc511853bf53fe4658aa4ae768546e1dffb91f96315a2 [INFO] running `Command { std: "docker" "start" "-a" "c292c16e8741c1caae5cc511853bf53fe4658aa4ae768546e1dffb91f96315a2", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.155 [INFO] [stderr] Compiling proc-macro2 v1.0.86 [INFO] [stderr] Compiling unicode-ident v1.0.12 [INFO] [stderr] Compiling autocfg v1.3.0 [INFO] [stderr] Compiling version_check v0.9.5 [INFO] [stderr] Compiling pin-project-lite v0.2.14 [INFO] [stderr] Compiling futures-core v0.3.30 [INFO] [stderr] Compiling pkg-config v0.3.30 [INFO] [stderr] Compiling value-bag v1.9.0 [INFO] [stderr] Compiling once_cell v1.19.0 [INFO] [stderr] Compiling futures-io v0.3.30 [INFO] [stderr] Compiling typenum v1.17.0 [INFO] [stderr] Compiling memchr v2.7.4 [INFO] [stderr] Compiling vcpkg v0.2.15 [INFO] [stderr] Compiling crossbeam-utils v0.8.20 [INFO] [stderr] Compiling bytes v1.7.1 [INFO] [stderr] Compiling scopeguard v1.2.0 [INFO] [stderr] Compiling parking v2.2.0 [INFO] [stderr] Compiling futures-sink v0.3.30 [INFO] [stderr] Compiling itoa v1.0.11 [INFO] [stderr] Compiling tracing-core v0.1.32 [INFO] [stderr] Compiling bitflags v2.6.0 [INFO] [stderr] Compiling parking_lot_core v0.9.10 [INFO] [stderr] Compiling atomic-waker v1.1.2 [INFO] [stderr] Compiling log v0.4.22 [INFO] [stderr] Compiling smallvec v1.13.2 [INFO] [stderr] Compiling generic-array v0.14.7 [INFO] [stderr] Compiling serde v1.0.205 [INFO] [stderr] Compiling slab v0.4.9 [INFO] [stderr] Compiling lock_api v0.4.12 [INFO] [stderr] Compiling subtle v2.6.1 [INFO] [stderr] Compiling futures-channel v0.3.30 [INFO] [stderr] Compiling byteorder v1.5.0 [INFO] [stderr] Compiling percent-encoding v2.3.1 [INFO] [stderr] Compiling futures-task v0.3.30 [INFO] [stderr] Compiling opaque-debug v0.3.1 [INFO] [stderr] Compiling fastrand v2.1.0 [INFO] [stderr] Compiling standback v0.2.17 [INFO] [stderr] Compiling autocfg v0.1.8 [INFO] [stderr] Compiling concurrent-queue v2.5.0 [INFO] [stderr] Compiling quote v1.0.36 [INFO] [stderr] Compiling event-listener v2.5.3 [INFO] [stderr] Compiling proc-macro-hack v0.5.20+deprecated [INFO] [stderr] Compiling wasm-bindgen-shared v0.2.92 [INFO] [stderr] Compiling rustix v0.38.34 [INFO] [stderr] Compiling rand_core v0.4.2 [INFO] [stderr] Compiling tinyvec_macros v0.1.1 [INFO] [stderr] Compiling syn v1.0.109 [INFO] [stderr] Compiling syn v2.0.72 [INFO] [stderr] Compiling event-listener v5.3.1 [INFO] [stderr] Compiling futures-lite v2.3.0 [INFO] [stderr] Compiling tinyvec v1.8.0 [INFO] [stderr] Compiling getrandom v0.1.16 [INFO] [stderr] Compiling io-lifetimes v1.0.11 [INFO] [stderr] Compiling openssl-probe v0.1.5 [INFO] [stderr] Compiling linux-raw-sys v0.4.14 [INFO] [stderr] Compiling form_urlencoded v1.2.1 [INFO] [stderr] Compiling event-listener-strategy v0.5.2 [INFO] [stderr] Compiling http v1.1.0 [INFO] [stderr] Compiling polling v2.8.0 [INFO] [stderr] Compiling bumpalo v3.16.0 [INFO] [stderr] Compiling fastrand v1.9.0 [INFO] [stderr] Compiling unicode-bidi v0.3.15 [INFO] [stderr] Compiling rustix v0.37.27 [INFO] [stderr] Compiling async-task v4.7.1 [INFO] [stderr] Compiling cpuid-bool v0.2.0 [INFO] [stderr] Compiling const_fn v0.4.10 [INFO] [stderr] Compiling waker-fn v1.2.0 [INFO] [stderr] Compiling futures-lite v1.13.0 [INFO] [stderr] Compiling async-lock v3.4.0 [INFO] [stderr] Compiling async-channel v2.3.1 [INFO] [stderr] Compiling async-channel v1.9.0 [INFO] [stderr] Compiling piper v0.2.3 [INFO] [stderr] Compiling async-io v1.13.0 [INFO] [stderr] Compiling cipher v0.2.5 [INFO] [stderr] Compiling digest v0.9.0 [INFO] [stderr] Compiling universal-hash v0.4.0 [INFO] [stderr] Compiling polyval v0.4.5 [INFO] [stderr] Compiling crypto-mac v0.10.0 [INFO] [stderr] Compiling time v0.2.27 [INFO] [stderr] Compiling jobserver v0.1.32 [INFO] [stderr] Compiling socket2 v0.5.7 [INFO] [stderr] Compiling mio v1.0.1 [INFO] [stderr] Compiling signal-hook-registry v1.4.2 [INFO] [stderr] Compiling unicode-normalization v0.1.23 [INFO] [stderr] Compiling getrandom v0.2.15 [INFO] [stderr] Compiling cc v1.1.8 [INFO] [stderr] Compiling parking_lot v0.12.3 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling aes-soft v0.6.4 [INFO] [stderr] Compiling unicase v2.7.0 [INFO] [stderr] Compiling serde_json v1.0.122 [INFO] [stderr] Compiling httparse v1.9.4 [INFO] [stderr] Compiling hashbrown v0.14.5 [INFO] [stderr] Compiling linux-raw-sys v0.3.8 [INFO] [stderr] Compiling thiserror v1.0.63 [INFO] [stderr] Compiling idna v0.5.0 [INFO] [stderr] Compiling openssl v0.10.66 [INFO] [stderr] Compiling ryu v1.0.18 [INFO] [stderr] Compiling foreign-types-shared v0.1.1 [INFO] [stderr] Compiling equivalent v1.0.1 [INFO] [stderr] Compiling foreign-types v0.3.2 [INFO] [stderr] Compiling aes v0.6.0 [INFO] [stderr] Compiling rand_core v0.5.1 [INFO] [stderr] Compiling http-body v1.0.1 [INFO] [stderr] Compiling hmac v0.10.1 [INFO] [stderr] Compiling ghash v0.3.1 [INFO] [stderr] Compiling socket2 v0.4.10 [INFO] [stderr] Compiling ctr v0.6.0 [INFO] [stderr] Compiling blocking v1.6.1 [INFO] [stderr] Compiling async-executor v1.13.0 [INFO] [stderr] Compiling aead v0.3.2 [INFO] [stderr] Compiling block-buffer v0.9.0 [INFO] [stderr] Compiling rand_core v0.3.1 [INFO] [stderr] Compiling async-lock v2.8.0 [INFO] [stderr] Compiling cookie v0.14.4 [INFO] [stderr] Compiling zstd-safe v7.2.1 [INFO] [stderr] Compiling try-lock v0.2.5 [INFO] [stderr] Compiling curl v0.4.46 [INFO] [stderr] Compiling wasm-bindgen v0.2.92 [INFO] [stderr] Compiling cpufeatures v0.2.12 [INFO] [stderr] Compiling indexmap v2.3.0 [INFO] [stderr] Compiling anyhow v1.0.86 [INFO] [stderr] Compiling native-tls v0.2.12 [INFO] [stderr] Compiling alloc-no-stdlib v2.0.4 [INFO] [stderr] Compiling sha2 v0.9.9 [INFO] [stderr] Compiling alloc-stdlib v0.2.2 [INFO] [stderr] Compiling want v0.3.1 [INFO] [stderr] Compiling aes-gcm v0.8.0 [INFO] [stderr] Compiling hkdf v0.10.0 [INFO] [stderr] Compiling spinning_top v0.2.5 [INFO] [stderr] Compiling kv-log-macro v1.0.7 [INFO] [stderr] Compiling base64 v0.13.1 [INFO] [stderr] Compiling isahc v0.9.14 [INFO] [stderr] Compiling tower-layer v0.3.2 [INFO] [stderr] Compiling tower-service v0.3.2 [INFO] [stderr] Compiling http-types v2.12.0 [INFO] [stderr] Compiling mime_guess v2.0.5 [INFO] [stderr] Compiling miniz_oxide v0.7.4 [INFO] [stderr] Compiling flume v0.9.2 [INFO] [stderr] Compiling brotli-decompressor v4.0.1 [INFO] [stderr] Compiling sluice v0.5.5 [INFO] [stderr] Compiling rand_pcg v0.1.2 [INFO] [stderr] Compiling rand_chacha v0.1.1 [INFO] [stderr] Compiling http v0.2.12 [INFO] [stderr] Compiling crc32fast v1.4.2 [INFO] [stderr] Compiling bytes v0.5.6 [INFO] [stderr] Compiling infer v0.2.3 [INFO] [stderr] Compiling mime v0.3.17 [INFO] [stderr] Compiling flate2 v1.0.31 [INFO] [stderr] Compiling num_cpus v1.16.0 [INFO] [stderr] Compiling rand v0.6.5 [INFO] [stderr] Compiling aho-corasick v1.1.3 [INFO] [stderr] Compiling encoding_rs v0.8.34 [INFO] [stderr] Compiling base64 v0.22.1 [INFO] [stderr] Compiling openssl-sys v0.9.103 [INFO] [stderr] Compiling libz-sys v1.1.18 [INFO] [stderr] Compiling libnghttp2-sys v0.1.10+1.61.0 [INFO] [stderr] Compiling curl-sys v0.4.74+curl-8.9.0 [INFO] [stderr] Compiling zstd-sys v2.0.13+zstd.1.5.6 [INFO] [stderr] Compiling brotli v6.0.0 [INFO] [stderr] Compiling regex-syntax v0.8.4 [INFO] [stderr] Compiling rustls-pki-types v1.8.0 [INFO] [stderr] Compiling rustls-pemfile v2.1.3 [INFO] [stderr] Compiling rand_xorshift v0.1.1 [INFO] [stderr] Compiling wasm-bindgen-backend v0.2.92 [INFO] [stderr] Compiling rand_hc v0.1.0 [INFO] [stderr] Compiling rand_isaac v0.1.1 [INFO] [stderr] error: could not compile `syn` (lib) [INFO] [stderr] [INFO] [stderr] Caused by: [INFO] [stderr] process didn't exit successfully: `/opt/rustwide/rustup-home/toolchains/595316b4006932405a63862d8fe65f71a6356293/bin/rustc --crate-name syn --edition=2021 /opt/rustwide/cargo-home/registry/src/index.crates.io-6f17d22bba15001f/syn-2.0.72/src/lib.rs --error-format=json --json=diagnostic-rendered-ansi,artifacts,future-incompat --crate-type lib --emit=dep-info,metadata,link -C embed-bitcode=no --cfg 'feature="clone-impls"' --cfg 'feature="default"' --cfg 'feature="derive"' --cfg 'feature="extra-traits"' --cfg 'feature="full"' --cfg 'feature="parsing"' --cfg 'feature="printing"' --cfg 'feature="proc-macro"' --cfg 'feature="visit"' --cfg 'feature="visit-mut"' --check-cfg 'cfg(docsrs)' --check-cfg 'cfg(feature, values("clone-impls", "default", "derive", "extra-traits", "fold", "full", "parsing", "printing", "proc-macro", "test", "visit", "visit-mut"))' -C metadata=a457cdedbeda3af7 -C extra-filename=-a457cdedbeda3af7 --out-dir /opt/rustwide/target/debug/deps -L dependency=/opt/rustwide/target/debug/deps --extern proc_macro2=/opt/rustwide/target/debug/deps/libproc_macro2-999306cb2722a44d.rmeta --extern quote=/opt/rustwide/target/debug/deps/libquote-588522ccb60d1420.rmeta --extern unicode_ident=/opt/rustwide/target/debug/deps/libunicode_ident-7b828347d8713ecd.rmeta --cap-lints allow --cap-lints=forbid` (signal: 9, SIGKILL: kill) [INFO] [stderr] warning: build failed, waiting for other jobs to finish... [INFO] running `Command { std: "docker" "inspect" "c292c16e8741c1caae5cc511853bf53fe4658aa4ae768546e1dffb91f96315a2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "c292c16e8741c1caae5cc511853bf53fe4658aa4ae768546e1dffb91f96315a2", kill_on_drop: false }` [INFO] [stdout] c292c16e8741c1caae5cc511853bf53fe4658aa4ae768546e1dffb91f96315a2 [INFO] testing tan-wei/leetcode-rust against try#5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b for pr-128254 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/tan-wei/leetcode-rust on toolchain 5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-2-tc2/source/.cargo/config.toml [INFO] started tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] finished tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] tweaked toml for git repo https://github.com/tan-wei/leetcode-rust written to /workspace/builds/worker-2-tc2/source/Cargo.toml [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 300 packages to latest compatible versions [INFO] [stderr] Adding addr2line v0.22.0 (latest: v0.24.1) [INFO] [stderr] Adding aead v0.3.2 (latest: v0.5.2) [INFO] [stderr] Adding aes v0.6.0 (latest: v0.8.4) [INFO] [stderr] Adding aes-gcm v0.8.0 (latest: v0.10.3) [INFO] [stderr] Adding aes-soft v0.6.4 (latest: v0.99.99) [INFO] [stderr] Adding aesni v0.10.0 (latest: v0.99.99) [INFO] [stderr] Adding async-channel v1.9.0 (latest: v2.3.1) [INFO] [stderr] Adding async-io v1.13.0 (latest: v2.3.3) [INFO] [stderr] Adding async-lock v2.8.0 (latest: v3.4.0) [INFO] [stderr] Adding autocfg v0.1.8 (latest: v1.3.0) [INFO] [stderr] Adding base64 v0.13.1 (latest: v0.22.1) [INFO] [stderr] Adding bitflags v1.3.2 (latest: v2.6.0) [INFO] [stderr] Adding block-buffer v0.9.0 (latest: v0.10.4) [INFO] [stderr] Adding bytes v0.5.6 (latest: v1.7.1) [INFO] [stderr] Adding cipher v0.2.5 (latest: v0.4.4) [INFO] [stderr] Adding cloudabi v0.0.3 (latest: v0.1.0) [INFO] [stderr] Adding cookie v0.14.4 (latest: v0.18.1) [INFO] [stderr] Adding cpuid-bool v0.2.0 (latest: v0.99.99) [INFO] [stderr] Adding crypto-mac v0.10.0 (latest: v0.11.1) [INFO] [stderr] Adding ctr v0.6.0 (latest: v0.9.2) [INFO] [stderr] Adding digest v0.9.0 (latest: v0.10.7) [INFO] [stderr] Adding event-listener v2.5.3 (latest: v5.3.1) [INFO] [stderr] Adding fastrand v1.9.0 (latest: v2.1.0) [INFO] [stderr] Adding flume v0.9.2 (latest: v0.11.0) [INFO] [stderr] Adding foreign-types v0.3.2 (latest: v0.5.0) [INFO] [stderr] Adding foreign-types-shared v0.1.1 (latest: v0.3.1) [INFO] [stderr] Adding futures-lite v1.13.0 (latest: v2.3.0) [INFO] [stderr] Adding generic-array v0.14.7 (latest: v1.1.0) [INFO] [stderr] Adding getrandom v0.1.16 (latest: v0.2.15) [INFO] [stderr] Adding ghash v0.3.1 (latest: v0.5.1) [INFO] [stderr] Adding gimli v0.29.0 (latest: v0.31.0) [INFO] [stderr] Adding gloo-timers v0.2.6 (latest: v0.3.0) [INFO] [stderr] Adding hermit-abi v0.3.9 (latest: v0.4.0) [INFO] [stderr] Adding hkdf v0.10.0 (latest: v0.12.4) [INFO] [stderr] Adding hmac v0.10.1 (latest: v0.12.1) [INFO] [stderr] Adding http v0.2.12 (latest: v1.1.0) [INFO] [stderr] Adding idna v0.5.0 (latest: v1.0.2) [INFO] [stderr] Adding infer v0.2.3 (latest: v0.16.0) [INFO] [stderr] Adding io-lifetimes v1.0.11 (latest: v2.0.3) [INFO] [stderr] Adding isahc v0.9.14 (latest: v1.7.2) [INFO] [stderr] Adding linux-raw-sys v0.3.8 (latest: v0.6.4) [INFO] [stderr] Adding linux-raw-sys v0.4.14 (latest: v0.6.4) [INFO] [stderr] Adding miniz_oxide v0.7.4 (latest: v0.8.0) [INFO] [stderr] Adding polling v2.8.0 (latest: v3.7.2) [INFO] [stderr] Adding polyval v0.4.5 (latest: v0.6.2) [INFO] [stderr] Adding rand v0.6.5 (latest: v0.8.5) [INFO] [stderr] Adding rand v0.7.3 (latest: v0.8.5) [INFO] [stderr] Adding rand_chacha v0.1.1 (latest: v0.3.1) [INFO] [stderr] Adding rand_chacha v0.2.2 (latest: v0.3.1) [INFO] [stderr] Adding rand_core v0.3.1 (latest: v0.6.4) [INFO] [stderr] Adding rand_core v0.4.2 (latest: v0.6.4) [INFO] [stderr] Adding rand_core v0.5.1 (latest: v0.6.4) [INFO] [stderr] Adding rand_hc v0.1.0 (latest: v0.3.2) [INFO] [stderr] Adding rand_hc v0.2.0 (latest: v0.3.2) [INFO] [stderr] Adding rand_isaac v0.1.1 (latest: v0.3.0) [INFO] [stderr] Adding rand_jitter v0.1.4 (latest: v0.4.0) [INFO] [stderr] Adding rand_os v0.1.3 (latest: v0.2.2) [INFO] [stderr] Adding rand_pcg v0.1.2 (latest: v0.3.1) [INFO] [stderr] Adding rand_xorshift v0.1.1 (latest: v0.3.0) [INFO] [stderr] Adding rdrand v0.4.0 (latest: v0.8.3) [INFO] [stderr] Adding rustc_version v0.2.3 (latest: v0.4.0) [INFO] [stderr] Adding rustix v0.37.27 (latest: v0.38.34) [INFO] [stderr] Adding semver v0.9.0 (latest: v1.0.23) [INFO] [stderr] Adding semver-parser v0.7.0 (latest: v0.10.2) [INFO] [stderr] Adding serde_qs v0.8.5 (latest: v0.13.0) [INFO] [stderr] Adding sha1 v0.6.1 (latest: v0.10.6) [INFO] [stderr] Adding sha2 v0.9.9 (latest: v0.10.8) [INFO] [stderr] Adding socket2 v0.4.10 (latest: v0.5.7) [INFO] [stderr] Adding spinning_top v0.2.5 (latest: v0.3.0) [INFO] [stderr] Adding standback v0.2.17 (latest: v0.4.4) [INFO] [stderr] Adding syn v1.0.109 (latest: v2.0.72) [INFO] [stderr] Adding system-configuration v0.5.1 (latest: v0.6.0) [INFO] [stderr] Adding system-configuration-sys v0.5.0 (latest: v0.6.0) [INFO] [stderr] Adding time v0.2.27 (latest: v0.3.36) [INFO] [stderr] Adding time-macros v0.1.1 (latest: v0.2.18) [INFO] [stderr] Adding universal-hash v0.4.0 (latest: v0.5.1) [INFO] [stderr] Adding wasi v0.9.0+wasi-snapshot-preview1 (latest: v0.13.1+wasi-0.2.0) [INFO] [stderr] Adding wasi v0.11.0+wasi-snapshot-preview1 (latest: v0.13.1+wasi-0.2.0) [INFO] [stderr] Adding windows-sys v0.48.0 (latest: v0.59.0) [INFO] [stderr] Adding windows-sys v0.52.0 (latest: v0.59.0) [INFO] [stderr] Adding windows-targets v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_aarch64_gnullvm v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_aarch64_msvc v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_i686_gnu v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_i686_msvc v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_gnu v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_gnullvm v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_msvc v0.48.5 (latest: v0.52.6) [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 3b52d5b652c794c0327b4650c615af9414088977491b66a396f4c84a6ec2b607 [INFO] running `Command { std: "docker" "start" "-a" "3b52d5b652c794c0327b4650c615af9414088977491b66a396f4c84a6ec2b607", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "3b52d5b652c794c0327b4650c615af9414088977491b66a396f4c84a6ec2b607", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "3b52d5b652c794c0327b4650c615af9414088977491b66a396f4c84a6ec2b607", kill_on_drop: false }` [INFO] [stdout] 3b52d5b652c794c0327b4650c615af9414088977491b66a396f4c84a6ec2b607 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 6b1f609fcf126694e401905b848d26f6e4351c1aea19a08ff5cff19dd137e896 [INFO] running `Command { std: "docker" "start" "-a" "6b1f609fcf126694e401905b848d26f6e4351c1aea19a08ff5cff19dd137e896", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.155 [INFO] [stderr] Compiling proc-macro2 v1.0.86 [INFO] [stderr] Compiling unicode-ident v1.0.12 [INFO] [stderr] Compiling autocfg v1.3.0 [INFO] [stderr] Compiling version_check v0.9.5 [INFO] [stderr] Compiling pin-project-lite v0.2.14 [INFO] [stderr] Compiling futures-core v0.3.30 [INFO] [stderr] Compiling pkg-config v0.3.30 [INFO] [stderr] Compiling value-bag v1.9.0 [INFO] [stderr] Compiling once_cell v1.19.0 [INFO] [stderr] Compiling futures-io v0.3.30 [INFO] [stderr] Compiling typenum v1.17.0 [INFO] [stderr] Compiling memchr v2.7.4 [INFO] [stderr] Compiling vcpkg v0.2.15 [INFO] [stderr] Compiling crossbeam-utils v0.8.20 [INFO] [stderr] Compiling bytes v1.7.1 [INFO] [stderr] Compiling scopeguard v1.2.0 [INFO] [stderr] Compiling parking v2.2.0 [INFO] [stderr] Compiling futures-sink v0.3.30 [INFO] [stderr] Compiling tracing-core v0.1.32 [INFO] [stderr] Compiling itoa v1.0.11 [INFO] [stderr] Compiling parking_lot_core v0.9.10 [INFO] [stderr] Compiling log v0.4.22 [INFO] [stderr] Compiling bitflags v2.6.0 [INFO] [stderr] Compiling atomic-waker v1.1.2 [INFO] [stderr] Compiling smallvec v1.13.2 [INFO] [stderr] Compiling subtle v2.6.1 [INFO] [stderr] Compiling generic-array v0.14.7 [INFO] [stderr] Compiling serde v1.0.205 [INFO] [stderr] Compiling futures-channel v0.3.30 [INFO] [stderr] Compiling slab v0.4.9 [INFO] [stderr] Compiling lock_api v0.4.12 [INFO] [stderr] Compiling percent-encoding v2.3.1 [INFO] [stderr] Compiling byteorder v1.5.0 [INFO] [stderr] Compiling futures-task v0.3.30 [INFO] [stderr] Compiling opaque-debug v0.3.1 [INFO] [stderr] Compiling fastrand v2.1.0 [INFO] [stderr] Compiling standback v0.2.17 [INFO] [stderr] Compiling concurrent-queue v2.5.0 [INFO] [stderr] Compiling autocfg v0.1.8 [INFO] [stderr] Compiling quote v1.0.36 [INFO] [stderr] Compiling rand_core v0.4.2 [INFO] [stderr] Compiling rustix v0.38.34 [INFO] [stderr] Compiling proc-macro-hack v0.5.20+deprecated [INFO] [stderr] Compiling event-listener v2.5.3 [INFO] [stderr] Compiling tinyvec_macros v0.1.1 [INFO] [stderr] Compiling event-listener v5.3.1 [INFO] [stderr] Compiling syn v2.0.72 [INFO] [stderr] Compiling wasm-bindgen-shared v0.2.92 [INFO] [stderr] Compiling syn v1.0.109 [INFO] [stderr] Compiling tinyvec v1.8.0 [INFO] [stderr] Compiling futures-lite v2.3.0 [INFO] [stderr] Compiling openssl-probe v0.1.5 [INFO] [stderr] Compiling getrandom v0.1.16 [INFO] [stderr] Compiling linux-raw-sys v0.4.14 [INFO] [stderr] Compiling io-lifetimes v1.0.11 [INFO] [stderr] Compiling event-listener-strategy v0.5.2 [INFO] [stderr] Compiling form_urlencoded v1.2.1 [INFO] [stderr] Compiling http v1.1.0 [INFO] [stderr] Compiling polling v2.8.0 [INFO] [stderr] Compiling unicode-bidi v0.3.15 [INFO] [stderr] Compiling cpuid-bool v0.2.0 [INFO] [stderr] Compiling bumpalo v3.16.0 [INFO] [stderr] Compiling const_fn v0.4.10 [INFO] [stderr] Compiling rustix v0.37.27 [INFO] [stderr] Compiling fastrand v1.9.0 [INFO] [stderr] Compiling async-task v4.7.1 [INFO] [stderr] Compiling waker-fn v1.2.0 [INFO] [stderr] Compiling futures-lite v1.13.0 [INFO] [stderr] Compiling async-lock v3.4.0 [INFO] [stderr] Compiling async-channel v2.3.1 [INFO] [stderr] Compiling cipher v0.2.5 [INFO] [stderr] Compiling universal-hash v0.4.0 [INFO] [stderr] Compiling jobserver v0.1.32 [INFO] [stderr] Compiling socket2 v0.5.7 [INFO] [stderr] Compiling mio v1.0.1 [INFO] [stderr] Compiling signal-hook-registry v1.4.2 [INFO] [stderr] Compiling unicode-normalization v0.1.23 [INFO] [stderr] Compiling getrandom v0.2.15 [INFO] [stderr] Compiling digest v0.9.0 [INFO] [stderr] Compiling cc v1.1.8 [INFO] [stderr] Compiling parking_lot v0.12.3 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling aes-soft v0.6.4 [INFO] [stderr] Compiling polyval v0.4.5 [INFO] [stderr] Compiling idna v0.5.0 [INFO] [stderr] Compiling crypto-mac v0.10.0 [INFO] [stderr] Compiling async-channel v1.9.0 [INFO] [stderr] Compiling piper v0.2.3 [INFO] [stderr] Compiling async-io v1.13.0 [INFO] [stderr] Compiling unicase v2.7.0 [INFO] [stderr] Compiling time v0.2.27 [INFO] [stderr] Compiling thiserror v1.0.63 [INFO] [stderr] Compiling httparse v1.9.4 [INFO] [stderr] Compiling linux-raw-sys v0.3.8 [INFO] [stderr] Compiling foreign-types-shared v0.1.1 [INFO] [stderr] Compiling equivalent v1.0.1 [INFO] [stderr] Compiling openssl v0.10.66 [INFO] [stderr] Compiling serde_json v1.0.122 [INFO] [stderr] Compiling hashbrown v0.14.5 [INFO] [stderr] Compiling ryu v1.0.18 [INFO] [stderr] Compiling foreign-types v0.3.2 [INFO] [stderr] Compiling blocking v1.6.1 [INFO] [stderr] Compiling hmac v0.10.1 [INFO] [stderr] Compiling rand_core v0.5.1 [INFO] [stderr] Compiling aes v0.6.0 [INFO] [stderr] Compiling ghash v0.3.1 [INFO] [stderr] Compiling http-body v1.0.1 [INFO] [stderr] Compiling ctr v0.6.0 [INFO] [stderr] Compiling async-executor v1.13.0 [INFO] [stderr] Compiling socket2 v0.4.10 [INFO] [stderr] Compiling aead v0.3.2 [INFO] [stderr] Compiling block-buffer v0.9.0 [INFO] [stderr] Compiling async-lock v2.8.0 [INFO] [stderr] Compiling rand_core v0.3.1 [INFO] [stderr] Compiling cookie v0.14.4 [INFO] [stderr] Compiling alloc-no-stdlib v2.0.4 [INFO] [stderr] Compiling anyhow v1.0.86 [INFO] [stderr] Compiling zstd-safe v7.2.1 [INFO] [stderr] Compiling native-tls v0.2.12 [INFO] [stderr] Compiling cpufeatures v0.2.12 [INFO] [stderr] Compiling wasm-bindgen v0.2.92 [INFO] [stderr] Compiling indexmap v2.3.0 [INFO] [stderr] Compiling curl v0.4.46 [INFO] [stderr] Compiling try-lock v0.2.5 [INFO] [stderr] Compiling sha2 v0.9.9 [INFO] [stderr] Compiling want v0.3.1 [INFO] [stderr] Compiling alloc-stdlib v0.2.2 [INFO] [stderr] Compiling aes-gcm v0.8.0 [INFO] [stderr] Compiling hkdf v0.10.0 [INFO] [stderr] Compiling spinning_top v0.2.5 [INFO] [stderr] Compiling kv-log-macro v1.0.7 [INFO] [stderr] Compiling base64 v0.13.1 [INFO] [stderr] Compiling http-types v2.12.0 [INFO] [stderr] Compiling isahc v0.9.14 [INFO] [stderr] Compiling tower-layer v0.3.2 [INFO] [stderr] Compiling tower-service v0.3.2 [INFO] [stderr] Compiling miniz_oxide v0.7.4 [INFO] [stderr] Compiling flume v0.9.2 [INFO] [stderr] Compiling brotli-decompressor v4.0.1 [INFO] [stderr] Compiling mime_guess v2.0.5 [INFO] [stderr] Compiling sluice v0.5.5 [INFO] [stderr] Compiling rand_pcg v0.1.2 [INFO] [stderr] Compiling rand_chacha v0.1.1 [INFO] [stderr] Compiling openssl-sys v0.9.103 [INFO] [stderr] Compiling libz-sys v1.1.18 [INFO] [stderr] Compiling libnghttp2-sys v0.1.10+1.61.0 [INFO] [stderr] Compiling curl-sys v0.4.74+curl-8.9.0 [INFO] [stderr] Compiling zstd-sys v2.0.13+zstd.1.5.6 [INFO] [stderr] Compiling http v0.2.12 [INFO] [stderr] Compiling crc32fast v1.4.2 [INFO] [stderr] Compiling mime v0.3.17 [INFO] [stderr] Compiling bytes v0.5.6 [INFO] [stderr] Compiling infer v0.2.3 [INFO] [stderr] Compiling flate2 v1.0.31 [INFO] [stderr] Compiling num_cpus v1.16.0 [INFO] [stderr] Compiling rand v0.6.5 [INFO] [stderr] Compiling brotli v6.0.0 [INFO] [stderr] Compiling aho-corasick v1.1.3 [INFO] [stderr] Compiling encoding_rs v0.8.34 [INFO] [stderr] Compiling base64 v0.22.1 [INFO] [stderr] Compiling rustls-pki-types v1.8.0 [INFO] [stderr] Compiling wasm-bindgen-backend v0.2.92 [INFO] [stderr] Compiling regex-syntax v0.8.4 [INFO] [stderr] Compiling rustls-pemfile v2.1.3 [INFO] [stderr] Compiling rand_hc v0.1.0 [INFO] [stderr] Compiling rand_isaac v0.1.1 [INFO] [stderr] Compiling rand_xorshift v0.1.1 [INFO] [stderr] Compiling rand_os v0.1.3 [INFO] [stderr] Compiling rand_jitter v0.1.4 [INFO] [stderr] Compiling sync_wrapper v1.0.1 [INFO] [stderr] Compiling ipnet v2.9.0 [INFO] [stderr] Compiling dotenv v0.15.0 [INFO] [stderr] Compiling time-macros-impl v0.1.2 [INFO] [stderr] Compiling wasm-bindgen-macro-support v0.2.92 [INFO] [stderr] Compiling time-macros v0.1.1 [INFO] [stderr] Compiling tracing-attributes v0.1.27 [INFO] [stderr] Compiling futures-macro v0.3.30 [INFO] [stderr] Compiling zerocopy-derive v0.7.35 [INFO] [stderr] Compiling tokio-macros v2.4.0 [INFO] [stderr] Compiling serde_derive v1.0.205 [INFO] [stderr] Compiling pin-project-internal v1.1.5 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Compiling thiserror-impl v1.0.63 [INFO] [stderr] Compiling wasm-bindgen-macro v0.2.92 [INFO] [stderr] Compiling async-trait v0.1.81 [INFO] [stderr] Compiling tokio v1.39.2 [INFO] [stderr] Compiling regex-automata v0.4.7 [INFO] [stderr] Compiling zerocopy v0.7.35 [INFO] [stderr] Compiling futures-util v0.3.30 [INFO] [stderr] Compiling tracing v0.1.40 [INFO] [stderr] Compiling js-sys v0.3.69 [INFO] [stderr] Compiling pin-project v1.1.5 [INFO] [stderr] Compiling ppv-lite86 v0.2.20 [INFO] [stderr] Compiling polling v3.7.2 [INFO] [stderr] Compiling tracing-futures v0.2.5 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand_chacha v0.2.2 [INFO] [stderr] Compiling async-io v2.3.3 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling rand v0.7.3 [INFO] [stderr] Compiling async-global-executor v2.4.1 [INFO] [stderr] Compiling regex v1.10.6 [INFO] [stderr] Compiling async-std v1.12.0 [INFO] [stderr] Compiling http-body-util v0.1.2 [INFO] [stderr] Compiling futures-executor v0.3.30 [INFO] [stderr] Compiling futures v0.3.30 [INFO] [stderr] Compiling web-sys v0.3.69 [INFO] [stderr] Compiling zstd v0.13.2 [INFO] [stderr] Compiling tokio-util v0.7.11 [INFO] [stderr] Compiling tower v0.4.13 [INFO] [stderr] Compiling tokio-native-tls v0.3.1 [INFO] [stderr] Compiling async-compression v0.4.12 [INFO] [stderr] Compiling h2 v0.4.5 [INFO] [stderr] Compiling url v2.5.2 [INFO] [stderr] Compiling serde_urlencoded v0.7.1 [INFO] [stderr] Compiling serde_qs v0.8.5 [INFO] [stderr] Compiling http-client v6.5.3 [INFO] [stderr] Compiling surf v2.3.2 [INFO] [stderr] Compiling hyper v1.4.1 [INFO] [stderr] Compiling hyper-util v0.1.7 [INFO] [stderr] Compiling hyper-tls v0.6.0 [INFO] [stderr] Compiling reqwest v0.12.5 [INFO] [stderr] Compiling leetcode-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::linked_list::{to_list, ListNode}; [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/solution/s0019_remove_nth_node_from_end_of_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:31:32 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:73:20 [INFO] [stdout] | [INFO] [stdout] 73 | if (board[i][j] != '.') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (board[i][j] != '.') { [INFO] [stdout] 73 + if board[i][j] != '.' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:77:24 [INFO] [stdout] | [INFO] [stdout] 77 | if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 77 - if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] 77 + if used1[i][num] || used2[j][num] || used3[k][num] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:47:27 [INFO] [stdout] | [INFO] [stdout] 47 | } else if (j == n - 1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - } else if (j == n - 1) { [INFO] [stdout] 47 + } else if j == n - 1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:42:16 [INFO] [stdout] | [INFO] [stdout] 42 | if (nums[mid] == target) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 42 - if (nums[mid] == target) { [INFO] [stdout] 42 + if nums[mid] == target { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | } else if (nums[mid] > nums[h]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - } else if (nums[mid] > nums[h]) { [INFO] [stdout] 44 + } else if nums[mid] > nums[h] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0086_partition_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:44:25 [INFO] [stdout] | [INFO] [stdout] 44 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0100_same_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0112_path_sum.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..prices.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..prices.len()) { [INFO] [stdout] 53 + for i in 0..prices.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:50:20 [INFO] [stdout] | [INFO] [stdout] 50 | if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] 50 + if s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1]) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:42:25 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:39:15 [INFO] [stdout] | [INFO] [stdout] 39 | while (ugly_numbers.len() < n as usize) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 39 - while (ugly_numbers.len() < n as usize) { [INFO] [stdout] 39 + while ugly_numbers.len() < n as usize { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:47:16 [INFO] [stdout] | [INFO] [stdout] 47 | if (last == ugly_numbers[x] * 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - if (last == ugly_numbers[x] * 2) { [INFO] [stdout] 47 + if last == ugly_numbers[x] * 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:50:16 [INFO] [stdout] | [INFO] [stdout] 50 | if (last == ugly_numbers[y] * 3) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (last == ugly_numbers[y] * 3) { [INFO] [stdout] 50 + if last == ugly_numbers[y] * 3 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | if (last == ugly_numbers[z] * 5) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (last == ugly_numbers[z] * 5) { [INFO] [stdout] 53 + if last == ugly_numbers[z] * 5 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:36:25 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s0315_count_of_smaller_numbers_after_self.rs:44:28 [INFO] [stdout] | [INFO] [stdout] 44 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0328_odd_even_linked_list.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0337_house_robber_iii.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0376_wiggle_subsequence.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | if (size == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (size == 0) { [INFO] [stdout] 50 + if size == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0404_sum_of_left_leaves.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:38:28 [INFO] [stdout] | [INFO] [stdout] 38 | answer.push(if (i % 15 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - answer.push(if (i % 15 == 0) { [INFO] [stdout] 38 + answer.push(if i % 15 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i % 3 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i % 3 == 0) { [INFO] [stdout] 41 + if i % 3 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:44:24 [INFO] [stdout] | [INFO] [stdout] 44 | if (i % 5 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - if (i % 5 == 0) { [INFO] [stdout] 44 + if i % 5 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0437_path_sum_iii.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0445_add_two_numbers_ii.rs:34:32 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0450_delete_node_in_a_bst.rs:45:25 [INFO] [stdout] | [INFO] [stdout] 45 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s0475_heaters.rs:52:47 [INFO] [stdout] | [INFO] [stdout] 52 | _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] 52 + _ => (heaters[i] - h).min(h - heaters[i - 1]), [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0498_diagonal_traverse.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 35 - if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] 35 + if mat.len() == 0 || mat[0].len() == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0501_find_mode_in_binary_search_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0508_most_frequent_subtree_sum.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0513_find_bottom_left_tree_value.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0514_freedom_trail.rs:53:26 [INFO] [stdout] | [INFO] [stdout] 53 | for r_pos in (0..ring.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for r_pos in (0..ring.len()) { [INFO] [stdout] 53 + for r_pos in 0..ring.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0515_find_largest_value_in_each_tree_row.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0530_minimum_absolute_difference_in_bst.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0538_convert_bst_to_greater_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0543_diameter_of_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0563_binary_tree_tilt.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0572_subtree_of_another_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0600_non_negative_integers_without_consecutive_ones.rs:61:54 [INFO] [stdout] | [INFO] [stdout] 61 | FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] 61 + FB[bt - 1] + Self::find_integers(n & !(1 << bt)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0606_construct_string_from_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0617_merge_two_binary_trees.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0623_add_one_row_to_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0637_average_of_levels_in_binary_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0652_find_duplicate_subtrees.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0653_two_sum_iv_input_is_a_bst.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0654_maximum_binary_tree.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0655_print_binary_tree.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0662_maximum_width_of_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0665_non_decreasing_array.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] 41 + if i < 2 || nums[i - 2] <= nums[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0669_trim_a_binary_search_tree.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `match` scrutinee expression [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:61:33 [INFO] [stdout] | [INFO] [stdout] 61 | Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] 61 + Some(root) => match (root.borrow().left.clone(), root.borrow().right.clone()) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:69:24 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_val == root.borrow().val) { [INFO] [stdout] 69 + if left_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:73:24 [INFO] [stdout] | [INFO] [stdout] 73 | if (right_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (right_val == root.borrow().val) { [INFO] [stdout] 73 + if right_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0687_longest_univalue_path.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0700_search_in_a_binary_search_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:70:20 [INFO] [stdout] | [INFO] [stdout] 70 | if (val < node.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 70 - if (val < node.borrow().val) { [INFO] [stdout] 70 + if val < node.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | if (val <= curr_kth) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - if (val <= curr_kth) { [INFO] [stdout] 71 + if val <= curr_kth { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0725_split_linked_list_in_parts.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0740_delete_and_earn.rs:48:50 [INFO] [stdout] | [INFO] [stdout] 48 | (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 48 - (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] 48 + (2..10001).for_each(|i| dp[i] = i32::max(sum[i] + dp[i - 2], dp[i - 1])); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:51:40 [INFO] [stdout] | [INFO] [stdout] 51 | tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] 51 + tx -= std::cmp::max(1, (tx - sx) / ty) * ty; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:53:40 [INFO] [stdout] | [INFO] [stdout] 53 | ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] 53 + ty -= std::cmp::max(1, (ty - sy) / tx) * tx; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0783_minimum_distance_between_bst_nodes.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0814_binary_tree_pruning.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0817_linked_list_components.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0830_positions_of_large_groups.rs:49:18 [INFO] [stdout] | [INFO] [stdout] 49 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 49 - for i in (1..n) { [INFO] [stdout] 49 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0863_all_nodes_distance_k_in_binary_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0864_shortest_path_to_get_all_keys.rs:113:33 [INFO] [stdout] | [INFO] [stdout] 113 | keys |= (1 << (c - b'a')); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 113 - keys |= (1 << (c - b'a')); [INFO] [stdout] 113 + keys |= 1 << (c - b'a'); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0865_smallest_subtree_with_all_the_deepest_nodes.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0872_leaf_similar_trees.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0876_middle_of_the_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0878_nth_magical_number.rs:41:22 [INFO] [stdout] | [INFO] [stdout] 41 | let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] 41 + let mut hi = n * std::cmp::min(a, b); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0894_all_possible_full_binary_trees.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0897_increasing_order_search_tree.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0938_range_sum_of_bst.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0951_flip_equivalent_binary_trees.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0958_check_completeness_of_a_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0965_univalued_binary_tree.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0968_binary_tree_cameras.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0971_flip_binary_tree_to_match_preorder_traversal.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | if (arr[i] < arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 57 - if (arr[i] < arr[i - 1]) { [INFO] [stdout] 57 + if arr[i] < arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:60:23 [INFO] [stdout] | [INFO] [stdout] 60 | } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 60 - } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] 60 + } else if arr[i] > arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0979_distribute_coins_in_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0987_vertical_order_traversal_of_a_binary_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0988_smallest_string_starting_from_leaf.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0993_cousins_in_binary_tree.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0995_minimum_number_of_k_consecutive_bit_flips.rs:51:16 [INFO] [stdout] | [INFO] [stdout] 51 | if (i >= k) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - if (i >= k) { [INFO] [stdout] 51 + if i >= k { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0998_maximum_binary_tree_ii.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1008_construct_binary_search_tree_from_preorder_traversal.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1019_next_greater_node_in_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1022_sum_of_root_to_leaf_binary_numbers.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1026_maximum_difference_between_node_and_ancestor.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1028_recover_a_tree_from_preorder_traversal.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1038_binary_search_tree_to_greater_sum_tree.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1080_insufficient_nodes_in_root_to_leaf_paths.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1105_filling_bookcase_shelves.rs:51:22 [INFO] [stdout] | [INFO] [stdout] 51 | for j in (i..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - for j in (i..n) { [INFO] [stdout] 51 + for j in i..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1110_delete_nodes_and_return_forest.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1123_lowest_common_ancestor_of_deepest_leaves.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1145_binary_tree_coloring_game.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1147_longest_chunked_palindrome_decomposition.rs:54:16 [INFO] [stdout] | [INFO] [stdout] 54 | if (i <= prev_token_end) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 54 - if (i <= prev_token_end) { [INFO] [stdout] 54 + if i <= prev_token_end { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1161_maximum_level_sum_of_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1171_remove_zero_sum_consecutive_nodes_from_linked_list.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:72:20 [INFO] [stdout] | [INFO] [stdout] 72 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:62:28 [INFO] [stdout] | [INFO] [stdout] 62 | let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 62 - let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] 62 + let s_single = cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | (cnt_max > 1 [INFO] [stdout] | ^ [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 | && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 ~ cnt_max > 1 [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 ~ && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:55:16 [INFO] [stdout] | [INFO] [stdout] 55 | if (i % 2 != 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 55 - if (i % 2 != 0) { [INFO] [stdout] 55 + if i % 2 != 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:58:16 [INFO] [stdout] | [INFO] [stdout] 58 | if (map.contains_key(&(count - k))) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - if (map.contains_key(&(count - k))) { [INFO] [stdout] 58 + if map.contains_key(&(count - k)) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:61:16 [INFO] [stdout] | [INFO] [stdout] 61 | if (map.contains_key(&count)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - if (map.contains_key(&count)) { [INFO] [stdout] 61 + if map.contains_key(&count) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:65:25 [INFO] [stdout] | [INFO] [stdout] 65 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1278_palindrome_partitioning_iii.rs:71:19 [INFO] [stdout] | [INFO] [stdout] 71 | for ll in ((k - 1) as usize..l) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - for ll in ((k - 1) as usize..l) { [INFO] [stdout] 71 + for ll in (k - 1) as usize..l { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1290_convert_binary_number_in_a_linked_list_to_integer.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1302_deepest_leaves_sum.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1305_all_elements_in_two_binary_search_trees.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1315_sum_of_nodes_with_even_valued_grandparent.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1325_delete_leaves_with_a_given_value.rs:36:25 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1339_maximum_product_of_splitted_binary_tree.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 43 - if (left_child[i] != -1) { [INFO] [stdout] 43 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:46:16 [INFO] [stdout] | [INFO] [stdout] 46 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 46 - if (right_child[i] != -1) { [INFO] [stdout] 46 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | if (root < 0 || root >= n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (root < 0 || root >= n) { [INFO] [stdout] 53 + if root < 0 || root >= n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:63:16 [INFO] [stdout] | [INFO] [stdout] 63 | if (v.contains(&i)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - if (v.contains(&i)) { [INFO] [stdout] 63 + if v.contains(&i) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_child[i] != -1) { [INFO] [stdout] 69 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:72:16 [INFO] [stdout] | [INFO] [stdout] 72 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - if (right_child[i] != -1) { [INFO] [stdout] 72 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1367_linked_list_in_binary_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1367_linked_list_in_binary_tree.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1372_longest_zigzag_path_in_a_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1373_maximum_sum_bst_in_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1382_balance_a_binary_search_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let k = (k as usize); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - let k = (k as usize); [INFO] [stdout] 58 + let k = k as usize; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s1424_diagonal_traverse_ii.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..len) { [INFO] [stdout] 53 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:58:18 [INFO] [stdout] | [INFO] [stdout] 58 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - for i in (0..len) { [INFO] [stdout] 58 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1448_count_good_nodes_in_binary_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1457_pseudo_palindromic_paths_in_a_binary_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array.rs:50:62 [INFO] [stdout] | [INFO] [stdout] 50 | .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] 50 + .fold(target[0], |acc, z| acc + std::cmp::max(0, z.1 - z.0)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1530_number_of_good_leaf_nodes_pairs.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s1561_maximum_number_of_coins_you_can_get.rs:53:27 [INFO] [stdout] | [INFO] [stdout] 53 | piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] 53 + piles.iter().skip(piles.len() / 3).step_by(2).sum() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1609_even_odd_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:65:9 [INFO] [stdout] | [INFO] [stdout] 46 | / loop { [INFO] [stdout] 47 | | match heap.len() { [INFO] [stdout] 48 | | 0 => { [INFO] [stdout] 49 | | return 0; [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 65 | 1 [INFO] [stdout] | ^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `subp` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:160:24 [INFO] [stdout] | [INFO] [stdout] 160 | ([x, b'*', subp @ ..], [y, subs @ ..]) if *x == b'.' || x == y => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_subp` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let mut vec = Vec::new(); [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/solution/s0039_combination_sum.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | mut curr: Vec, [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/solution/s0040_combination_sum_ii.rs:48:13 [INFO] [stdout] | [INFO] [stdout] 48 | let mut vec = Vec::new(); [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/solution/s0040_combination_sum_ii.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:33:13 [INFO] [stdout] | [INFO] [stdout] 33 | for i in 0..n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:38:25 [INFO] [stdout] | [INFO] [stdout] 38 | let (mut l, mut mid, mut h) = (0, 0, nums.len() - 1); [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | for i in 0..deque.len() { [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/solution/s0164_maximum_gap.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | for i in 0..8 { [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/solution/s0179_largest_number.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut result = vs.join(""); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:65:22 [INFO] [stdout] | [INFO] [stdout] 65 | Some(n) => (), [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut temp = std::cmp::max(pre + nums[i], cur); [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/solution/s0219_contains_duplicate_ii.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | let mut prev = m.entry(x).or_insert(i); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0278_first_bad_version.rs:41:37 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn first_bad_version(&self, n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:57:27 [INFO] [stdout] | [INFO] [stdout] 57 | .scan(0, |mut state, x| { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | fn new(mut nested_list: Vec) -> Self { [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/solution/s0341_flatten_nested_list_iterator.rs:76:15 [INFO] [stdout] | [INFO] [stdout] 76 | fn unnest(mut nested_list: Vec) -> Vec { [INFO] [stdout] | ----^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:39:24 [INFO] [stdout] | [INFO] [stdout] 39 | .filter(|&(x, y)| y >= 2) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:40:23 [INFO] [stdout] | [INFO] [stdout] 40 | .map(|(x, y)| (x + 1) as i32) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_y` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0502_ipo.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0509_fibonacci_number.rs:51:21 [INFO] [stdout] | [INFO] [stdout] 51 | for i in 2..=n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0646_maximum_length_of_pair_chain.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = pairs.len() - 1; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0658_find_k_closest_elements.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let mut result = &mut arr[0..(k as usize)]; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:100:13 [INFO] [stdout] | [INFO] [stdout] 100 | let mut v = unsafe { search_word.as_bytes_mut() }; [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/solution/s0684_redundant_connection.rs:39:13 [INFO] [stdout] | [INFO] [stdout] 39 | let mut tmp = vec![]; [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/solution/s0687_longest_univalue_path.rs:62:17 [INFO] [stdout] | [INFO] [stdout] 62 | let mut left_max = Self::dfs_helper(&root.borrow().left, cur); [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/solution/s0687_longest_univalue_path.rs:63:17 [INFO] [stdout] | [INFO] [stdout] 63 | let mut right_max = Self::dfs_helper(&root.borrow().right, cur); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tail` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:72:27 [INFO] [stdout] | [INFO] [stdout] 72 | if let Some((&tail, &height)) = map.range(..end).last() { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_tail` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:78:36 [INFO] [stdout] | [INFO] [stdout] 78 | while let Some((&key, &height)) = iter.next() { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `count` is never read [INFO] [stdout] --> src/solution/s0764_largest_plus_sign.rs:44:17 [INFO] [stdout] | [INFO] [stdout] 44 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0770_basic_calculator_iv.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 163 | let mut op = if subtract { -1 } else { 1 }; [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0770_basic_calculator_iv.rs:234:13 [INFO] [stdout] | [INFO] [stdout] 234 | let mut it = &mut iter; [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/solution/s0771_jewels_and_stones.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut set = jewels.chars().collect::>(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0779_k_th_symbol_in_grammar.rs:47:24 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn kth_grammar(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `max` is never read [INFO] [stdout] --> src/solution/s0798_smallest_rotation_with_highest_score.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | let mut max = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `row_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut row_sum = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `col_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:83:17 [INFO] [stdout] | [INFO] [stdout] 83 | let mut col_sum = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num` is never read [INFO] [stdout] --> src/solution/s0842_split_array_into_fibonacci_sequence.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut num = 0i64; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word` [INFO] [stdout] --> src/solution/s0843_guess_the_word.rs:56:24 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn guess(self, word: String) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_word` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0846_hand_of_straights.rs:48:37 [INFO] [stdout] | [INFO] [stdout] 48 | if let Some(mut x) = map.get_mut(&(it + i)).or(Some(&mut 0)) { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0850_rectangle_area_ii.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut xi = xs.binary_search(&rec[0]).unwrap(); [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/solution/s0850_rectangle_area_ii.rs:59:21 [INFO] [stdout] | [INFO] [stdout] 59 | let mut yi = ys.binary_search(&rec[1]).unwrap(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `current_iter` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | for current_iter in 0..queue_size { [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_iter` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `front_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:55:25 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_front_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_s2_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:46:17 [INFO] [stdout] | [INFO] [stdout] 46 | let mut queue_size = queue.len(); [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/solution/s0854_k_similar_strings.rs:55:21 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [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/solution/s0854_k_similar_strings.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [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/solution/s0854_k_similar_strings.rs:87:17 [INFO] [stdout] | [INFO] [stdout] 87 | let mut slice = s.as_bytes_mut(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `target_val` is never read [INFO] [stdout] --> src/solution/s0855_exam_room.rs:106:21 [INFO] [stdout] | [INFO] [stdout] 106 | target_val = self.n - 1; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0864_shortest_path_to_get_all_keys.rs:82:13 [INFO] [stdout] | [INFO] [stdout] 82 | let mut all_keys = (1 << max) - 1; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `len` [INFO] [stdout] --> src/solution/s0866_prime_palindrome.rs:51:25 [INFO] [stdout] | [INFO] [stdout] 51 | let len = s.len(); [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_len` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0867_transpose_matrix.rs:43:29 [INFO] [stdout] | [INFO] [stdout] 43 | let mut vec: Vec = vec![*v2]; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s0874_walking_robot_simulation.rs:91:21 [INFO] [stdout] | [INFO] [stdout] 91 | for k in 0..cmd { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `piles` [INFO] [stdout] --> src/solution/s0877_stone_game.rs:42:23 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn stone_game(piles: Vec) -> bool { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_piles` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:59:25 [INFO] [stdout] | [INFO] [stdout] 59 | for i in 1..=len { [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/solution/s0885_spiral_matrix_iii.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | for i in 1..=len { [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/solution/s0885_spiral_matrix_iii.rs:73:25 [INFO] [stdout] | [INFO] [stdout] 73 | for i in 1..=len { [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/solution/s0885_spiral_matrix_iii.rs:80:25 [INFO] [stdout] | [INFO] [stdout] 80 | for i in 1..=len { [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/solution/s0897_increasing_order_search_tree.rs:55:13 [INFO] [stdout] | [INFO] [stdout] 55 | let mut dm = Rc::new(RefCell::new(TreeNode::new(0))); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0928_minimize_malware_spread_ii.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | let mut result: Vec<(i32, std::collections::HashSet)> = initial [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0959_regions_cut_by_slashes.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = grid.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `r` is never read [INFO] [stdout] --> src/solution/s0964_least_operators_to_express_number.rs:68:25 [INFO] [stdout] | [INFO] [stdout] 68 | let mut r = i32::MAX; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s1002_find_common_characters.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | .filter(|(i, c)| **c > 0) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut v1 = heap.pop().unwrap(); [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/solution/s1046_last_stone_weight.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let mut v2 = heap.pop().unwrap(); [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/solution/s1053_previous_permutation_with_one_swap.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let mut arr = arr; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s1093_statistics_from_a_large_sample.rs:69:17 [INFO] [stdout] | [INFO] [stdout] 69 | let mut mid = 0.0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `r` is never read [INFO] [stdout] --> src/solution/s1096_brace_expansion_ii.rs:89:21 [INFO] [stdout] | [INFO] [stdout] 89 | let mut r = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1096_brace_expansion_ii.rs:79:17 [INFO] [stdout] | [INFO] [stdout] 79 | let mut str = stack.pop().unwrap(); [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/solution/s1110_delete_nodes_and_return_forest.rs:61:13 [INFO] [stdout] | [INFO] [stdout] 61 | let mut root = root; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `this_sum` [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:29 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_this_sum` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `count` is assigned to, but never used [INFO] [stdout] --> src/solution/s1162_as_far_from_land_as_possible.rs:40:17 [INFO] [stdout] | [INFO] [stdout] 40 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_count` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1178_number_of_valid_words_for_each_puzzle.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut words = words [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/solution/s1178_number_of_valid_words_for_each_puzzle.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let mut puzzles = puzzles [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1202_smallest_string_with_swaps.rs:96:14 [INFO] [stdout] | [INFO] [stdout] 96 | for (k, v) in map.iter() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1340_jump_game_v.rs:54:25 [INFO] [stdout] | [INFO] [stdout] 54 | .map(|(idx, num)| Self::dfs(&arr, &mut memo, d as usize, idx)) [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `i` is assigned to, but never used [INFO] [stdout] --> src/solution/s1371_find_the_longest_substring_containing_vowels_in_even_counts.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut i = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_i` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:47:28 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn max_performance(n: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1464_maximum_product_of_two_elements_in_an_array.rs:54:23 [INFO] [stdout] | [INFO] [stdout] 54 | .fold(1, |mut res, x| res * (x - 1)) [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `str2` is never read [INFO] [stdout] --> src/solution/s1487_making_file_names_unique.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut str2 = String::new(); [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable pattern [INFO] [stdout] --> src/solution/s1514_path_with_maximum_probability.rs:94:17 [INFO] [stdout] | [INFO] [stdout] 82 | Pair(prob, curr) => { [INFO] [stdout] | ---------------- matches any value [INFO] [stdout] ... [INFO] [stdout] 94 | _ => (), [INFO] [stdout] | ^ unreachable pattern [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1582_special_positions_in_a_binary_matrix.rs:44:27 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, v)| { [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/solution/s1582_special_positions_in_a_binary_matrix.rs:44:36 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, v)| { [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/solution/s1593_split_a_string_into_the_max_number_of_unique_substrings.rs:62:21 [INFO] [stdout] | [INFO] [stdout] 62 | let mut substr = [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `l` [INFO] [stdout] --> src/solution/s1606_find_servers_that_handled_most_number_of_requests.rs:72:31 [INFO] [stdout] | [INFO] [stdout] 72 | while let Some((&t2, &l)) = iterator.peek() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_l` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1614_maximum_nesting_depth_of_the_parentheses.rs:43:23 [INFO] [stdout] | [INFO] [stdout] 43 | .scan(0, |mut state, c| { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated constant `BLUE` is never used [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:43:11 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated constant in this implementation [INFO] [stdout] ... [INFO] [stdout] 43 | const BLUE: i32 = 2; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LRUCache` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, and `put` are never used [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl LRUCache { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 61 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MinStack` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | 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/solution/s0155_min_stack.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl MinStack { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 56 | /** initialize your data structure here. */ [INFO] [stdout] 57 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn get_min(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `go_left`, `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 83 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 84 | fn go_left(stack: &mut Vec>>, mut node: Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | 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/solution/s0208_implement_trie_prefix_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 55 | /** Initialize your data structure here. */ [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordDictionary` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_word`, `search`, and `search_trie` are never used [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl WordDictionary { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 61 | /** Initialize your data structure here. */ [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn add_word(&mut self, word: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn search_trie(trie: &Trie, word: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyStack` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | 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/solution/s0225_implement_stack_using_queues.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 60 | /** Initialize your data structure here. */ [INFO] [stdout] 61 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | 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/solution/s0232_implement_queue_using_stacks.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 59 | /** Initialize your data structure here. */ [INFO] [stdout] 60 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn peek(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MedianFinder` is never constructed [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | 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/solution/s0295_find_median_from_data_stream.rs:64:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl MedianFinder { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 63 | /** initialize your data structure here. */ [INFO] [stdout] 64 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn add_num(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn find_median(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 63 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, `preorder_dfs`, `deserialize`, and `build_tree` are never used [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 69 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 70 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn preorder_dfs(node: Option>>, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn build_tree(src: &[Option], cur: &mut usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct NumArray(Vec); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_range` are never used [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | 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/solution/s0304_range_sum_query_2d_immutable.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumMatrix` is never constructed [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct NumMatrix(Vec>); [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_region` are never used [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl NumMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 53 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct NumArray(Vec); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn update(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | 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/solution/s0341_flatten_nested_list_iterator.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Int` and `List` are never constructed [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:49:5 [INFO] [stdout] | [INFO] [stdout] 48 | pub enum NestedInteger { [INFO] [stdout] | ------------- variants in this enum [INFO] [stdout] 49 | Int(i32), [INFO] [stdout] | ^^^ [INFO] [stdout] 50 | List(Vec), [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `NestedInteger` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NestedIterator` is never constructed [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct NestedIterator { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, `has_next`, and `unnest` are never used [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 61 | impl NestedIterator { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 62 | fn new(mut nested_list: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn has_next(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn unnest(mut nested_list: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SummaryRanges` is never constructed [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct SummaryRanges { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `remove`, `insert`, `add_num`, and `get_intervals` are never used [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl SummaryRanges { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 59 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn remove(&mut self, l: i32, r: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn insert(&mut self, l: i32, r: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn add_num(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn get_intervals(&self) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `tweets` is never read [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:52:5 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Twitter { [INFO] [stdout] | ------- field in this struct [INFO] [stdout] 52 | tweets: Vec<(Tweet, User)>, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Twitter` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `post_tweet`, and `get_news_feed` are never used [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl Twitter { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 61 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn post_tweet(&mut self, user_id: User, tweet_id: Tweet) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn get_news_feed(&self, user_id: User) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static `PICK` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | static mut PICK: i32 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `guess` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:41:11 [INFO] [stdout] | [INFO] [stdout] 41 | unsafe fn guess(num: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `guess_number` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:61:15 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | unsafe fn guess_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0380_insert_delete_getrandom_o1.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RandomizedSet` is never constructed [INFO] [stdout] --> src/solution/s0380_insert_delete_getrandom_o1.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | 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/solution/s0380_insert_delete_getrandom_o1.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl RandomizedSet { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 59 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn get_random(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RandomizedCollection` is never constructed [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct RandomizedCollection { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl RandomizedCollection { [INFO] [stdout] | ------------------------- associated items in this implementation [INFO] [stdout] 58 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_random(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 67 | pub struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_random` are never used [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 77 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 78 | fn new(head: Option>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn get_random(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0384_shuffle_an_array.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `reset`, and `shuffle` are never used [INFO] [stdout] --> src/solution/s0384_shuffle_an_array.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn reset(&mut self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn shuffle(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0398_random_pick_index.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick` are never used [INFO] [stdout] --> src/solution/s0398_random_pick_index.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 50 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn pick(&mut self, target: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AllOne` is never constructed [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct AllOne { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `inc`, `dec`, `get_max_key`, and `get_min_key` are never used [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl AllOne { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn inc(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn dec(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn get_max_key(&self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn get_min_key(&self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `to_rc` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:54:4 [INFO] [stdout] | [INFO] [stdout] 54 | fn to_rc(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `val_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:63:4 [INFO] [stdout] | [INFO] [stdout] 63 | fn val_of(root: &Option>>) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `left_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:75:4 [INFO] [stdout] | [INFO] [stdout] 75 | fn left_of(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:90:4 [INFO] [stdout] | [INFO] [stdout] 90 | fn right_of(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `append_to_left` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:105:4 [INFO] [stdout] | [INFO] [stdout] 105 | fn append_to_left(root: &Option>>, val: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `append_to_right` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:120:4 [INFO] [stdout] | [INFO] [stdout] 120 | fn append_to_right( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:136:8 [INFO] [stdout] | [INFO] [stdout] 136 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, and `deserialize` are never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:143:8 [INFO] [stdout] | [INFO] [stdout] 142 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 143 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 186 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pluck` are never used [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:73:8 [INFO] [stdout] | [INFO] [stdout] 72 | impl ListNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 73 | fn new(key: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn pluck(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FrequencyBin` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:95:8 [INFO] [stdout] | [INFO] [stdout] 95 | struct FrequencyBin { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `remove_key`, `push_back`, and `pop_front` are never used [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:104:8 [INFO] [stdout] | [INFO] [stdout] 103 | impl FrequencyBin { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 104 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn remove_key(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 130 | fn push_back(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 144 | fn pop_front(&mut self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CacheItem` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:150:8 [INFO] [stdout] | [INFO] [stdout] 150 | struct CacheItem { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LFUCache` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:155:8 [INFO] [stdout] | [INFO] [stdout] 155 | struct LFUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `evict`, `get`, and `put` are never used [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:168:8 [INFO] [stdout] | [INFO] [stdout] 167 | impl LFUCache { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 168 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 178 | fn evict(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 185 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 203 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0478_generate_random_point_in_a_circle.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `rand_point` are never used [INFO] [stdout] --> src/solution/s0478_generate_random_point_in_a_circle.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 51 | fn new(radius: f64, x_center: f64, y_center: f64) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn rand_point(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0488_zuma_game.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_min_step`, `dfs`, `find_next_state`, and `dropable` are never used [INFO] [stdout] --> src/solution/s0488_zuma_game.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 61 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 62 | fn find_min_step(board: String, hand: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn dfs(start: usize, state: u32, board: Vec, res: &mut i32, hand: &[char], n: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn find_next_state(c: char, state: u32, hand: &[char], n: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn dropable(board: &[char]) -> Option> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0497_random_point_in_non_overlapping_rectangles.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick` are never used [INFO] [stdout] --> src/solution/s0497_random_point_in_non_overlapping_rectangles.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 57 | fn new(rects: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn pick(&self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0519_random_flip_matrix.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `flip`, and `reset` are never used [INFO] [stdout] --> src/solution/s0519_random_flip_matrix.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(m: i32, n: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn flip(&mut self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn reset(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0528_random_pick_with_weight.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick_index` are never used [INFO] [stdout] --> src/solution/s0528_random_pick_with_weight.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 69 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 70 | fn new(w: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn pick_index(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0535_encode_and_decode_tinyurl.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0535_encode_and_decode_tinyurl.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Codec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `encode`, and `decode` are never used [INFO] [stdout] --> src/solution/s0535_encode_and_decode_tinyurl.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 47 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 48 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn encode(&mut self, long_url: String) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn decode(&self, short_url: String) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Tok` is never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:43:6 [INFO] [stdout] | [INFO] [stdout] 43 | enum Tok { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Fraction` is never constructed [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Fraction { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `reduce` are never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl Fraction { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 55 | fn new(sign: i32, numerator: i32, denominator: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn add(self, other: Self) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn reduce(self) -> Self { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gcd` is never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:102:4 [INFO] [stdout] | [INFO] [stdout] 102 | fn gcd(mut m: i32, mut n: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `fraction_addition` is never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:112:8 [INFO] [stdout] | [INFO] [stdout] 111 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 112 | fn fraction_addition(expression: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0622_design_circular_queue.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCircularQueue` is never constructed [INFO] [stdout] --> src/solution/s0622_design_circular_queue.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct MyCircularQueue { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/solution/s0622_design_circular_queue.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl MyCircularQueue { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 63 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn en_queue(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn de_queue(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 88 | fn front(&self) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn rear(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0641_design_circular_deque.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCircularDeque` is never constructed [INFO] [stdout] --> src/solution/s0641_design_circular_deque.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct MyCircularDeque { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/solution/s0641_design_circular_deque.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl MyCircularDeque { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 65 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn insert_front(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn insert_last(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn delete_front(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn delete_last(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_front(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 125 | fn get_rear(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 133 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 137 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0675_cut_off_trees_for_golf_event.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `cut_off_tree` and `bfs_helper` are never used [INFO] [stdout] --> src/solution/s0675_cut_off_trees_for_golf_event.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 51 | // Credit: https://rustgym.com/leetcode/675 [INFO] [stdout] 52 | fn cut_off_tree(forest: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn bfs_helper( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MagicDictionary` is never constructed [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | struct MagicDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `build_dict`, and `search` are never used [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 70 | impl MagicDictionary { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 71 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn build_dict(&mut self, dictionary: Vec) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn search(&self, mut search_word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MapSum` is never constructed [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct MapSum { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `sum` are never used [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl MapSum { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 63 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn insert(&mut self, key: String, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn sum(&self, prefix: String) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `KthLargest` is never constructed [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct KthLargest { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `get_kth` are never used [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl KthLargest { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 53 | fn new(k: i32, nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn add(&mut self, val: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn get_kth(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0705_design_hashset.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashSet` is never constructed [INFO] [stdout] --> src/solution/s0705_design_hashset.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct MyHashSet { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, `remove`, and `contains` are never used [INFO] [stdout] --> src/solution/s0705_design_hashset.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 51 | impl MyHashSet { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 52 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | fn add(&mut self, key: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn contains(&self, key: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `TABLE_SIZE` is never used [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:45:7 [INFO] [stdout] | [INFO] [stdout] 45 | const TABLE_SIZE: usize = 32; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashMap` is never constructed [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct MyHashMap { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `put`, `get`, and `remove` are never used [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl MyHashMap { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 57 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyLinkedList` is never constructed [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | struct MyLinkedList { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, `add_at_head`, `add_at_tail`, `add_at_index`, and `delete_at_index` are never used [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl MyLinkedList { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 65 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn get(&self, index: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn add_at_head(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | fn add_at_tail(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn add_at_index(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0710_random_pick_with_blacklist.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick` are never used [INFO] [stdout] --> src/solution/s0710_random_pick_with_blacklist.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 58 | fn new(n: i32, blacklist: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn pick(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0715_range_module.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RangeModule` is never constructed [INFO] [stdout] --> src/solution/s0715_range_module.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct RangeModule { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_range`, `query_range`, and `remove_range` are never used [INFO] [stdout] --> src/solution/s0715_range_module.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl RangeModule { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 54 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn add_range(&mut self, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn query_range(&self, left: i32, right: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn remove_range(&mut self, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0729_my_calendar_i.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendar` is never constructed [INFO] [stdout] --> src/solution/s0729_my_calendar_i.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct MyCalendar { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/solution/s0729_my_calendar_i.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 48 | impl MyCalendar { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 49 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0731_my_calendar_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendarTwo` is never constructed [INFO] [stdout] --> src/solution/s0731_my_calendar_ii.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct MyCalendarTwo { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/solution/s0731_my_calendar_ii.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl MyCalendarTwo { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 53 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0732_my_calendar_iii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendarThree` is never constructed [INFO] [stdout] --> src/solution/s0732_my_calendar_iii.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct MyCalendarThree { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/solution/s0732_my_calendar_iii.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 51 | impl MyCalendarThree { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 52 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn book(&mut self, start: i32, end: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordFilter` is never constructed [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct WordFilter { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `f` are never used [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl WordFilter { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 56 | fn new(words: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn f(&self, pref: String, suff: String) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0855_exam_room.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ExamRoom` is never constructed [INFO] [stdout] --> src/solution/s0855_exam_room.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct ExamRoom { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `seat`, and `leave` are never used [INFO] [stdout] --> src/solution/s0855_exam_room.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl ExamRoom { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 55 | fn new(n: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn seat(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 115 | fn leave(&mut self, p: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `wage` is never read [INFO] [stdout] --> src/solution/s0857_minimum_cost_to_hire_k_workers.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 44 | struct Worker { [INFO] [stdout] | ------ field in this struct [INFO] [stdout] ... [INFO] [stdout] 47 | wage: i32, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Worker` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0895_maximum_frequency_stack.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FreqStack` is never constructed [INFO] [stdout] --> src/solution/s0895_maximum_frequency_stack.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct FreqStack { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, and `pop` are never used [INFO] [stdout] --> src/solution/s0895_maximum_frequency_stack.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 61 | impl FreqStack { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0900_rle_iterator.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RLEIterator` is never constructed [INFO] [stdout] --> src/solution/s0900_rle_iterator.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct RLEIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `next` are never used [INFO] [stdout] --> src/solution/s0900_rle_iterator.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl RLEIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 57 | fn new(encoding: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn next(&mut self, n: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0901_online_stock_span.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `StockSpanner` is never constructed [INFO] [stdout] --> src/solution/s0901_online_stock_span.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct StockSpanner { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `next` are never used [INFO] [stdout] --> src/solution/s0901_online_stock_span.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl StockSpanner { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 58 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn next(&mut self, price: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0911_online_election.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TopVotedCandidate` is never constructed [INFO] [stdout] --> src/solution/s0911_online_election.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct TopVotedCandidate { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `q` are never used [INFO] [stdout] --> src/solution/s0911_online_election.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl TopVotedCandidate { [INFO] [stdout] | ---------------------- associated items in this implementation [INFO] [stdout] 57 | fn new(persons: Vec, times: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn q(&self, t: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CBTInserter` is never constructed [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | struct CBTInserter { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `get_root` are never used [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 76 | impl CBTInserter { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 77 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn insert(&mut self, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_root(&self) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0933_number_of_recent_calls.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RecentCounter` is never constructed [INFO] [stdout] --> src/solution/s0933_number_of_recent_calls.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | struct RecentCounter { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `ping` are never used [INFO] [stdout] --> src/solution/s0933_number_of_recent_calls.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 49 | impl RecentCounter { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 50 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn ping(&mut self, t: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0981_time_based_key_value_store.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TimeMap` is never constructed [INFO] [stdout] --> src/solution/s0981_time_based_key_value_store.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct TimeMap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `set`, and `get` are never used [INFO] [stdout] --> src/solution/s0981_time_based_key_value_store.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl TimeMap { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 55 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn set(&mut self, key: String, value: String, timestamp: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn get(&self, key: String, timestamp: i32) -> String { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `n` is never read [INFO] [stdout] --> src/solution/s1001_grid_illumination.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 49 | struct LampGrid { [INFO] [stdout] | -------- field in this struct [INFO] [stdout] ... [INFO] [stdout] 55 | n: usize, [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `StreamChecker` is never constructed [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct StreamChecker { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition_point` is never used [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:58:4 [INFO] [stdout] | [INFO] [stdout] 58 | fn partition_point(words: &[Vec], mut f: F) -> usize [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `prefix_exists` is never used [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:75:4 [INFO] [stdout] | [INFO] [stdout] 75 | fn prefix_exists(words: &[Vec], char_i: usize, query: &[char]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `query` are never used [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 95 | impl StreamChecker { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 96 | fn new(words: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | fn query(&mut self, letter: char) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1146_snapshot_array.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SnapshotArray` is never constructed [INFO] [stdout] --> src/solution/s1146_snapshot_array.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct SnapshotArray { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `set`, `snap`, and `get` are never used [INFO] [stdout] --> src/solution/s1146_snapshot_array.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 49 | impl SnapshotArray { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 50 | fn new(length: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn set(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn snap(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn get(&self, index: i32, snap_id: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1157_online_majority_element_in_subarray.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MajorityChecker` is never constructed [INFO] [stdout] --> src/solution/s1157_online_majority_element_in_subarray.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct MajorityChecker { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/solution/s1157_online_majority_element_in_subarray.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl MajorityChecker { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 56 | fn new(arr: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn query(&mut self, left: i32, right: i32, threshold: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn find_max( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 120 | fn build_tree(arr: &[i32], tree: &mut Vec>, root: i32, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn merge(root: &mut Vec, left: Vec, right: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn lower_bound(v: &[i32], e: &i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 164 | fn upper_bound(v: &[i32], e: &i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DinnerPlates` is never constructed [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | struct DinnerPlates { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `pop_at_stack`, and `pop_at_idx` are never used [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:87:8 [INFO] [stdout] | [INFO] [stdout] 86 | impl DinnerPlates { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 87 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 120 | fn pop_at_stack(&mut self, index: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | fn pop_at_idx(&mut self, index: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:54:6 [INFO] [stdout] | [INFO] [stdout] 54 | type Link = std::rc::Rc>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `new_link` is never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:56:4 [INFO] [stdout] | [INFO] [stdout] 56 | fn new_link(value: i32) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 67 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 68 | pub fn new(value: i32) -> Node { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Skiplist` is never constructed [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | struct Skiplist { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, `search`, `add`, and `erase` are never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 85 | impl Skiplist { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 86 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn find(&self, target: i32) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn search(&self, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | fn add(&mut self, num: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 151 | fn erase(&self, num: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FindElements` is never constructed [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:95:8 [INFO] [stdout] | [INFO] [stdout] 95 | struct FindElements { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, and `populate` are never used [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:106:8 [INFO] [stdout] | [INFO] [stdout] 105 | impl FindElements { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 106 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 112 | fn find(&self, target: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn populate(&mut self, root: &Option>>, index: i32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1286_iterator_for_combination.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CombinationIterator` is never constructed [INFO] [stdout] --> src/solution/s1286_iterator_for_combination.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct CombinationIterator { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/solution/s1286_iterator_for_combination.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl CombinationIterator { [INFO] [stdout] | ------------------------ associated items in this implementation [INFO] [stdout] 53 | fn new(characters: String, combination_length: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn next(&mut self) -> String { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1348_tweet_counts_per_frequency.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TweetCounts` is never constructed [INFO] [stdout] --> src/solution/s1348_tweet_counts_per_frequency.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | struct TweetCounts { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `record_tweet`, and `get_tweet_counts_per_frequency` are never used [INFO] [stdout] --> src/solution/s1348_tweet_counts_per_frequency.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl TweetCounts { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 65 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn record_tweet(&mut self, tweet_name: String, time: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn get_tweet_counts_per_frequency( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1352_product_of_the_last_k_numbers.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ProductOfNumbers` is never constructed [INFO] [stdout] --> src/solution/s1352_product_of_the_last_k_numbers.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct ProductOfNumbers { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `get_product` are never used [INFO] [stdout] --> src/solution/s1352_product_of_the_last_k_numbers.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl ProductOfNumbers { [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 58 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn add(&mut self, num: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn get_product(&self, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1357_apply_discount_every_n_orders.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Cashier` is never constructed [INFO] [stdout] --> src/solution/s1357_apply_discount_every_n_orders.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | struct Cashier { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_bill` are never used [INFO] [stdout] --> src/solution/s1357_apply_discount_every_n_orders.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 73 | impl Cashier { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 74 | fn new(n: i32, discount: i32, products: Vec, prices: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | fn get_bill(&mut self, product: Vec, amount: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1381_design_a_stack_with_increment_operation.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CustomStack` is never constructed [INFO] [stdout] --> src/solution/s1381_design_a_stack_with_increment_operation.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct CustomStack { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, and `increment` are never used [INFO] [stdout] --> src/solution/s1381_design_a_stack_with_increment_operation.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl CustomStack { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 60 | fn new(max_size: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn increment(&mut self, k: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1396_design_underground_system.rs:80:12 [INFO] [stdout] | [INFO] [stdout] 80 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UndergroundSystem` is never constructed [INFO] [stdout] --> src/solution/s1396_design_underground_system.rs:88:8 [INFO] [stdout] | [INFO] [stdout] 88 | struct UndergroundSystem { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `check_in`, `check_out`, and `get_average_time` are never used [INFO] [stdout] --> src/solution/s1396_design_underground_system.rs:98:8 [INFO] [stdout] | [INFO] [stdout] 97 | impl UndergroundSystem { [INFO] [stdout] | ---------------------- associated items in this implementation [INFO] [stdout] 98 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn check_in(&mut self, id: i32, station_name: String, t: i32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | fn check_out(&mut self, id: i32, station_name: String, t: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_average_time(&self, start_station: String, end_station: String) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1472_design_browser_history.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BrowserHistory` is never constructed [INFO] [stdout] --> src/solution/s1472_design_browser_history.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct BrowserHistory { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `visit`, `back`, and `forward` are never used [INFO] [stdout] --> src/solution/s1472_design_browser_history.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl BrowserHistory { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 61 | fn new(homepage: String) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn visit(&mut self, url: String) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn back(&mut self, steps: i32) -> String { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn forward(&mut self, steps: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1476_subrectangle_queries.rs:76:12 [INFO] [stdout] | [INFO] [stdout] 76 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SubrectangleQueries` is never constructed [INFO] [stdout] --> src/solution/s1476_subrectangle_queries.rs:83:8 [INFO] [stdout] | [INFO] [stdout] 83 | struct SubrectangleQueries { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update_subrectangle`, and `get_value` are never used [INFO] [stdout] --> src/solution/s1476_subrectangle_queries.rs:92:8 [INFO] [stdout] | [INFO] [stdout] 91 | impl SubrectangleQueries { [INFO] [stdout] | ------------------------ associated items in this implementation [INFO] [stdout] 92 | fn new(rectangle: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn update_subrectangle(&mut self, row1: i32, col1: i32, row2: i32, col2: i32, new_value: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 113 | fn get_value(&self, row: i32, col: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1483_kth_ancestor_of_a_tree_node.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeAncestor` is never constructed [INFO] [stdout] --> src/solution/s1483_kth_ancestor_of_a_tree_node.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct TreeAncestor { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_kth_ancestor` are never used [INFO] [stdout] --> src/solution/s1483_kth_ancestor_of_a_tree_node.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 50 | impl TreeAncestor { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 51 | fn new(n: i32, parent: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn get_kth_ancestor(&mut self, node: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1600_throne_inheritance.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ThroneInheritance` is never constructed [INFO] [stdout] --> src/solution/s1600_throne_inheritance.rs:68:8 [INFO] [stdout] | [INFO] [stdout] 68 | struct ThroneInheritance { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `birth`, `death`, `get_inheritance_order`, and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s1600_throne_inheritance.rs:79:8 [INFO] [stdout] | [INFO] [stdout] 78 | impl ThroneInheritance { [INFO] [stdout] | ---------------------- associated items in this implementation [INFO] [stdout] 79 | fn new(king_name: String) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | fn birth(&mut self, parent_name: String, child_name: String) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn death(&mut self, name: String) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn get_inheritance_order(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | fn dfs_helper(&self, name: &str, order: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1603_design_parking_system.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ParkingSystem` is never constructed [INFO] [stdout] --> src/solution/s1603_design_parking_system.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct ParkingSystem { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `add_car` are never used [INFO] [stdout] --> src/solution/s1603_design_parking_system.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 48 | impl ParkingSystem { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 49 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn add_car(&mut self, car_type: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1622_fancy_sequence.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MOD` is never used [INFO] [stdout] --> src/solution/s1622_fancy_sequence.rs:50:7 [INFO] [stdout] | [INFO] [stdout] 50 | const MOD: i64 = 1_000_000_007; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Fancy` is never constructed [INFO] [stdout] --> src/solution/s1622_fancy_sequence.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Fancy { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `append`, `add_all`, `mult_all`, `get_index`, and `mod_pow` are never used [INFO] [stdout] --> src/solution/s1622_fancy_sequence.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl Fancy { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 63 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn append(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn add_all(&mut self, inc: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn mult_all(&mut self, m: i32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | fn get_index(&self, idx: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn mod_pow(&self, x: i64, y: i64) -> i64 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused borrow that must be used [INFO] [stdout] --> src/solution/s0368_largest_divisible_subset.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | &nums.sort_unstable(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ the borrow produces a value [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = &nums.sort_unstable(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 518 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::env` [INFO] [stdout] --> src/main.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | use std::env; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs` [INFO] [stdout] --> src/main.rs:155:9 [INFO] [stdout] | [INFO] [stdout] 155 | use std::fs; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `futures::stream::StreamExt` [INFO] [stdout] --> src/main.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use futures::stream::StreamExt; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `is_random` is assigned to, but never used [INFO] [stdout] --> src/main.rs:38:17 [INFO] [stdout] | [INFO] [stdout] 38 | let mut is_random = false; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_is_random` instead [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `is_solving` is assigned to, but never used [INFO] [stdout] --> src/main.rs:39:17 [INFO] [stdout] | [INFO] [stdout] 39 | let mut is_solving = false; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_is_solving` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `id` is never read [INFO] [stdout] --> src/main.rs:40:17 [INFO] [stdout] | [INFO] [stdout] 40 | let mut id: u32 = 0; [INFO] [stdout] | ^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `is_random` is never read [INFO] [stdout] --> src/main.rs:54:13 [INFO] [stdout] | [INFO] [stdout] 54 | is_random = true; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `is_solving` is never read [INFO] [stdout] --> src/main.rs:59:13 [INFO] [stdout] | [INFO] [stdout] 59 | is_solving = true; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/main.rs:75:17 [INFO] [stdout] | [INFO] [stdout] 75 | let mut mod_file_addon = Arc::new(Mutex::new(vec![])); [INFO] [stdout] | ----^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:119:13 [INFO] [stdout] | [INFO] [stdout] 119 | writeln!(lib_file, "{}", mod_file_addon.lock().unwrap().join("\n")); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:315:5 [INFO] [stdout] | [INFO] [stdout] 315 | fs::write(mod_file, lines.join("\n")); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 315 | let _ = fs::write(mod_file, lines.join("\n")); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:321:5 [INFO] [stdout] | [INFO] [stdout] 321 | writeln!(lib_file, "mod {};", solution_name); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:364:9 [INFO] [stdout] | [INFO] [stdout] 364 | writeln!(lib_file, "mod {};", file_name); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 13 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 37.92s [INFO] running `Command { std: "docker" "inspect" "6b1f609fcf126694e401905b848d26f6e4351c1aea19a08ff5cff19dd137e896", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "6b1f609fcf126694e401905b848d26f6e4351c1aea19a08ff5cff19dd137e896", kill_on_drop: false }` [INFO] [stdout] 6b1f609fcf126694e401905b848d26f6e4351c1aea19a08ff5cff19dd137e896 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] c36acc8ad69b436728a42423839659c5c95ba44b5109f51d850ec4da9c577836 [INFO] running `Command { std: "docker" "start" "-a" "c36acc8ad69b436728a42423839659c5c95ba44b5109f51d850ec4da9c577836", kill_on_drop: false }` [INFO] [stderr] Compiling assert_float_eq v1.1.3 [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::linked_list::{to_list, ListNode}; [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/solution/s0019_remove_nth_node_from_end_of_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:31:32 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:73:20 [INFO] [stdout] | [INFO] [stdout] 73 | if (board[i][j] != '.') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (board[i][j] != '.') { [INFO] [stdout] 73 + if board[i][j] != '.' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:77:24 [INFO] [stdout] | [INFO] [stdout] 77 | if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 77 - if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] 77 + if used1[i][num] || used2[j][num] || used3[k][num] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:47:27 [INFO] [stdout] | [INFO] [stdout] 47 | } else if (j == n - 1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - } else if (j == n - 1) { [INFO] [stdout] 47 + } else if j == n - 1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:42:16 [INFO] [stdout] | [INFO] [stdout] 42 | if (nums[mid] == target) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 42 - if (nums[mid] == target) { [INFO] [stdout] 42 + if nums[mid] == target { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | } else if (nums[mid] > nums[h]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - } else if (nums[mid] > nums[h]) { [INFO] [stdout] 44 + } else if nums[mid] > nums[h] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0086_partition_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:44:25 [INFO] [stdout] | [INFO] [stdout] 44 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0100_same_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0112_path_sum.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..prices.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..prices.len()) { [INFO] [stdout] 53 + for i in 0..prices.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:50:20 [INFO] [stdout] | [INFO] [stdout] 50 | if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] 50 + if s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1]) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:42:25 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:39:15 [INFO] [stdout] | [INFO] [stdout] 39 | while (ugly_numbers.len() < n as usize) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 39 - while (ugly_numbers.len() < n as usize) { [INFO] [stdout] 39 + while ugly_numbers.len() < n as usize { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:47:16 [INFO] [stdout] | [INFO] [stdout] 47 | if (last == ugly_numbers[x] * 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - if (last == ugly_numbers[x] * 2) { [INFO] [stdout] 47 + if last == ugly_numbers[x] * 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:50:16 [INFO] [stdout] | [INFO] [stdout] 50 | if (last == ugly_numbers[y] * 3) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (last == ugly_numbers[y] * 3) { [INFO] [stdout] 50 + if last == ugly_numbers[y] * 3 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | if (last == ugly_numbers[z] * 5) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (last == ugly_numbers[z] * 5) { [INFO] [stdout] 53 + if last == ugly_numbers[z] * 5 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:36:25 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s0315_count_of_smaller_numbers_after_self.rs:44:28 [INFO] [stdout] | [INFO] [stdout] 44 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0328_odd_even_linked_list.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0337_house_robber_iii.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0376_wiggle_subsequence.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | if (size == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (size == 0) { [INFO] [stdout] 50 + if size == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0404_sum_of_left_leaves.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:38:28 [INFO] [stdout] | [INFO] [stdout] 38 | answer.push(if (i % 15 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - answer.push(if (i % 15 == 0) { [INFO] [stdout] 38 + answer.push(if i % 15 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i % 3 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i % 3 == 0) { [INFO] [stdout] 41 + if i % 3 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:44:24 [INFO] [stdout] | [INFO] [stdout] 44 | if (i % 5 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - if (i % 5 == 0) { [INFO] [stdout] 44 + if i % 5 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0437_path_sum_iii.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0445_add_two_numbers_ii.rs:34:32 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0450_delete_node_in_a_bst.rs:45:25 [INFO] [stdout] | [INFO] [stdout] 45 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s0475_heaters.rs:52:47 [INFO] [stdout] | [INFO] [stdout] 52 | _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] 52 + _ => (heaters[i] - h).min(h - heaters[i - 1]), [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0498_diagonal_traverse.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 35 - if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] 35 + if mat.len() == 0 || mat[0].len() == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0501_find_mode_in_binary_search_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0508_most_frequent_subtree_sum.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0513_find_bottom_left_tree_value.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0514_freedom_trail.rs:53:26 [INFO] [stdout] | [INFO] [stdout] 53 | for r_pos in (0..ring.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for r_pos in (0..ring.len()) { [INFO] [stdout] 53 + for r_pos in 0..ring.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0515_find_largest_value_in_each_tree_row.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0530_minimum_absolute_difference_in_bst.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0538_convert_bst_to_greater_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0543_diameter_of_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0563_binary_tree_tilt.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0572_subtree_of_another_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0600_non_negative_integers_without_consecutive_ones.rs:61:54 [INFO] [stdout] | [INFO] [stdout] 61 | FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] 61 + FB[bt - 1] + Self::find_integers(n & !(1 << bt)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0606_construct_string_from_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0617_merge_two_binary_trees.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0623_add_one_row_to_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0637_average_of_levels_in_binary_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0652_find_duplicate_subtrees.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0653_two_sum_iv_input_is_a_bst.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0654_maximum_binary_tree.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0655_print_binary_tree.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0662_maximum_width_of_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0665_non_decreasing_array.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] 41 + if i < 2 || nums[i - 2] <= nums[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0669_trim_a_binary_search_tree.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `match` scrutinee expression [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:61:33 [INFO] [stdout] | [INFO] [stdout] 61 | Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] 61 + Some(root) => match (root.borrow().left.clone(), root.borrow().right.clone()) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:69:24 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_val == root.borrow().val) { [INFO] [stdout] 69 + if left_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:73:24 [INFO] [stdout] | [INFO] [stdout] 73 | if (right_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (right_val == root.borrow().val) { [INFO] [stdout] 73 + if right_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0687_longest_univalue_path.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0700_search_in_a_binary_search_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:70:20 [INFO] [stdout] | [INFO] [stdout] 70 | if (val < node.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 70 - if (val < node.borrow().val) { [INFO] [stdout] 70 + if val < node.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | if (val <= curr_kth) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - if (val <= curr_kth) { [INFO] [stdout] 71 + if val <= curr_kth { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0725_split_linked_list_in_parts.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0740_delete_and_earn.rs:48:50 [INFO] [stdout] | [INFO] [stdout] 48 | (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 48 - (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] 48 + (2..10001).for_each(|i| dp[i] = i32::max(sum[i] + dp[i - 2], dp[i - 1])); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:51:40 [INFO] [stdout] | [INFO] [stdout] 51 | tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] 51 + tx -= std::cmp::max(1, (tx - sx) / ty) * ty; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:53:40 [INFO] [stdout] | [INFO] [stdout] 53 | ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] 53 + ty -= std::cmp::max(1, (ty - sy) / tx) * tx; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0783_minimum_distance_between_bst_nodes.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0814_binary_tree_pruning.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0817_linked_list_components.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0830_positions_of_large_groups.rs:49:18 [INFO] [stdout] | [INFO] [stdout] 49 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 49 - for i in (1..n) { [INFO] [stdout] 49 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0863_all_nodes_distance_k_in_binary_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0864_shortest_path_to_get_all_keys.rs:113:33 [INFO] [stdout] | [INFO] [stdout] 113 | keys |= (1 << (c - b'a')); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 113 - keys |= (1 << (c - b'a')); [INFO] [stdout] 113 + keys |= 1 << (c - b'a'); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0865_smallest_subtree_with_all_the_deepest_nodes.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0872_leaf_similar_trees.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0876_middle_of_the_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0878_nth_magical_number.rs:41:22 [INFO] [stdout] | [INFO] [stdout] 41 | let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] 41 + let mut hi = n * std::cmp::min(a, b); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0894_all_possible_full_binary_trees.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0897_increasing_order_search_tree.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0938_range_sum_of_bst.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0951_flip_equivalent_binary_trees.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0958_check_completeness_of_a_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0965_univalued_binary_tree.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0968_binary_tree_cameras.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0971_flip_binary_tree_to_match_preorder_traversal.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | if (arr[i] < arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 57 - if (arr[i] < arr[i - 1]) { [INFO] [stdout] 57 + if arr[i] < arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:60:23 [INFO] [stdout] | [INFO] [stdout] 60 | } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 60 - } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] 60 + } else if arr[i] > arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0979_distribute_coins_in_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0987_vertical_order_traversal_of_a_binary_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0988_smallest_string_starting_from_leaf.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0993_cousins_in_binary_tree.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0995_minimum_number_of_k_consecutive_bit_flips.rs:51:16 [INFO] [stdout] | [INFO] [stdout] 51 | if (i >= k) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - if (i >= k) { [INFO] [stdout] 51 + if i >= k { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0998_maximum_binary_tree_ii.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1008_construct_binary_search_tree_from_preorder_traversal.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1019_next_greater_node_in_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1022_sum_of_root_to_leaf_binary_numbers.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1026_maximum_difference_between_node_and_ancestor.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1028_recover_a_tree_from_preorder_traversal.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1038_binary_search_tree_to_greater_sum_tree.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1080_insufficient_nodes_in_root_to_leaf_paths.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1105_filling_bookcase_shelves.rs:51:22 [INFO] [stdout] | [INFO] [stdout] 51 | for j in (i..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - for j in (i..n) { [INFO] [stdout] 51 + for j in i..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1110_delete_nodes_and_return_forest.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1123_lowest_common_ancestor_of_deepest_leaves.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1145_binary_tree_coloring_game.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1147_longest_chunked_palindrome_decomposition.rs:54:16 [INFO] [stdout] | [INFO] [stdout] 54 | if (i <= prev_token_end) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 54 - if (i <= prev_token_end) { [INFO] [stdout] 54 + if i <= prev_token_end { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1161_maximum_level_sum_of_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1171_remove_zero_sum_consecutive_nodes_from_linked_list.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:72:20 [INFO] [stdout] | [INFO] [stdout] 72 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:62:28 [INFO] [stdout] | [INFO] [stdout] 62 | let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 62 - let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] 62 + let s_single = cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | (cnt_max > 1 [INFO] [stdout] | ^ [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 | && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 ~ cnt_max > 1 [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 ~ && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:55:16 [INFO] [stdout] | [INFO] [stdout] 55 | if (i % 2 != 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 55 - if (i % 2 != 0) { [INFO] [stdout] 55 + if i % 2 != 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:58:16 [INFO] [stdout] | [INFO] [stdout] 58 | if (map.contains_key(&(count - k))) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - if (map.contains_key(&(count - k))) { [INFO] [stdout] 58 + if map.contains_key(&(count - k)) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:61:16 [INFO] [stdout] | [INFO] [stdout] 61 | if (map.contains_key(&count)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - if (map.contains_key(&count)) { [INFO] [stdout] 61 + if map.contains_key(&count) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:65:25 [INFO] [stdout] | [INFO] [stdout] 65 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1278_palindrome_partitioning_iii.rs:71:19 [INFO] [stdout] | [INFO] [stdout] 71 | for ll in ((k - 1) as usize..l) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - for ll in ((k - 1) as usize..l) { [INFO] [stdout] 71 + for ll in (k - 1) as usize..l { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1290_convert_binary_number_in_a_linked_list_to_integer.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1302_deepest_leaves_sum.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1305_all_elements_in_two_binary_search_trees.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1315_sum_of_nodes_with_even_valued_grandparent.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1325_delete_leaves_with_a_given_value.rs:36:25 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1339_maximum_product_of_splitted_binary_tree.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 43 - if (left_child[i] != -1) { [INFO] [stdout] 43 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:46:16 [INFO] [stdout] | [INFO] [stdout] 46 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 46 - if (right_child[i] != -1) { [INFO] [stdout] 46 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | if (root < 0 || root >= n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (root < 0 || root >= n) { [INFO] [stdout] 53 + if root < 0 || root >= n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:63:16 [INFO] [stdout] | [INFO] [stdout] 63 | if (v.contains(&i)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - if (v.contains(&i)) { [INFO] [stdout] 63 + if v.contains(&i) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_child[i] != -1) { [INFO] [stdout] 69 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:72:16 [INFO] [stdout] | [INFO] [stdout] 72 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - if (right_child[i] != -1) { [INFO] [stdout] 72 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1367_linked_list_in_binary_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1367_linked_list_in_binary_tree.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1372_longest_zigzag_path_in_a_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1373_maximum_sum_bst_in_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1382_balance_a_binary_search_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let k = (k as usize); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - let k = (k as usize); [INFO] [stdout] 58 + let k = k as usize; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s1424_diagonal_traverse_ii.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..len) { [INFO] [stdout] 53 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:58:18 [INFO] [stdout] | [INFO] [stdout] 58 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - for i in (0..len) { [INFO] [stdout] 58 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1448_count_good_nodes_in_binary_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1457_pseudo_palindromic_paths_in_a_binary_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array.rs:50:62 [INFO] [stdout] | [INFO] [stdout] 50 | .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] 50 + .fold(target[0], |acc, z| acc + std::cmp::max(0, z.1 - z.0)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1530_number_of_good_leaf_nodes_pairs.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s1561_maximum_number_of_coins_you_can_get.rs:53:27 [INFO] [stdout] | [INFO] [stdout] 53 | piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] 53 + piles.iter().skip(piles.len() / 3).step_by(2).sum() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1609_even_odd_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:65:9 [INFO] [stdout] | [INFO] [stdout] 46 | / loop { [INFO] [stdout] 47 | | match heap.len() { [INFO] [stdout] 48 | | 0 => { [INFO] [stdout] 49 | | return 0; [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 65 | 1 [INFO] [stdout] | ^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `subp` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:160:24 [INFO] [stdout] | [INFO] [stdout] 160 | ([x, b'*', subp @ ..], [y, subs @ ..]) if *x == b'.' || x == y => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_subp` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let mut vec = Vec::new(); [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/solution/s0039_combination_sum.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | mut curr: Vec, [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/solution/s0040_combination_sum_ii.rs:48:13 [INFO] [stdout] | [INFO] [stdout] 48 | let mut vec = Vec::new(); [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/solution/s0040_combination_sum_ii.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:33:13 [INFO] [stdout] | [INFO] [stdout] 33 | for i in 0..n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:38:25 [INFO] [stdout] | [INFO] [stdout] 38 | let (mut l, mut mid, mut h) = (0, 0, nums.len() - 1); [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | for i in 0..deque.len() { [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/solution/s0164_maximum_gap.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | for i in 0..8 { [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/solution/s0179_largest_number.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut result = vs.join(""); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:65:22 [INFO] [stdout] | [INFO] [stdout] 65 | Some(n) => (), [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut temp = std::cmp::max(pre + nums[i], cur); [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/solution/s0219_contains_duplicate_ii.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | let mut prev = m.entry(x).or_insert(i); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0278_first_bad_version.rs:41:37 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn first_bad_version(&self, n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:57:27 [INFO] [stdout] | [INFO] [stdout] 57 | .scan(0, |mut state, x| { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | fn new(mut nested_list: Vec) -> Self { [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/solution/s0341_flatten_nested_list_iterator.rs:76:15 [INFO] [stdout] | [INFO] [stdout] 76 | fn unnest(mut nested_list: Vec) -> Vec { [INFO] [stdout] | ----^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:39:24 [INFO] [stdout] | [INFO] [stdout] 39 | .filter(|&(x, y)| y >= 2) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:40:23 [INFO] [stdout] | [INFO] [stdout] 40 | .map(|(x, y)| (x + 1) as i32) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_y` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0502_ipo.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0509_fibonacci_number.rs:51:21 [INFO] [stdout] | [INFO] [stdout] 51 | for i in 2..=n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0646_maximum_length_of_pair_chain.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = pairs.len() - 1; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0658_find_k_closest_elements.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let mut result = &mut arr[0..(k as usize)]; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:100:13 [INFO] [stdout] | [INFO] [stdout] 100 | let mut v = unsafe { search_word.as_bytes_mut() }; [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/solution/s0684_redundant_connection.rs:39:13 [INFO] [stdout] | [INFO] [stdout] 39 | let mut tmp = vec![]; [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/solution/s0687_longest_univalue_path.rs:62:17 [INFO] [stdout] | [INFO] [stdout] 62 | let mut left_max = Self::dfs_helper(&root.borrow().left, cur); [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/solution/s0687_longest_univalue_path.rs:63:17 [INFO] [stdout] | [INFO] [stdout] 63 | let mut right_max = Self::dfs_helper(&root.borrow().right, cur); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tail` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:72:27 [INFO] [stdout] | [INFO] [stdout] 72 | if let Some((&tail, &height)) = map.range(..end).last() { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_tail` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:78:36 [INFO] [stdout] | [INFO] [stdout] 78 | while let Some((&key, &height)) = iter.next() { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `count` is never read [INFO] [stdout] --> src/solution/s0764_largest_plus_sign.rs:44:17 [INFO] [stdout] | [INFO] [stdout] 44 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0770_basic_calculator_iv.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 163 | let mut op = if subtract { -1 } else { 1 }; [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0770_basic_calculator_iv.rs:234:13 [INFO] [stdout] | [INFO] [stdout] 234 | let mut it = &mut iter; [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/solution/s0771_jewels_and_stones.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut set = jewels.chars().collect::>(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0779_k_th_symbol_in_grammar.rs:47:24 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn kth_grammar(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `max` is never read [INFO] [stdout] --> src/solution/s0798_smallest_rotation_with_highest_score.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | let mut max = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `row_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut row_sum = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `col_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:83:17 [INFO] [stdout] | [INFO] [stdout] 83 | let mut col_sum = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num` is never read [INFO] [stdout] --> src/solution/s0842_split_array_into_fibonacci_sequence.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut num = 0i64; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word` [INFO] [stdout] --> src/solution/s0843_guess_the_word.rs:56:24 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn guess(self, word: String) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_word` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0846_hand_of_straights.rs:48:37 [INFO] [stdout] | [INFO] [stdout] 48 | if let Some(mut x) = map.get_mut(&(it + i)).or(Some(&mut 0)) { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0850_rectangle_area_ii.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut xi = xs.binary_search(&rec[0]).unwrap(); [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/solution/s0850_rectangle_area_ii.rs:59:21 [INFO] [stdout] | [INFO] [stdout] 59 | let mut yi = ys.binary_search(&rec[1]).unwrap(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `current_iter` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | for current_iter in 0..queue_size { [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_iter` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `front_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:55:25 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_front_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_s2_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:46:17 [INFO] [stdout] | [INFO] [stdout] 46 | let mut queue_size = queue.len(); [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/solution/s0854_k_similar_strings.rs:55:21 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [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/solution/s0854_k_similar_strings.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [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/solution/s0854_k_similar_strings.rs:87:17 [INFO] [stdout] | [INFO] [stdout] 87 | let mut slice = s.as_bytes_mut(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `target_val` is never read [INFO] [stdout] --> src/solution/s0855_exam_room.rs:106:21 [INFO] [stdout] | [INFO] [stdout] 106 | target_val = self.n - 1; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0864_shortest_path_to_get_all_keys.rs:82:13 [INFO] [stdout] | [INFO] [stdout] 82 | let mut all_keys = (1 << max) - 1; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `len` [INFO] [stdout] --> src/solution/s0866_prime_palindrome.rs:51:25 [INFO] [stdout] | [INFO] [stdout] 51 | let len = s.len(); [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_len` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0867_transpose_matrix.rs:43:29 [INFO] [stdout] | [INFO] [stdout] 43 | let mut vec: Vec = vec![*v2]; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s0874_walking_robot_simulation.rs:91:21 [INFO] [stdout] | [INFO] [stdout] 91 | for k in 0..cmd { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `piles` [INFO] [stdout] --> src/solution/s0877_stone_game.rs:42:23 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn stone_game(piles: Vec) -> bool { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_piles` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:59:25 [INFO] [stdout] | [INFO] [stdout] 59 | for i in 1..=len { [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/solution/s0885_spiral_matrix_iii.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | for i in 1..=len { [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/solution/s0885_spiral_matrix_iii.rs:73:25 [INFO] [stdout] | [INFO] [stdout] 73 | for i in 1..=len { [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/solution/s0885_spiral_matrix_iii.rs:80:25 [INFO] [stdout] | [INFO] [stdout] 80 | for i in 1..=len { [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/solution/s0897_increasing_order_search_tree.rs:55:13 [INFO] [stdout] | [INFO] [stdout] 55 | let mut dm = Rc::new(RefCell::new(TreeNode::new(0))); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0928_minimize_malware_spread_ii.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | let mut result: Vec<(i32, std::collections::HashSet)> = initial [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0959_regions_cut_by_slashes.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = grid.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `r` is never read [INFO] [stdout] --> src/solution/s0964_least_operators_to_express_number.rs:68:25 [INFO] [stdout] | [INFO] [stdout] 68 | let mut r = i32::MAX; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s1002_find_common_characters.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | .filter(|(i, c)| **c > 0) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut v1 = heap.pop().unwrap(); [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/solution/s1046_last_stone_weight.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let mut v2 = heap.pop().unwrap(); [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/solution/s1053_previous_permutation_with_one_swap.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let mut arr = arr; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s1093_statistics_from_a_large_sample.rs:69:17 [INFO] [stdout] | [INFO] [stdout] 69 | let mut mid = 0.0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `r` is never read [INFO] [stdout] --> src/solution/s1096_brace_expansion_ii.rs:89:21 [INFO] [stdout] | [INFO] [stdout] 89 | let mut r = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1096_brace_expansion_ii.rs:79:17 [INFO] [stdout] | [INFO] [stdout] 79 | let mut str = stack.pop().unwrap(); [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/solution/s1110_delete_nodes_and_return_forest.rs:61:13 [INFO] [stdout] | [INFO] [stdout] 61 | let mut root = root; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `this_sum` [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:29 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_this_sum` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `count` is assigned to, but never used [INFO] [stdout] --> src/solution/s1162_as_far_from_land_as_possible.rs:40:17 [INFO] [stdout] | [INFO] [stdout] 40 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_count` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1178_number_of_valid_words_for_each_puzzle.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut words = words [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/solution/s1178_number_of_valid_words_for_each_puzzle.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let mut puzzles = puzzles [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1202_smallest_string_with_swaps.rs:96:14 [INFO] [stdout] | [INFO] [stdout] 96 | for (k, v) in map.iter() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1340_jump_game_v.rs:54:25 [INFO] [stdout] | [INFO] [stdout] 54 | .map(|(idx, num)| Self::dfs(&arr, &mut memo, d as usize, idx)) [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `i` is assigned to, but never used [INFO] [stdout] --> src/solution/s1371_find_the_longest_substring_containing_vowels_in_even_counts.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut i = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_i` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:47:28 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn max_performance(n: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1464_maximum_product_of_two_elements_in_an_array.rs:54:23 [INFO] [stdout] | [INFO] [stdout] 54 | .fold(1, |mut res, x| res * (x - 1)) [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `str2` is never read [INFO] [stdout] --> src/solution/s1487_making_file_names_unique.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut str2 = String::new(); [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable pattern [INFO] [stdout] --> src/solution/s1514_path_with_maximum_probability.rs:94:17 [INFO] [stdout] | [INFO] [stdout] 82 | Pair(prob, curr) => { [INFO] [stdout] | ---------------- matches any value [INFO] [stdout] ... [INFO] [stdout] 94 | _ => (), [INFO] [stdout] | ^ unreachable pattern [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1582_special_positions_in_a_binary_matrix.rs:44:27 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, v)| { [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/solution/s1582_special_positions_in_a_binary_matrix.rs:44:36 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, v)| { [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/solution/s1593_split_a_string_into_the_max_number_of_unique_substrings.rs:62:21 [INFO] [stdout] | [INFO] [stdout] 62 | let mut substr = [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `l` [INFO] [stdout] --> src/solution/s1606_find_servers_that_handled_most_number_of_requests.rs:72:31 [INFO] [stdout] | [INFO] [stdout] 72 | while let Some((&t2, &l)) = iterator.peek() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_l` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1614_maximum_nesting_depth_of_the_parentheses.rs:43:23 [INFO] [stdout] | [INFO] [stdout] 43 | .scan(0, |mut state, c| { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated constant `BLUE` is never used [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:43:11 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated constant in this implementation [INFO] [stdout] ... [INFO] [stdout] 43 | const BLUE: i32 = 2; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LRUCache` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, and `put` are never used [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl LRUCache { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 61 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MinStack` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | 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/solution/s0155_min_stack.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl MinStack { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 56 | /** initialize your data structure here. */ [INFO] [stdout] 57 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn get_min(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `go_left`, `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 83 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 84 | fn go_left(stack: &mut Vec>>, mut node: Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | 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/solution/s0208_implement_trie_prefix_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 55 | /** Initialize your data structure here. */ [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordDictionary` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_word`, `search`, and `search_trie` are never used [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl WordDictionary { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 61 | /** Initialize your data structure here. */ [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn add_word(&mut self, word: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn search_trie(trie: &Trie, word: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyStack` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | 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/solution/s0225_implement_stack_using_queues.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 60 | /** Initialize your data structure here. */ [INFO] [stdout] 61 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | 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/solution/s0232_implement_queue_using_stacks.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 59 | /** Initialize your data structure here. */ [INFO] [stdout] 60 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn peek(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MedianFinder` is never constructed [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | 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/solution/s0295_find_median_from_data_stream.rs:64:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl MedianFinder { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 63 | /** initialize your data structure here. */ [INFO] [stdout] 64 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn add_num(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn find_median(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 63 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, `preorder_dfs`, `deserialize`, and `build_tree` are never used [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 69 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 70 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn preorder_dfs(node: Option>>, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn build_tree(src: &[Option], cur: &mut usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct NumArray(Vec); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_range` are never used [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | 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/solution/s0304_range_sum_query_2d_immutable.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumMatrix` is never constructed [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct NumMatrix(Vec>); [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_region` are never used [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl NumMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 53 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct NumArray(Vec); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn update(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | 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/solution/s0341_flatten_nested_list_iterator.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Int` and `List` are never constructed [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:49:5 [INFO] [stdout] | [INFO] [stdout] 48 | pub enum NestedInteger { [INFO] [stdout] | ------------- variants in this enum [INFO] [stdout] 49 | Int(i32), [INFO] [stdout] | ^^^ [INFO] [stdout] 50 | List(Vec), [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `NestedInteger` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NestedIterator` is never constructed [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct NestedIterator { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, `has_next`, and `unnest` are never used [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 61 | impl NestedIterator { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 62 | fn new(mut nested_list: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn has_next(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn unnest(mut nested_list: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SummaryRanges` is never constructed [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct SummaryRanges { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `remove`, `insert`, `add_num`, and `get_intervals` are never used [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl SummaryRanges { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 59 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn remove(&mut self, l: i32, r: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn insert(&mut self, l: i32, r: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn add_num(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn get_intervals(&self) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `tweets` is never read [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:52:5 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Twitter { [INFO] [stdout] | ------- field in this struct [INFO] [stdout] 52 | tweets: Vec<(Tweet, User)>, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Twitter` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `post_tweet`, and `get_news_feed` are never used [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl Twitter { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 61 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn post_tweet(&mut self, user_id: User, tweet_id: Tweet) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn get_news_feed(&self, user_id: User) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static `PICK` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | static mut PICK: i32 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `guess` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:41:11 [INFO] [stdout] | [INFO] [stdout] 41 | unsafe fn guess(num: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `guess_number` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:61:15 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | unsafe fn guess_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0380_insert_delete_getrandom_o1.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RandomizedSet` is never constructed [INFO] [stdout] --> src/solution/s0380_insert_delete_getrandom_o1.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | 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/solution/s0380_insert_delete_getrandom_o1.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl RandomizedSet { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 59 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn get_random(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RandomizedCollection` is never constructed [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct RandomizedCollection { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl RandomizedCollection { [INFO] [stdout] | ------------------------- associated items in this implementation [INFO] [stdout] 58 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_random(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 67 | pub struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_random` are never used [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 77 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 78 | fn new(head: Option>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn get_random(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0384_shuffle_an_array.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `reset`, and `shuffle` are never used [INFO] [stdout] --> src/solution/s0384_shuffle_an_array.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn reset(&mut self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn shuffle(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0398_random_pick_index.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick` are never used [INFO] [stdout] --> src/solution/s0398_random_pick_index.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 50 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn pick(&mut self, target: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AllOne` is never constructed [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct AllOne { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `inc`, `dec`, `get_max_key`, and `get_min_key` are never used [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl AllOne { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn inc(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn dec(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn get_max_key(&self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn get_min_key(&self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `to_rc` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:54:4 [INFO] [stdout] | [INFO] [stdout] 54 | fn to_rc(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `val_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:63:4 [INFO] [stdout] | [INFO] [stdout] 63 | fn val_of(root: &Option>>) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `left_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:75:4 [INFO] [stdout] | [INFO] [stdout] 75 | fn left_of(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:90:4 [INFO] [stdout] | [INFO] [stdout] 90 | fn right_of(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `append_to_left` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:105:4 [INFO] [stdout] | [INFO] [stdout] 105 | fn append_to_left(root: &Option>>, val: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `append_to_right` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:120:4 [INFO] [stdout] | [INFO] [stdout] 120 | fn append_to_right( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:136:8 [INFO] [stdout] | [INFO] [stdout] 136 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, and `deserialize` are never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:143:8 [INFO] [stdout] | [INFO] [stdout] 142 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 143 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 186 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pluck` are never used [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:73:8 [INFO] [stdout] | [INFO] [stdout] 72 | impl ListNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 73 | fn new(key: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn pluck(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FrequencyBin` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:95:8 [INFO] [stdout] | [INFO] [stdout] 95 | struct FrequencyBin { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `remove_key`, `push_back`, and `pop_front` are never used [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:104:8 [INFO] [stdout] | [INFO] [stdout] 103 | impl FrequencyBin { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 104 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn remove_key(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 130 | fn push_back(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 144 | fn pop_front(&mut self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CacheItem` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:150:8 [INFO] [stdout] | [INFO] [stdout] 150 | struct CacheItem { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LFUCache` is never constructed [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:155:8 [INFO] [stdout] | [INFO] [stdout] 155 | struct LFUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `evict`, `get`, and `put` are never used [INFO] [stdout] --> src/solution/s0460_lfu_cache.rs:168:8 [INFO] [stdout] | [INFO] [stdout] 167 | impl LFUCache { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 168 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 178 | fn evict(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 185 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 203 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0478_generate_random_point_in_a_circle.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `rand_point` are never used [INFO] [stdout] --> src/solution/s0478_generate_random_point_in_a_circle.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 51 | fn new(radius: f64, x_center: f64, y_center: f64) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn rand_point(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0488_zuma_game.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_min_step`, `dfs`, `find_next_state`, and `dropable` are never used [INFO] [stdout] --> src/solution/s0488_zuma_game.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 61 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 62 | fn find_min_step(board: String, hand: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn dfs(start: usize, state: u32, board: Vec, res: &mut i32, hand: &[char], n: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn find_next_state(c: char, state: u32, hand: &[char], n: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn dropable(board: &[char]) -> Option> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0497_random_point_in_non_overlapping_rectangles.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick` are never used [INFO] [stdout] --> src/solution/s0497_random_point_in_non_overlapping_rectangles.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 57 | fn new(rects: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn pick(&self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0519_random_flip_matrix.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `flip`, and `reset` are never used [INFO] [stdout] --> src/solution/s0519_random_flip_matrix.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(m: i32, n: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn flip(&mut self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn reset(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0528_random_pick_with_weight.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick_index` are never used [INFO] [stdout] --> src/solution/s0528_random_pick_with_weight.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 69 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 70 | fn new(w: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn pick_index(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0535_encode_and_decode_tinyurl.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0535_encode_and_decode_tinyurl.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Codec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `encode`, and `decode` are never used [INFO] [stdout] --> src/solution/s0535_encode_and_decode_tinyurl.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 47 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 48 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn encode(&mut self, long_url: String) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn decode(&self, short_url: String) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Tok` is never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:43:6 [INFO] [stdout] | [INFO] [stdout] 43 | enum Tok { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Fraction` is never constructed [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Fraction { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `reduce` are never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl Fraction { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 55 | fn new(sign: i32, numerator: i32, denominator: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn add(self, other: Self) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn reduce(self) -> Self { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gcd` is never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:102:4 [INFO] [stdout] | [INFO] [stdout] 102 | fn gcd(mut m: i32, mut n: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `fraction_addition` is never used [INFO] [stdout] --> src/solution/s0592_fraction_addition_and_subtraction.rs:112:8 [INFO] [stdout] | [INFO] [stdout] 111 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 112 | fn fraction_addition(expression: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0622_design_circular_queue.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCircularQueue` is never constructed [INFO] [stdout] --> src/solution/s0622_design_circular_queue.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct MyCircularQueue { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/solution/s0622_design_circular_queue.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl MyCircularQueue { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 63 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn en_queue(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn de_queue(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 88 | fn front(&self) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn rear(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0641_design_circular_deque.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCircularDeque` is never constructed [INFO] [stdout] --> src/solution/s0641_design_circular_deque.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct MyCircularDeque { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/solution/s0641_design_circular_deque.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl MyCircularDeque { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 65 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn insert_front(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn insert_last(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn delete_front(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn delete_last(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_front(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 125 | fn get_rear(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 133 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 137 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0675_cut_off_trees_for_golf_event.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `cut_off_tree` and `bfs_helper` are never used [INFO] [stdout] --> src/solution/s0675_cut_off_trees_for_golf_event.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 51 | // Credit: https://rustgym.com/leetcode/675 [INFO] [stdout] 52 | fn cut_off_tree(forest: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn bfs_helper( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MagicDictionary` is never constructed [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | struct MagicDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `build_dict`, and `search` are never used [INFO] [stdout] --> src/solution/s0676_implement_magic_dictionary.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 70 | impl MagicDictionary { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 71 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn build_dict(&mut self, dictionary: Vec) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn search(&self, mut search_word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MapSum` is never constructed [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct MapSum { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `sum` are never used [INFO] [stdout] --> src/solution/s0677_map_sum_pairs.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl MapSum { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 63 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn insert(&mut self, key: String, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn sum(&self, prefix: String) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `KthLargest` is never constructed [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct KthLargest { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `get_kth` are never used [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl KthLargest { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 53 | fn new(k: i32, nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn add(&mut self, val: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn get_kth(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0705_design_hashset.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashSet` is never constructed [INFO] [stdout] --> src/solution/s0705_design_hashset.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct MyHashSet { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, `remove`, and `contains` are never used [INFO] [stdout] --> src/solution/s0705_design_hashset.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 51 | impl MyHashSet { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 52 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | fn add(&mut self, key: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn contains(&self, key: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `TABLE_SIZE` is never used [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:45:7 [INFO] [stdout] | [INFO] [stdout] 45 | const TABLE_SIZE: usize = 32; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashMap` is never constructed [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct MyHashMap { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `put`, `get`, and `remove` are never used [INFO] [stdout] --> src/solution/s0706_design_hashmap.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl MyHashMap { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 57 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyLinkedList` is never constructed [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | struct MyLinkedList { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, `add_at_head`, `add_at_tail`, `add_at_index`, and `delete_at_index` are never used [INFO] [stdout] --> src/solution/s0707_design_linked_list.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl MyLinkedList { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 65 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn get(&self, index: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn add_at_head(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | fn add_at_tail(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn add_at_index(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0710_random_pick_with_blacklist.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick` are never used [INFO] [stdout] --> src/solution/s0710_random_pick_with_blacklist.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 58 | fn new(n: i32, blacklist: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn pick(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0715_range_module.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RangeModule` is never constructed [INFO] [stdout] --> src/solution/s0715_range_module.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct RangeModule { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_range`, `query_range`, and `remove_range` are never used [INFO] [stdout] --> src/solution/s0715_range_module.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl RangeModule { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 54 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn add_range(&mut self, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn query_range(&self, left: i32, right: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn remove_range(&mut self, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0729_my_calendar_i.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendar` is never constructed [INFO] [stdout] --> src/solution/s0729_my_calendar_i.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct MyCalendar { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/solution/s0729_my_calendar_i.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 48 | impl MyCalendar { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 49 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0731_my_calendar_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendarTwo` is never constructed [INFO] [stdout] --> src/solution/s0731_my_calendar_ii.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct MyCalendarTwo { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/solution/s0731_my_calendar_ii.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl MyCalendarTwo { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 53 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0732_my_calendar_iii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendarThree` is never constructed [INFO] [stdout] --> src/solution/s0732_my_calendar_iii.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct MyCalendarThree { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/solution/s0732_my_calendar_iii.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 51 | impl MyCalendarThree { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 52 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn book(&mut self, start: i32, end: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordFilter` is never constructed [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct WordFilter { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `f` are never used [INFO] [stdout] --> src/solution/s0745_prefix_and_suffix_search.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl WordFilter { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 56 | fn new(words: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn f(&self, pref: String, suff: String) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0855_exam_room.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ExamRoom` is never constructed [INFO] [stdout] --> src/solution/s0855_exam_room.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct ExamRoom { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `seat`, and `leave` are never used [INFO] [stdout] --> src/solution/s0855_exam_room.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl ExamRoom { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 55 | fn new(n: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn seat(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 115 | fn leave(&mut self, p: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `wage` is never read [INFO] [stdout] --> src/solution/s0857_minimum_cost_to_hire_k_workers.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 44 | struct Worker { [INFO] [stdout] | ------ field in this struct [INFO] [stdout] ... [INFO] [stdout] 47 | wage: i32, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Worker` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0895_maximum_frequency_stack.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FreqStack` is never constructed [INFO] [stdout] --> src/solution/s0895_maximum_frequency_stack.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct FreqStack { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, and `pop` are never used [INFO] [stdout] --> src/solution/s0895_maximum_frequency_stack.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 61 | impl FreqStack { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0900_rle_iterator.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RLEIterator` is never constructed [INFO] [stdout] --> src/solution/s0900_rle_iterator.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct RLEIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `next` are never used [INFO] [stdout] --> src/solution/s0900_rle_iterator.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl RLEIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 57 | fn new(encoding: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn next(&mut self, n: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0901_online_stock_span.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `StockSpanner` is never constructed [INFO] [stdout] --> src/solution/s0901_online_stock_span.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct StockSpanner { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `next` are never used [INFO] [stdout] --> src/solution/s0901_online_stock_span.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl StockSpanner { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 58 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn next(&mut self, price: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0911_online_election.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TopVotedCandidate` is never constructed [INFO] [stdout] --> src/solution/s0911_online_election.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct TopVotedCandidate { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `q` are never used [INFO] [stdout] --> src/solution/s0911_online_election.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 56 | impl TopVotedCandidate { [INFO] [stdout] | ---------------------- associated items in this implementation [INFO] [stdout] 57 | fn new(persons: Vec, times: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn q(&self, t: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CBTInserter` is never constructed [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | struct CBTInserter { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `get_root` are never used [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 76 | impl CBTInserter { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 77 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn insert(&mut self, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_root(&self) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0933_number_of_recent_calls.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RecentCounter` is never constructed [INFO] [stdout] --> src/solution/s0933_number_of_recent_calls.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | struct RecentCounter { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `ping` are never used [INFO] [stdout] --> src/solution/s0933_number_of_recent_calls.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 49 | impl RecentCounter { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 50 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn ping(&mut self, t: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0981_time_based_key_value_store.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TimeMap` is never constructed [INFO] [stdout] --> src/solution/s0981_time_based_key_value_store.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct TimeMap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `set`, and `get` are never used [INFO] [stdout] --> src/solution/s0981_time_based_key_value_store.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl TimeMap { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 55 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn set(&mut self, key: String, value: String, timestamp: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn get(&self, key: String, timestamp: i32) -> String { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `n` is never read [INFO] [stdout] --> src/solution/s1001_grid_illumination.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 49 | struct LampGrid { [INFO] [stdout] | -------- field in this struct [INFO] [stdout] ... [INFO] [stdout] 55 | n: usize, [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `StreamChecker` is never constructed [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct StreamChecker { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition_point` is never used [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:58:4 [INFO] [stdout] | [INFO] [stdout] 58 | fn partition_point(words: &[Vec], mut f: F) -> usize [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `prefix_exists` is never used [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:75:4 [INFO] [stdout] | [INFO] [stdout] 75 | fn prefix_exists(words: &[Vec], char_i: usize, query: &[char]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `query` are never used [INFO] [stdout] --> src/solution/s1032_stream_of_characters.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 95 | impl StreamChecker { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 96 | fn new(words: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | fn query(&mut self, letter: char) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1146_snapshot_array.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SnapshotArray` is never constructed [INFO] [stdout] --> src/solution/s1146_snapshot_array.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct SnapshotArray { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `set`, `snap`, and `get` are never used [INFO] [stdout] --> src/solution/s1146_snapshot_array.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 49 | impl SnapshotArray { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 50 | fn new(length: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn set(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn snap(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn get(&self, index: i32, snap_id: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1157_online_majority_element_in_subarray.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MajorityChecker` is never constructed [INFO] [stdout] --> src/solution/s1157_online_majority_element_in_subarray.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct MajorityChecker { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/solution/s1157_online_majority_element_in_subarray.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl MajorityChecker { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 56 | fn new(arr: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn query(&mut self, left: i32, right: i32, threshold: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn find_max( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 120 | fn build_tree(arr: &[i32], tree: &mut Vec>, root: i32, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn merge(root: &mut Vec, left: Vec, right: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn lower_bound(v: &[i32], e: &i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 164 | fn upper_bound(v: &[i32], e: &i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DinnerPlates` is never constructed [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | struct DinnerPlates { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `pop_at_stack`, and `pop_at_idx` are never used [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:87:8 [INFO] [stdout] | [INFO] [stdout] 86 | impl DinnerPlates { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 87 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 120 | fn pop_at_stack(&mut self, index: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | fn pop_at_idx(&mut self, index: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:54:6 [INFO] [stdout] | [INFO] [stdout] 54 | type Link = std::rc::Rc>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `new_link` is never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:56:4 [INFO] [stdout] | [INFO] [stdout] 56 | fn new_link(value: i32) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 67 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 68 | pub fn new(value: i32) -> Node { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Skiplist` is never constructed [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | struct Skiplist { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, `search`, `add`, and `erase` are never used [INFO] [stdout] --> src/solution/s1206_design_skiplist.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 85 | impl Skiplist { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 86 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn find(&self, target: i32) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn search(&self, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | fn add(&mut self, num: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 151 | fn erase(&self, num: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FindElements` is never constructed [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:95:8 [INFO] [stdout] | [INFO] [stdout] 95 | struct FindElements { [INFO] [stdout] | ^^^^^^^^^^^^ [WARN] too many lines in the log, truncating it