[INFO] cloning repository https://github.com/123dou/learnRust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/123dou/learnRust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F123dou%2FlearnRust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F123dou%2FlearnRust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] f9b44b36f613944d8f197a85cadff7b5da58f239 [INFO] building 123dou/learnRust against master#222c5724ecc922fe67815f428c19f82c129d9386 for pr-97334 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F123dou%2FlearnRust" "/workspace/builds/worker-21/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-21/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/123dou/learnRust on toolchain 222c5724ecc922fe67815f428c19f82c129d9386 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+222c5724ecc922fe67815f428c19f82c129d9386" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/123dou/learnRust [INFO] finished tweaking git repo https://github.com/123dou/learnRust [INFO] tweaked toml for git repo https://github.com/123dou/learnRust written to /workspace/builds/worker-21/source/Cargo.toml [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+222c5724ecc922fe67815f428c19f82c129d9386" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+222c5724ecc922fe67815f428c19f82c129d9386" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] warning: profile `doc` is deprecated and has no effect [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded toml v0.5.9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-21/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-21/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:ac0d0aa6ec8ed129e241004a6179c99fa0d2616f50ba759c5b60bd26d0fafa02" "/opt/rustwide/cargo-home/bin/cargo" "+222c5724ecc922fe67815f428c19f82c129d9386" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] ed07d2ac8eea32bccca8198e61c6baac511f819678371c297287e257e23706c9 [INFO] running `Command { std: "docker" "start" "-a" "ed07d2ac8eea32bccca8198e61c6baac511f819678371c297287e257e23706c9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "ed07d2ac8eea32bccca8198e61c6baac511f819678371c297287e257e23706c9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "ed07d2ac8eea32bccca8198e61c6baac511f819678371c297287e257e23706c9", kill_on_drop: false }` [INFO] [stdout] ed07d2ac8eea32bccca8198e61c6baac511f819678371c297287e257e23706c9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-21/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-21/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" "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:ac0d0aa6ec8ed129e241004a6179c99fa0d2616f50ba759c5b60bd26d0fafa02" "/opt/rustwide/cargo-home/bin/cargo" "+222c5724ecc922fe67815f428c19f82c129d9386" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 52b1d798dde7794af395ed951dbf60920b54df8f12b68c17d86c53ff8c59f33b [INFO] running `Command { std: "docker" "start" "-a" "52b1d798dde7794af395ed951dbf60920b54df8f12b68c17d86c53ff8c59f33b", kill_on_drop: false }` [INFO] [stderr] warning: profile `doc` is deprecated and has no effect [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Compiling libc v0.2.126 [INFO] [stderr] Compiling proc-macro2 v1.0.39 [INFO] [stderr] Compiling unicode-ident v1.0.0 [INFO] [stderr] Compiling syn v1.0.96 [INFO] [stderr] Compiling serde_derive v1.0.137 [INFO] [stderr] Compiling getrandom v0.1.16 [INFO] [stderr] Compiling cfg-if v1.0.0 [INFO] [stderr] Compiling serde v1.0.137 [INFO] [stderr] Compiling gcc v0.3.55 [INFO] [stderr] Compiling ppv-lite86 v0.2.16 [INFO] [stderr] Compiling serde_json v1.0.81 [INFO] [stderr] Compiling ryu v1.0.10 [INFO] [stderr] Compiling itoa v1.0.2 [INFO] [stderr] Compiling either v1.6.1 [INFO] [stderr] Compiling rustc-serialize v0.3.24 [INFO] [stderr] Compiling itertools v0.9.0 [INFO] [stderr] Compiling rust-crypto v0.2.36 [INFO] [stderr] Compiling quote v1.0.18 [INFO] [stderr] Compiling rand v0.4.6 [INFO] [stderr] Compiling time v0.1.44 [INFO] [stderr] Compiling rand_core v0.5.1 [INFO] [stderr] Compiling rand_chacha v0.2.2 [INFO] [stderr] Compiling rand v0.3.23 [INFO] [stderr] Compiling rand v0.7.3 [INFO] [stderr] Compiling toml v0.5.9 [INFO] [stderr] Compiling learn_rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `crate::data_struct::link::Link` [INFO] [stdout] --> src/data_struct/link_test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::data_struct::link::Link; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/data_struct/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod link_test; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `toml::de::Error` [INFO] [stdout] --> src/learn_open_source/toml_demo.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use toml::de::Error; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:36:5 [INFO] [stdout] | [INFO] [stdout] 36 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::process::id` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:37:5 [INFO] [stdout] | [INFO] [stdout] 37 | use std::process::id; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::process::id` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:41:5 [INFO] [stdout] | [INFO] [stdout] 41 | use std::process::id; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `thread`, `time` [INFO] [stdout] --> src/sort/sort_test.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{thread, time}; [INFO] [stdout] | ^^^^^^ ^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/sort/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod sort_test; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::sort::sort` [INFO] [stdout] --> src/sort/sort_test.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use crate::sort::sort; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/sort/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod sort_test; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/test_std/test_string.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/mod.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | mod test_string; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Arc`, `Mutex` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::sync::{Arc, Mutex}; [INFO] [stdout] | ^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | mod test_thread; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `channel`, `sync_channel` [INFO] [stdout] --> src/test_std/test_thread/test_channel.rs:1:23 [INFO] [stdout] | [INFO] [stdout] 1 | use std::sync::mpsc::{channel, sync_channel}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_channel; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::thread` [INFO] [stdout] --> src/test_std/test_thread/test_channel.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::thread; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_channel; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `channel` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:7:23 [INFO] [stdout] | [INFO] [stdout] 7 | use std::sync::mpsc::{channel, Sender}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:3:1 [INFO] [stdout] | [INFO] [stdout] 3 | mod proof_of_work_demo; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/test_std/test_trait/test_map.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_trait/mod.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | mod test_map; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::prelude::SliceRandom` [INFO] [stdout] --> src/test_std/test_trait/test_partition.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use rand::prelude::SliceRandom; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_trait/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_partition; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::thread_rng` [INFO] [stdout] --> src/test_std/test_trait/test_partition.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use rand::thread_rng; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_trait/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_partition; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::BinaryHeap` [INFO] [stdout] --> src/test_std/test_binary_heap.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::BinaryHeap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/mod.rs:11:1 [INFO] [stdout] | [INFO] [stdout] 11 | mod test_binary_heap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `itertools::Itertools` [INFO] [stdout] --> src/test_std/test_binary_heap.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use itertools::Itertools; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/mod.rs:11:1 [INFO] [stdout] | [INFO] [stdout] 11 | mod test_binary_heap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `head_2` is never read [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut head_2 = None; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `res` is never read [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:91:17 [INFO] [stdout] | [INFO] [stdout] 91 | let mut res = 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 `min` is never read [INFO] [stdout] --> src/sort/sort.rs:25:13 [INFO] [stdout] | [INFO] [stdout] 25 | let mut min: i32 = i32::min_value(); [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `to` [INFO] [stdout] --> src/test_std/test_trait/test_nll.rs:10:24 [INFO] [stdout] | [INFO] [stdout] 10 | while let Some(to) = graph.get_mut("").unwrap_or(&mut BinaryHeap::new()).pop() { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_to` [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/leetcode/editor/cn/redundant_connection.rs:66:13 [INFO] [stdout] | [INFO] [stdout] 66 | let mut graph = Graph::new(edges.len() + 1, &edges); [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: variant is never constructed: `NotFound` [INFO] [stdout] --> src/learn_open_source/error.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | NotFound, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `IoError` [INFO] [stdout] --> src/learn_open_source/error.rs:12:5 [INFO] [stdout] | [INFO] [stdout] 12 | IoError, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadFilePath` [INFO] [stdout] --> src/learn_open_source/error.rs:14:5 [INFO] [stdout] | [INFO] [stdout] 14 | BadFilePath(PathBuf, &'static str), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadEnv` [INFO] [stdout] --> src/learn_open_source/error.rs:16:5 [INFO] [stdout] | [INFO] [stdout] 16 | BadEnv(String), [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadEntry` [INFO] [stdout] --> src/learn_open_source/error.rs:18:5 [INFO] [stdout] | [INFO] [stdout] 18 | BadEntry(String, PathBuf), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadType` [INFO] [stdout] --> src/learn_open_source/error.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | BadType(String, &'static str, &'static str, Option), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `ParseError` [INFO] [stdout] --> src/learn_open_source/error.rs:22:5 [INFO] [stdout] | [INFO] [stdout] 22 | ParseError(String, PathBuf, String, Option<(usize, usize)>), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `de_from_file` [INFO] [stdout] --> src/learn_open_source/toml_demo.rs:63:4 [INFO] [stdout] | [INFO] [stdout] 63 | fn de_from_file() -> Result { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/learn_open_source/toml_demo.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_finish` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule_ii.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_order` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule_ii.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn find_order(num_courses: i32, prerequisites: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/delete_node_in_a_linked_list.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/linked_list_cycle.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/merge_two_sorted_lists.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/merge_two_sorted_lists.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn is_palindrome(mut head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_size` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:81:8 [INFO] [stdout] | [INFO] [stdout] 81 | fn get_size(mut head: &Option>) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/remove_nth_node_from_end_of_list.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_nth_from_end1` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/remove_nth_node_from_end_of_list.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn remove_nth_from_end1(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_nth_from_end` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/remove_nth_node_from_end_of_list.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn remove_nth_from_end(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/reverse_linked_list.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_list` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/reverse_linked_list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/best_time_to_buy_and_sell_stock_ii.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/best_time_to_buy_and_sell_stock_ii.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/contains_duplicate.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains_duplicate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/contains_duplicate.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/count_and_say.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_and_say` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/count_and_say.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/intersection_of_two_arrays_ii.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `intersect` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/intersection_of_two_arrays_ii.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn intersect(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/move_zeroes.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_zeroes` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/move_zeroes.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/plus_one.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `plus_one` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/plus_one.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/remove_duplicates_from_sorted_array.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/remove_duplicates_from_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/remove_duplicates_from_sorted_array.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn remove_duplicates2(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/reverse_string.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_string` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/reverse_string.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn reverse_string(s: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn rotate(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn rotate2(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn reverse(nums: &mut Vec, low: usize, hi: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_image.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_image.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_pos` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_image.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn next_pos(pos: (usize, usize), n: usize) -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/string_to_integer_atoi.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/string_to_integer_atoi.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn my_atoi2(str: String) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/string_to_integer_atoi.rs:139:12 [INFO] [stdout] | [INFO] [stdout] 139 | pub fn my_atoi(str: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/two_sum.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/two_sum.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/valid_sudoku.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_sudoku` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/valid_sudoku.rs:88:12 [INFO] [stdout] | [INFO] [stdout] 88 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check_dup` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/valid_sudoku.rs:119:12 [INFO] [stdout] | [INFO] [stdout] 119 | pub fn check_dup(vec: &[char]) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MinStack` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_min` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:88:8 [INFO] [stdout] | [INFO] [stdout] 88 | fn get_min(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reset` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn reset(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `shuffle` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | fn shuffle(&self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/best_time_to_buy_and_sell_stock.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/best_time_to_buy_and_sell_stock.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/climbing_stairs.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `climb_stairs` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/climbing_stairs.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/house_robber.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/house_robber.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/maximum_subarray.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sub_array` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/maximum_subarray.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/count_primes.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_primes` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/count_primes.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn count_primes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/fizz_buzz.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fizz_buzz` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/fizz_buzz.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn fizz_buzz(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/power_of_three.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_power_of_three` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/power_of_three.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn is_power_of_three(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/roman_to_integer.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `roman_to_int` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/roman_to_integer.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/hamming_distance.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `hamming_distance` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/hamming_distance.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn hamming_distance(x: i32, y: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_one_of_num` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/hamming_distance.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn count_one_of_num(num: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/missing_number.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `missing_number` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/missing_number.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn missing_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/number_of_1_bits.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `hammingWeight` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/number_of_1_bits.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn hammingWeight(n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/pascals_triangle.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/pascals_triangle.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/reverse_bits.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_bits` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/reverse_bits.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn reverse_bits(x: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/valid_parentheses.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/valid_parentheses.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/search_and_sort/first_bad_version.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/search_and_sort/merge_sorted_array.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/leetcode/editor/cn/easy/search_and_sort/merge_sorted_array.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/count_and_say.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_and_say` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/count_and_say.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/count_and_say.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn count(arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/first_unique_character_in_a_string.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first_uniq_char` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/first_unique_character_in_a_string.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn first_uniq_char(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/implement_strstr.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `str_str` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/implement_strstr.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/longest_common_prefix.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_common_prefix` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/longest_common_prefix.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn longest_common_prefix(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_common_prefix` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/longest_common_prefix.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn has_common_prefix(strs: &Vec, str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/reverse_integer.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/reverse_integer.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/string_to_integer_atoi.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/string_to_integer_atoi.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn my_atoi(str: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_anagram.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_anagram` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_anagram.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_palindrome.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_palindrome.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/binary_tree_level_order_traversal.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/binary_tree_level_order_traversal.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_array_to_bst` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `to_bst` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn to_bst(nums: &Vec, lo: i32, hi: i32) -> Node { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/maximum_depth_of_binary_tree.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_depth` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/maximum_depth_of_binary_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_symmetric2( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric3` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:103:12 [INFO] [stdout] | [INFO] [stdout] 103 | pub fn is_symmetric3(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Tree` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:104:9 [INFO] [stdout] | [INFO] [stdout] 104 | type Tree = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `is_sym` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:105:12 [INFO] [stdout] | [INFO] [stdout] 105 | fn is_sym(p: Tree, q: Tree) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:68:8 [INFO] [stdout] | [INFO] [stdout] 68 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst3` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:76:12 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn is_valid_bst3( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn is_valid_bst2( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst4` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:119:12 [INFO] [stdout] | [INFO] [stdout] 119 | pub fn is_valid_bst4( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `calc_equation` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn calc_equation( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `calc` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:97:8 [INFO] [stdout] | [INFO] [stdout] 97 | fn calc<'a>( [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_edges` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:126:8 [INFO] [stdout] | [INFO] [stdout] 126 | fn add_edges<'a>( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Edges` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:146:8 [INFO] [stdout] | [INFO] [stdout] 146 | struct Edges<'a>(&'a str, &'a str, f64); [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `largest_rectangle_area` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn largest_rectangle_area(mut heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/group_anagrams.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `group_anagrams` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/group_anagrams.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/increasing_triplet_subsequence.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `increasing_triplet` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/increasing_triplet_subsequence.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn increasing_triplet(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_palindromic_substring.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_palindromic_substring.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_longest_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_palindromic_substring.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | fn get_longest_palindrome(str: &[u8], start: usize) -> &[u8] { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_substring_without_repeating_characters.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_longest_substring` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_substring_without_repeating_characters.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zeroes` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zero_of_row` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn set_zero_of_row(arr: &mut Vec>, row: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zero_of_col` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn set_zero_of_col(arr: &mut Vec>, col: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/sum3.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/sum3.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn three_sum(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/sum3.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | fn two_sum(nums: &[i32], target: i32, ve: &mut Vec>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/generate_parentheses.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate_parenthesis` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/generate_parentheses.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `gen_parenthesis` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/generate_parentheses.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | fn gen_parenthesis(left: i32, right: i32, res: &mut Vec, num: i32, s: &str) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations1` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn letter_combinations1(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `back_tracing` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn back_tracing(digits: &[u8], map: &HashMap>, s: &str, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/permutations.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `permute` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/permutations.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn permute(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/subsets.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subsets` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/subsets.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/word_search.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `exist` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/word_search.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn exist(mut board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `RandomizedSet` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct RandomizedSet {} [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | fn insert(&self, _val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | fn remove(&self, _val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_random` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn get_random(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:99:8 [INFO] [stdout] | [INFO] [stdout] 99 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:101:8 [INFO] [stdout] | [INFO] [stdout] 101 | struct Codec2 {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:108:8 [INFO] [stdout] | [INFO] [stdout] 108 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:111:8 [INFO] [stdout] | [INFO] [stdout] 111 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:161:8 [INFO] [stdout] | [INFO] [stdout] 161 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:193:8 [INFO] [stdout] | [INFO] [stdout] 193 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:202:8 [INFO] [stdout] | [INFO] [stdout] 202 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:206:8 [INFO] [stdout] | [INFO] [stdout] 206 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parse_sub_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:216:8 [INFO] [stdout] | [INFO] [stdout] 216 | fn parse_sub_tree(&self, chars: &[u8], ptr: &mut usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parse_int` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:225:8 [INFO] [stdout] | [INFO] [stdout] 225 | fn parse_int(&self, chars: &[u8], ptr: &mut usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parse` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:242:8 [INFO] [stdout] | [INFO] [stdout] 242 | fn parse(&self, chars: &[u8], ptr: &mut usize) -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:254:8 [INFO] [stdout] | [INFO] [stdout] 254 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec3` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:262:8 [INFO] [stdout] | [INFO] [stdout] 262 | struct Codec3 {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:269:8 [INFO] [stdout] | [INFO] [stdout] 269 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:272:8 [INFO] [stdout] | [INFO] [stdout] 272 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:279:8 [INFO] [stdout] | [INFO] [stdout] 279 | fn serialize_tree(root: Option>>, res: &mut String) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:293:8 [INFO] [stdout] | [INFO] [stdout] 293 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:298:8 [INFO] [stdout] | [INFO] [stdout] 298 | fn deserialize_tree(tree: &mut Vec<&str>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/coin_change.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `coin_change` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/coin_change.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/jump_game.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_jump` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/jump_game.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/longest_increasing_subsequence.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_lis` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/longest_increasing_subsequence.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/unique_paths.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/unique_paths.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/odd_even_linked_list.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/odd_even_linked_list.rs:53:1 [INFO] [stdout] | [INFO] [stdout] 53 | type Node = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `odd_even_list` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/odd_even_linked_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn odd_even_list(mut head: Node) -> Node { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/add_two_numbers.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `List` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/add_two_numbers.rs:55:1 [INFO] [stdout] | [INFO] [stdout] 55 | type List = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/add_two_numbers.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn add_two_numbers(l1: List, l2: List) -> List { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/divide_two_integers.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `divide` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/divide_two_integers.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/excel_sheet_column_number.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `title_to_number` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/excel_sheet_column_number.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn title_to_number(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/factorial_trailing_zeroes.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `trailing_zeroes` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/factorial_trailing_zeroes.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn trailing_zeroes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/fraction_to_recurring_decimal.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fraction_to_decimal` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/fraction_to_recurring_decimal.rs:88:12 [INFO] [stdout] | [INFO] [stdout] 88 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/happy_number.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_happy` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/happy_number.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_happy_2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/happy_number.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn is_happy_2(mut n: i32, set: &mut HashSet) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/powx_n.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_pow` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/powx_n.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn my_pow(mut x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/sqrtx.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_sqrt` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/sqrtx.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 86 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `eval_rpn` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_op` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:125:8 [INFO] [stdout] | [INFO] [stdout] 125 | fn is_op(op: &str) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1768:8 [INFO] [stdout] | [INFO] [stdout] 1768 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1772:12 [INFO] [stdout] | [INFO] [stdout] 1772 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1788:12 [INFO] [stdout] | [INFO] [stdout] 1788 | pub fn majority_element2(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `partition` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1805:8 [INFO] [stdout] | [INFO] [stdout] 1805 | fn partition(arr: &mut [i32], lo: usize, hi: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/sum_of_two_integers.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_sum` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/sum_of_two_integers.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn get_sum(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/task_scheduler.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `least_interval` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/task_scheduler.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn least_interval(tasks: Vec, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_range` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_left` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn search_left(nums: &Vec, lo: usize, hi: usize, target: i32) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_right` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:83:8 [INFO] [stdout] | [INFO] [stdout] 83 | fn search_right(nums: &Vec, lo: usize, hi: usize, target: i32) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_peak_element.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_peak_element` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_peak_element.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn find_peak_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_peak` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_peak_element.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn find_peak(ve: &Vec, lo: usize, hi: usize, res: &mut usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/kth_largest_element_in_an_array.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_kth_largest2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/kth_largest_element_in_an_array.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn find_kth_largest2(mut arr: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_kth_largest` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/kth_largest_element_in_an_array.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn find_kth_largest(mut min_heap: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/merge_intervals.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/merge_intervals.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn merge(mut arr: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_a_2d_matrix_ii.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_matrix` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_a_2d_matrix_ii.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_target` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn find_target(arr: &Vec, mut lo: usize, mut hi: usize, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_boarder` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:88:8 [INFO] [stdout] | [INFO] [stdout] 88 | fn find_boarder(arr: &Vec, lo: usize, hi: usize, res: &mut usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/sort_colors.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sort_colors` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/sort_colors.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn sort_colors(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/top_k_frequent_elements.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top_k_frequent` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/top_k_frequent_elements.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder_traversal` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder_traversal2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:111:12 [INFO] [stdout] | [INFO] [stdout] 111 | pub fn inorder_traversal2(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:117:8 [INFO] [stdout] | [INFO] [stdout] 117 | fn inorder(root: &Option>>, vec: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_zigzag_level_order_traversal.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_zigzag_level_order_traversal.rs:74:1 [INFO] [stdout] | [INFO] [stdout] 74 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `zigzag_level_order` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_zigzag_level_order_traversal.rs:77:12 [INFO] [stdout] | [INFO] [stdout] 77 | pub fn zigzag_level_order(root: Node) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:60:1 [INFO] [stdout] | [INFO] [stdout] 60 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Node { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn build_tree2( [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:66:1 [INFO] [stdout] | [INFO] [stdout] 66 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn kth_smallest(root: Node, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | fn kth_smallest2(root: &Node, curr: &mut i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/number_of_islands.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_islands` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/number_of_islands.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn num_islands(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/number_of_islands.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | fn dfs(grid: &mut Vec>, pos: (usize, usize)) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/populating_next_right_pointers_in_each_node.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/minimum_height_trees.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_min_height_trees` [INFO] [stdout] --> src/leetcode/editor/cn/minimum_height_trees.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn find_min_height_trees(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/reconstruct_itinerary.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_itinerary` [INFO] [stdout] --> src/leetcode/editor/cn/reconstruct_itinerary.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn find_itinerary(tickets: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/leetcode/editor/cn/reconstruct_itinerary.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn dfs(graph: &mut HashMap<&str, BinaryHeap>, stack: &mut Vec, from: &str) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_connection` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn find_redundant_connection(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_connection2` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn find_redundant_connection2(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_directed_connection` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn find_redundant_directed_connection(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_directed_connection2` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn find_redundant_directed_connection2(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `UnionFind` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(len: usize) -> UnionFind { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn find(&self, p: usize) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_conn` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn is_conn(&self, p: usize, q: usize) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `union` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn union(&mut self, p: usize, q: usize) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `SIZE` [INFO] [stdout] --> src/sort/sort_test.rs:7:1 [INFO] [stdout] | [INFO] [stdout] 7 | const SIZE: i32 = 10_000; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `create_arr` [INFO] [stdout] --> src/sort/sort_test.rs:190:4 [INFO] [stdout] | [INFO] [stdout] 190 | fn create_arr(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `check_order` [INFO] [stdout] --> src/sort/sort_test.rs:197:4 [INFO] [stdout] | [INFO] [stdout] 197 | fn check_order(arr: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `read_json` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn read_json>(fp: P) -> Result> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Regular` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | Regular, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Category` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:17:16 [INFO] [stdout] | [INFO] [stdout] 17 | #[derive(Hash, Debug, PartialEq, Eq, PartialOrd, Ord)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Irregular` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | Irregular, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Category` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:17:16 [INFO] [stdout] | [INFO] [stdout] 17 | #[derive(Hash, Debug, PartialEq, Eq, PartialOrd, Ord)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Outlandish` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | Outlandish, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Category` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:17:16 [INFO] [stdout] | [INFO] [stdout] 17 | #[derive(Hash, Debug, PartialEq, Eq, PartialOrd, Ord)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `cat_object` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn cat_object(v: &Value) -> Category { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `cat_set` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn cat_set(v: &str) -> Category { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `get_data` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn get_data>(all_printings: P) -> HashMap> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `all_printings_to_unique_items` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn all_printings_to_unique_items( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `o` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn o(x: &Value) -> &serde_json::Map { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `a` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn a(x: &Value) -> &Vec { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `abs_all` [INFO] [stdout] --> src/test_std/test_cow/test_cow.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn abs_all(input: &mut Cow<[i32]>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `abs_sum` [INFO] [stdout] --> src/test_std/test_cow/test_cow.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn abs_sum(ns: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `JobStatus` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct JobStatus { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static is never used: `V` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:45:1 [INFO] [stdout] | [INFO] [stdout] 45 | static mut V: i32 = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `unsafe_seq` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:47:4 [INFO] [stdout] | [INFO] [stdout] 47 | fn unsafe_seq() -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `BASE` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:12:1 [INFO] [stdout] | [INFO] [stdout] 12 | const BASE: usize = 42; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `THREADS` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:13:1 [INFO] [stdout] | [INFO] [stdout] 13 | const THREADS: usize = 12; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `DIFFICULTY` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:14:1 [INFO] [stdout] | [INFO] [stdout] 14 | const DIFFICULTY: &'static str = "12345"; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Solution(usize, String); // usize为找到的数字，String为密文 [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `verify` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:44:4 [INFO] [stdout] | [INFO] [stdout] 44 | fn verify(num: usize) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_solution` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:56:4 [INFO] [stdout] | [INFO] [stdout] 56 | fn find_solution(start_at: usize, tx: Sender, is_solution: Arc) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `main` [INFO] [stdout] --> src/test_std/test_trait/test_nll.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn main() { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/data_struct/link.rs:71:9 [INFO] [stdout] | [INFO] [stdout] 71 | replace(self, Self::None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `ListNode` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/mod.rs:1:9 [INFO] [stdout] | [INFO] [stdout] 1 | pub mod ListNode; [INFO] [stdout] | ^^^^^^^^ help: convert the identifier to snake case: `list_node` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `TreeNode` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/mod.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | pub mod TreeNode; [INFO] [stdout] | ^^^^^^^^ help: convert the identifier to snake case: `tree_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `List` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/easy/mod.rs:1:9 [INFO] [stdout] | [INFO] [stdout] 1 | pub mod List; [INFO] [stdout] | ^^^^ help: convert the identifier to snake case: `list` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `hammingWeight` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/number_of_1_bits.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn hammingWeight(n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `hamming_weight` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:63:13 [INFO] [stdout] | [INFO] [stdout] 63 | tx.send(solution); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 350 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 45.53s [INFO] running `Command { std: "docker" "inspect" "52b1d798dde7794af395ed951dbf60920b54df8f12b68c17d86c53ff8c59f33b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "52b1d798dde7794af395ed951dbf60920b54df8f12b68c17d86c53ff8c59f33b", kill_on_drop: false }` [INFO] [stdout] 52b1d798dde7794af395ed951dbf60920b54df8f12b68c17d86c53ff8c59f33b [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-21/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-21/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" "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:ac0d0aa6ec8ed129e241004a6179c99fa0d2616f50ba759c5b60bd26d0fafa02" "/opt/rustwide/cargo-home/bin/cargo" "+222c5724ecc922fe67815f428c19f82c129d9386" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 8f01f87042b5b4d27ef2d2e3058c496de33faa48946cec8bc129ef275c1e2e23 [INFO] running `Command { std: "docker" "start" "-a" "8f01f87042b5b4d27ef2d2e3058c496de33faa48946cec8bc129ef275c1e2e23", kill_on_drop: false }` [INFO] [stderr] warning: profile `doc` is deprecated and has no effect [INFO] [stdout] warning: unused import: `crate::data_struct::link::Link` [INFO] [stdout] --> src/data_struct/link_test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::data_struct::link::Link; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/data_struct/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod link_test; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `toml::de::Error` [INFO] [stdout] --> src/learn_open_source/toml_demo.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use toml::de::Error; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:36:5 [INFO] [stdout] | [INFO] [stdout] 36 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::process::id` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:37:5 [INFO] [stdout] | [INFO] [stdout] 37 | use std::process::id; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::process::id` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:41:5 [INFO] [stdout] | [INFO] [stdout] 41 | use std::process::id; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `thread`, `time` [INFO] [stdout] --> src/sort/sort_test.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{thread, time}; [INFO] [stdout] | ^^^^^^ ^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/sort/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod sort_test; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::sort::sort` [INFO] [stdout] --> src/sort/sort_test.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use crate::sort::sort; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/sort/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod sort_test; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/test_std/test_string.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/mod.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | mod test_string; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Arc`, `Mutex` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::sync::{Arc, Mutex}; [INFO] [stdout] | ^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | mod test_thread; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `channel`, `sync_channel` [INFO] [stdout] --> src/test_std/test_thread/test_channel.rs:1:23 [INFO] [stdout] | [INFO] [stdout] 1 | use std::sync::mpsc::{channel, sync_channel}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_channel; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::thread` [INFO] [stdout] --> src/test_std/test_thread/test_channel.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::thread; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_channel; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `channel` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:7:23 [INFO] [stdout] | [INFO] [stdout] 7 | use std::sync::mpsc::{channel, Sender}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_thread/mod.rs:3:1 [INFO] [stdout] | [INFO] [stdout] 3 | mod proof_of_work_demo; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/test_std/test_trait/test_map.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_trait/mod.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | mod test_map; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::prelude::SliceRandom` [INFO] [stdout] --> src/test_std/test_trait/test_partition.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use rand::prelude::SliceRandom; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_trait/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_partition; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::thread_rng` [INFO] [stdout] --> src/test_std/test_trait/test_partition.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use rand::thread_rng; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/test_trait/mod.rs:2:1 [INFO] [stdout] | [INFO] [stdout] 2 | mod test_partition; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::BinaryHeap` [INFO] [stdout] --> src/test_std/test_binary_heap.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::BinaryHeap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/mod.rs:11:1 [INFO] [stdout] | [INFO] [stdout] 11 | mod test_binary_heap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `itertools::Itertools` [INFO] [stdout] --> src/test_std/test_binary_heap.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use itertools::Itertools; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/test_std/mod.rs:11:1 [INFO] [stdout] | [INFO] [stdout] 11 | mod test_binary_heap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `head_2` is never read [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut head_2 = None; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `res` is never read [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:91:17 [INFO] [stdout] | [INFO] [stdout] 91 | let mut res = 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 `min` is never read [INFO] [stdout] --> src/sort/sort.rs:25:13 [INFO] [stdout] | [INFO] [stdout] 25 | let mut min: i32 = i32::min_value(); [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `to` [INFO] [stdout] --> src/test_std/test_trait/test_nll.rs:10:24 [INFO] [stdout] | [INFO] [stdout] 10 | while let Some(to) = graph.get_mut("").unwrap_or(&mut BinaryHeap::new()).pop() { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_to` [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/leetcode/editor/cn/redundant_connection.rs:66:13 [INFO] [stdout] | [INFO] [stdout] 66 | let mut graph = Graph::new(edges.len() + 1, &edges); [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: variant is never constructed: `NotFound` [INFO] [stdout] --> src/learn_open_source/error.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | NotFound, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `IoError` [INFO] [stdout] --> src/learn_open_source/error.rs:12:5 [INFO] [stdout] | [INFO] [stdout] 12 | IoError, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadFilePath` [INFO] [stdout] --> src/learn_open_source/error.rs:14:5 [INFO] [stdout] | [INFO] [stdout] 14 | BadFilePath(PathBuf, &'static str), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadEnv` [INFO] [stdout] --> src/learn_open_source/error.rs:16:5 [INFO] [stdout] | [INFO] [stdout] 16 | BadEnv(String), [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadEntry` [INFO] [stdout] --> src/learn_open_source/error.rs:18:5 [INFO] [stdout] | [INFO] [stdout] 18 | BadEntry(String, PathBuf), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `BadType` [INFO] [stdout] --> src/learn_open_source/error.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | BadType(String, &'static str, &'static str, Option), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `ParseError` [INFO] [stdout] --> src/learn_open_source/error.rs:22:5 [INFO] [stdout] | [INFO] [stdout] 22 | ParseError(String, PathBuf, String, Option<(usize, usize)>), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `ConfigError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/learn_open_source/error.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `de_from_file` [INFO] [stdout] --> src/learn_open_source/toml_demo.rs:63:4 [INFO] [stdout] | [INFO] [stdout] 63 | fn de_from_file() -> Result { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/learn_open_source/toml_demo.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_finish` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule_ii.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_order` [INFO] [stdout] --> src/leetcode/editor/cn/course_schedule_ii.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn find_order(num_courses: i32, prerequisites: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/delete_node_in_a_linked_list.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/linked_list_cycle.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/merge_two_sorted_lists.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/merge_two_sorted_lists.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn is_palindrome(mut head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_size` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/palindrome_linked_list.rs:81:8 [INFO] [stdout] | [INFO] [stdout] 81 | fn get_size(mut head: &Option>) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/remove_nth_node_from_end_of_list.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_nth_from_end1` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/remove_nth_node_from_end_of_list.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn remove_nth_from_end1(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_nth_from_end` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/remove_nth_node_from_end_of_list.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn remove_nth_from_end(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/reverse_linked_list.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_list` [INFO] [stdout] --> src/leetcode/editor/cn/easy/List/reverse_linked_list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/best_time_to_buy_and_sell_stock_ii.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/best_time_to_buy_and_sell_stock_ii.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/contains_duplicate.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains_duplicate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/contains_duplicate.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/count_and_say.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_and_say` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/count_and_say.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/intersection_of_two_arrays_ii.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `intersect` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/intersection_of_two_arrays_ii.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn intersect(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/move_zeroes.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_zeroes` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/move_zeroes.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/plus_one.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `plus_one` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/plus_one.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/remove_duplicates_from_sorted_array.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/remove_duplicates_from_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/remove_duplicates_from_sorted_array.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn remove_duplicates2(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/reverse_string.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_string` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/reverse_string.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn reverse_string(s: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn rotate(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn rotate2(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_array.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn reverse(nums: &mut Vec, low: usize, hi: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_image.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_image.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_pos` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/rotate_image.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn next_pos(pos: (usize, usize), n: usize) -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/string_to_integer_atoi.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/string_to_integer_atoi.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn my_atoi2(str: String) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/string_to_integer_atoi.rs:139:12 [INFO] [stdout] | [INFO] [stdout] 139 | pub fn my_atoi(str: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/two_sum.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/two_sum.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/valid_sudoku.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_sudoku` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/valid_sudoku.rs:88:12 [INFO] [stdout] | [INFO] [stdout] 88 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check_dup` [INFO] [stdout] --> src/leetcode/editor/cn/easy/array/valid_sudoku.rs:119:12 [INFO] [stdout] | [INFO] [stdout] 119 | pub fn check_dup(vec: &[char]) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MinStack` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_min` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/min_stack.rs:88:8 [INFO] [stdout] | [INFO] [stdout] 88 | fn get_min(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reset` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn reset(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `shuffle` [INFO] [stdout] --> src/leetcode/editor/cn/easy/design/shuffle_an_array.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | fn shuffle(&self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/best_time_to_buy_and_sell_stock.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/best_time_to_buy_and_sell_stock.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/climbing_stairs.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `climb_stairs` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/climbing_stairs.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/house_robber.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/house_robber.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/maximum_subarray.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sub_array` [INFO] [stdout] --> src/leetcode/editor/cn/easy/dy/maximum_subarray.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/count_primes.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_primes` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/count_primes.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn count_primes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/fizz_buzz.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fizz_buzz` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/fizz_buzz.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn fizz_buzz(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/power_of_three.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_power_of_three` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/power_of_three.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn is_power_of_three(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/roman_to_integer.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `roman_to_int` [INFO] [stdout] --> src/leetcode/editor/cn/easy/math/roman_to_integer.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/hamming_distance.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `hamming_distance` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/hamming_distance.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn hamming_distance(x: i32, y: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_one_of_num` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/hamming_distance.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn count_one_of_num(num: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/missing_number.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `missing_number` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/missing_number.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn missing_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/number_of_1_bits.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `hammingWeight` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/number_of_1_bits.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn hammingWeight(n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/pascals_triangle.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/pascals_triangle.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/reverse_bits.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_bits` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/reverse_bits.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn reverse_bits(x: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/valid_parentheses.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid` [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/valid_parentheses.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/search_and_sort/first_bad_version.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/search_and_sort/merge_sorted_array.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/leetcode/editor/cn/easy/search_and_sort/merge_sorted_array.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/count_and_say.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_and_say` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/count_and_say.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/count_and_say.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn count(arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/first_unique_character_in_a_string.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first_uniq_char` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/first_unique_character_in_a_string.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn first_uniq_char(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/implement_strstr.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `str_str` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/implement_strstr.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/longest_common_prefix.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_common_prefix` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/longest_common_prefix.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn longest_common_prefix(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_common_prefix` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/longest_common_prefix.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn has_common_prefix(strs: &Vec, str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/reverse_integer.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/reverse_integer.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/string_to_integer_atoi.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/string_to_integer_atoi.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn my_atoi(str: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_anagram.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_anagram` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_anagram.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_palindrome.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/easy/string/valid_palindrome.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/binary_tree_level_order_traversal.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/binary_tree_level_order_traversal.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_array_to_bst` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `to_bst` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/convert_sorted_array_to_binary_search_tree.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn to_bst(nums: &Vec, lo: i32, hi: i32) -> Node { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/maximum_depth_of_binary_tree.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_depth` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/maximum_depth_of_binary_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_symmetric2( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric3` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:103:12 [INFO] [stdout] | [INFO] [stdout] 103 | pub fn is_symmetric3(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Tree` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:104:9 [INFO] [stdout] | [INFO] [stdout] 104 | type Tree = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `is_sym` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:105:12 [INFO] [stdout] | [INFO] [stdout] 105 | fn is_sym(p: Tree, q: Tree) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:68:8 [INFO] [stdout] | [INFO] [stdout] 68 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst3` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:76:12 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn is_valid_bst3( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst2` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn is_valid_bst2( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst4` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:119:12 [INFO] [stdout] | [INFO] [stdout] 119 | pub fn is_valid_bst4( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `calc_equation` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn calc_equation( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `calc` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:97:8 [INFO] [stdout] | [INFO] [stdout] 97 | fn calc<'a>( [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_edges` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:126:8 [INFO] [stdout] | [INFO] [stdout] 126 | fn add_edges<'a>( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Edges` [INFO] [stdout] --> src/leetcode/editor/cn/evaluate_division.rs:146:8 [INFO] [stdout] | [INFO] [stdout] 146 | struct Edges<'a>(&'a str, &'a str, f64); [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `largest_rectangle_area` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn largest_rectangle_area(mut heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/group_anagrams.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `group_anagrams` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/group_anagrams.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/increasing_triplet_subsequence.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `increasing_triplet` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/increasing_triplet_subsequence.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn increasing_triplet(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_palindromic_substring.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_palindromic_substring.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_longest_palindrome` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_palindromic_substring.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | fn get_longest_palindrome(str: &[u8], start: usize) -> &[u8] { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_substring_without_repeating_characters.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_longest_substring` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/longest_substring_without_repeating_characters.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zeroes` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zero_of_row` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn set_zero_of_row(arr: &mut Vec>, row: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zero_of_col` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/set_matrix_zeroes.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn set_zero_of_col(arr: &mut Vec>, col: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/sum3.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/sum3.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn three_sum(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/leetcode/editor/cn/medium/array_and_string/sum3.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | fn two_sum(nums: &[i32], target: i32, ve: &mut Vec>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/generate_parentheses.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate_parenthesis` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/generate_parentheses.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `gen_parenthesis` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/generate_parentheses.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | fn gen_parenthesis(left: i32, right: i32, res: &mut Vec, num: i32, s: &str) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations1` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn letter_combinations1(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `back_tracing` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn back_tracing(digits: &[u8], map: &HashMap>, s: &str, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/letter_combinations_of_a_phone_number.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/permutations.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `permute` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/permutations.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn permute(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/subsets.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subsets` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/subsets.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/word_search.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `exist` [INFO] [stdout] --> src/leetcode/editor/cn/medium/back_tracking/word_search.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn exist(mut board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `RandomizedSet` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct RandomizedSet {} [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | fn insert(&self, _val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | fn remove(&self, _val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_random` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/insert_delete_getrandom_o1.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn get_random(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:99:8 [INFO] [stdout] | [INFO] [stdout] 99 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:101:8 [INFO] [stdout] | [INFO] [stdout] 101 | struct Codec2 {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:108:8 [INFO] [stdout] | [INFO] [stdout] 108 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:111:8 [INFO] [stdout] | [INFO] [stdout] 111 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:161:8 [INFO] [stdout] | [INFO] [stdout] 161 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:193:8 [INFO] [stdout] | [INFO] [stdout] 193 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:202:8 [INFO] [stdout] | [INFO] [stdout] 202 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:206:8 [INFO] [stdout] | [INFO] [stdout] 206 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parse_sub_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:216:8 [INFO] [stdout] | [INFO] [stdout] 216 | fn parse_sub_tree(&self, chars: &[u8], ptr: &mut usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parse_int` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:225:8 [INFO] [stdout] | [INFO] [stdout] 225 | fn parse_int(&self, chars: &[u8], ptr: &mut usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parse` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:242:8 [INFO] [stdout] | [INFO] [stdout] 242 | fn parse(&self, chars: &[u8], ptr: &mut usize) -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:254:8 [INFO] [stdout] | [INFO] [stdout] 254 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec3` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:262:8 [INFO] [stdout] | [INFO] [stdout] 262 | struct Codec3 {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:269:8 [INFO] [stdout] | [INFO] [stdout] 269 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:272:8 [INFO] [stdout] | [INFO] [stdout] 272 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:279:8 [INFO] [stdout] | [INFO] [stdout] 279 | fn serialize_tree(root: Option>>, res: &mut String) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:293:8 [INFO] [stdout] | [INFO] [stdout] 293 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/design_problem/serialize_and_deserialize_binary_tree.rs:298:8 [INFO] [stdout] | [INFO] [stdout] 298 | fn deserialize_tree(tree: &mut Vec<&str>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/coin_change.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `coin_change` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/coin_change.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/jump_game.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_jump` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/jump_game.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/longest_increasing_subsequence.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_lis` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/longest_increasing_subsequence.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/unique_paths.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths` [INFO] [stdout] --> src/leetcode/editor/cn/medium/dp/unique_paths.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/odd_even_linked_list.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/odd_even_linked_list.rs:53:1 [INFO] [stdout] | [INFO] [stdout] 53 | type Node = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `odd_even_list` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/odd_even_linked_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn odd_even_list(mut head: Node) -> Node { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/add_two_numbers.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `List` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/add_two_numbers.rs:55:1 [INFO] [stdout] | [INFO] [stdout] 55 | type List = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/leetcode/editor/cn/medium/list/add_two_numbers.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn add_two_numbers(l1: List, l2: List) -> List { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/divide_two_integers.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `divide` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/divide_two_integers.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/excel_sheet_column_number.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `title_to_number` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/excel_sheet_column_number.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn title_to_number(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/factorial_trailing_zeroes.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `trailing_zeroes` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/factorial_trailing_zeroes.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn trailing_zeroes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/fraction_to_recurring_decimal.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fraction_to_decimal` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/fraction_to_recurring_decimal.rs:88:12 [INFO] [stdout] | [INFO] [stdout] 88 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/happy_number.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_happy` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/happy_number.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_happy_2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/happy_number.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn is_happy_2(mut n: i32, set: &mut HashSet) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/powx_n.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_pow` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/powx_n.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn my_pow(mut x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/sqrtx.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_sqrt` [INFO] [stdout] --> src/leetcode/editor/cn/medium/math/sqrtx.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 86 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `eval_rpn` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_op` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/evaluate_reverse_polish_notation.rs:125:8 [INFO] [stdout] | [INFO] [stdout] 125 | fn is_op(op: &str) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1768:8 [INFO] [stdout] | [INFO] [stdout] 1768 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1772:12 [INFO] [stdout] | [INFO] [stdout] 1772 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1788:12 [INFO] [stdout] | [INFO] [stdout] 1788 | pub fn majority_element2(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `partition` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/majority_element.rs:1805:8 [INFO] [stdout] | [INFO] [stdout] 1805 | fn partition(arr: &mut [i32], lo: usize, hi: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/sum_of_two_integers.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_sum` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/sum_of_two_integers.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn get_sum(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/task_scheduler.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `least_interval` [INFO] [stdout] --> src/leetcode/editor/cn/medium/other/task_scheduler.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn least_interval(tasks: Vec, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_range` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_left` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn search_left(nums: &Vec, lo: usize, hi: usize, target: i32) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_right` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_first_and_last_position_of_element_in_sorted_array.rs:83:8 [INFO] [stdout] | [INFO] [stdout] 83 | fn search_right(nums: &Vec, lo: usize, hi: usize, target: i32) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_peak_element.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_peak_element` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_peak_element.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn find_peak_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_peak` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/find_peak_element.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn find_peak(ve: &Vec, lo: usize, hi: usize, res: &mut usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/kth_largest_element_in_an_array.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_kth_largest2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/kth_largest_element_in_an_array.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn find_kth_largest2(mut arr: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_kth_largest` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/kth_largest_element_in_an_array.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn find_kth_largest(mut min_heap: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/merge_intervals.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/merge_intervals.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn merge(mut arr: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_a_2d_matrix_ii.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_matrix` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_a_2d_matrix_ii.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_target` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn find_target(arr: &Vec, mut lo: usize, mut hi: usize, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_boarder` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/search_in_rotated_sorted_array.rs:88:8 [INFO] [stdout] | [INFO] [stdout] 88 | fn find_boarder(arr: &Vec, lo: usize, hi: usize, res: &mut usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/sort_colors.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sort_colors` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/sort_colors.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn sort_colors(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/top_k_frequent_elements.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top_k_frequent` [INFO] [stdout] --> src/leetcode/editor/cn/medium/search_and_sort/top_k_frequent_elements.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder_traversal` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder_traversal2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:111:12 [INFO] [stdout] | [INFO] [stdout] 111 | pub fn inorder_traversal2(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_inorder_traversal.rs:117:8 [INFO] [stdout] | [INFO] [stdout] 117 | fn inorder(root: &Option>>, vec: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_zigzag_level_order_traversal.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_zigzag_level_order_traversal.rs:74:1 [INFO] [stdout] | [INFO] [stdout] 74 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `zigzag_level_order` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/binary_tree_zigzag_level_order_traversal.rs:77:12 [INFO] [stdout] | [INFO] [stdout] 77 | pub fn zigzag_level_order(root: Node) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:60:1 [INFO] [stdout] | [INFO] [stdout] 60 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Node { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/construct_binary_tree_from_preorder_and_inorder_traversal.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn build_tree2( [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Node` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:66:1 [INFO] [stdout] | [INFO] [stdout] 66 | type Node = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn kth_smallest(root: Node, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest2` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/kth_smallest_element_in_a_bst.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | fn kth_smallest2(root: &Node, curr: &mut i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/number_of_islands.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_islands` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/number_of_islands.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn num_islands(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/number_of_islands.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | fn dfs(grid: &mut Vec>, pos: (usize, usize)) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/medium/tree_and_graph/populating_next_right_pointers_in_each_node.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/minimum_height_trees.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_min_height_trees` [INFO] [stdout] --> src/leetcode/editor/cn/minimum_height_trees.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn find_min_height_trees(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/reconstruct_itinerary.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_itinerary` [INFO] [stdout] --> src/leetcode/editor/cn/reconstruct_itinerary.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn find_itinerary(tickets: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/leetcode/editor/cn/reconstruct_itinerary.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn dfs(graph: &mut HashMap<&str, BinaryHeap>, stack: &mut Vec, from: &str) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_connection` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn find_redundant_connection(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_connection2` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn find_redundant_connection2(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_directed_connection` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn find_redundant_directed_connection(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_redundant_directed_connection2` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn find_redundant_directed_connection2(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `UnionFind` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(len: usize) -> UnionFind { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn find(&self, p: usize) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_conn` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn is_conn(&self, p: usize, q: usize) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `union` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn union(&mut self, p: usize, q: usize) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `SIZE` [INFO] [stdout] --> src/sort/sort_test.rs:7:1 [INFO] [stdout] | [INFO] [stdout] 7 | const SIZE: i32 = 10_000; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `create_arr` [INFO] [stdout] --> src/sort/sort_test.rs:190:4 [INFO] [stdout] | [INFO] [stdout] 190 | fn create_arr(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `check_order` [INFO] [stdout] --> src/sort/sort_test.rs:197:4 [INFO] [stdout] | [INFO] [stdout] 197 | fn check_order(arr: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `read_json` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn read_json>(fp: P) -> Result> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Regular` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | Regular, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Category` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:17:16 [INFO] [stdout] | [INFO] [stdout] 17 | #[derive(Hash, Debug, PartialEq, Eq, PartialOrd, Ord)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Irregular` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | Irregular, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Category` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:17:16 [INFO] [stdout] | [INFO] [stdout] 17 | #[derive(Hash, Debug, PartialEq, Eq, PartialOrd, Ord)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Outlandish` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | Outlandish, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Category` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:17:16 [INFO] [stdout] | [INFO] [stdout] 17 | #[derive(Hash, Debug, PartialEq, Eq, PartialOrd, Ord)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `cat_object` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn cat_object(v: &Value) -> Category { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `cat_set` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn cat_set(v: &str) -> Category { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `get_data` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn get_data>(all_printings: P) -> HashMap> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `all_printings_to_unique_items` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn all_printings_to_unique_items( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `o` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn o(x: &Value) -> &serde_json::Map { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `a` [INFO] [stdout] --> src/test_std/match_demo/match_demo.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn a(x: &Value) -> &Vec { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `abs_all` [INFO] [stdout] --> src/test_std/test_cow/test_cow.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn abs_all(input: &mut Cow<[i32]>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `abs_sum` [INFO] [stdout] --> src/test_std/test_cow/test_cow.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn abs_sum(ns: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `JobStatus` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct JobStatus { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static is never used: `V` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:45:1 [INFO] [stdout] | [INFO] [stdout] 45 | static mut V: i32 = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `unsafe_seq` [INFO] [stdout] --> src/test_std/test_thread/test_thread.rs:47:4 [INFO] [stdout] | [INFO] [stdout] 47 | fn unsafe_seq() -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `BASE` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:12:1 [INFO] [stdout] | [INFO] [stdout] 12 | const BASE: usize = 42; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `THREADS` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:13:1 [INFO] [stdout] | [INFO] [stdout] 13 | const THREADS: usize = 12; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `DIFFICULTY` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:14:1 [INFO] [stdout] | [INFO] [stdout] 14 | const DIFFICULTY: &'static str = "12345"; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Solution(usize, String); // usize为找到的数字，String为密文 [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling learn_rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: function is never used: `verify` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:44:4 [INFO] [stdout] | [INFO] [stdout] 44 | fn verify(num: usize) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_solution` [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:56:4 [INFO] [stdout] | [INFO] [stdout] 56 | fn find_solution(start_at: usize, tx: Sender, is_solution: Arc) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `main` [INFO] [stdout] --> src/test_std/test_trait/test_nll.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn main() { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/data_struct/link.rs:71:9 [INFO] [stdout] | [INFO] [stdout] 71 | replace(self, Self::None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `ListNode` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/mod.rs:1:9 [INFO] [stdout] | [INFO] [stdout] 1 | pub mod ListNode; [INFO] [stdout] | ^^^^^^^^ help: convert the identifier to snake case: `list_node` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `TreeNode` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/mod.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | pub mod TreeNode; [INFO] [stdout] | ^^^^^^^^ help: convert the identifier to snake case: `tree_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `List` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/easy/mod.rs:1:9 [INFO] [stdout] | [INFO] [stdout] 1 | pub mod List; [INFO] [stdout] | ^^^^ help: convert the identifier to snake case: `list` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `hammingWeight` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/easy/other/number_of_1_bits.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn hammingWeight(n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `hamming_weight` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/test_std/test_thread/proof_of_work_demo.rs:63:13 [INFO] [stdout] | [INFO] [stdout] 63 | tx.send(solution); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 350 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:36:5 [INFO] [stdout] | [INFO] [stdout] 36 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::process::id` [INFO] [stdout] --> src/leetcode/editor/cn/largest_rectangle_in_histogram_84.rs:37:5 [INFO] [stdout] | [INFO] [stdout] 37 | use std::process::id; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/leetcode/editor/cn/reconstruct_itinerary.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::process::id` [INFO] [stdout] --> src/leetcode/editor/cn/redundant_connection_ii_685.rs:41:5 [INFO] [stdout] | [INFO] [stdout] 41 | use std::process::id; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/editor/cn/union_find.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `insert` found for enum `std::collections::hash_map::Entry` in the current scope [INFO] [stdout] --> src/test_std/test_trait/test_map.rs:19:32 [INFO] [stdout] | [INFO] [stdout] 19 | let entry = map.entry("2").insert(2); [INFO] [stdout] | ^^^^^^ help: there is an associated function with a similar name: `insert_entry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `insert` found for enum `std::collections::hash_map::Entry` in the current scope [INFO] [stdout] --> src/test_std/test_trait/test_map.rs:23:32 [INFO] [stdout] | [INFO] [stdout] 23 | let entry = map.entry("1").insert(2); [INFO] [stdout] | ^^^^^^ help: there is an associated function with a similar name: `insert_entry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/symmetric_tree.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/easy/tree/validate_binary_search_tree.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 2 previous errors; 7 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] For more information about this error, try `rustc --explain E0599`. [INFO] [stdout] [INFO] [stderr] error: could not compile `learn_rust` due to 3 previous errors; 7 warnings emitted [INFO] running `Command { std: "docker" "inspect" "8f01f87042b5b4d27ef2d2e3058c496de33faa48946cec8bc129ef275c1e2e23", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8f01f87042b5b4d27ef2d2e3058c496de33faa48946cec8bc129ef275c1e2e23", kill_on_drop: false }` [INFO] [stdout] 8f01f87042b5b4d27ef2d2e3058c496de33faa48946cec8bc129ef275c1e2e23