[INFO] cloning repository https://github.com/gaojunran/leetcode-rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/gaojunran/leetcode-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgaojunran%2Fleetcode-rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgaojunran%2Fleetcode-rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] a65d271b3409ee751aee185dd633ed1facb40f40
[INFO] testing gaojunran/leetcode-rs against master#0d162b25edd5bf0dba9a22e83b614f1113e90474 for pr-150681
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgaojunran%2Fleetcode-rs" "/workspace/builds/worker-2-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/gaojunran/leetcode-rs
[INFO] finished tweaking git repo https://github.com/gaojunran/leetcode-rs
[INFO] tweaked toml for git repo https://github.com/gaojunran/leetcode-rs written to /workspace/builds/worker-2-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/gaojunran/leetcode-rs on toolchain 0d162b25edd5bf0dba9a22e83b614f1113e90474
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/gaojunran/leetcode-rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 80dcbacf3ebcc764140cda9f589c267fa06eccf55b7d598ffc4aad05c015e693
[INFO] running `Command { std: "docker" "start" "-a" "80dcbacf3ebcc764140cda9f589c267fa06eccf55b7d598ffc4aad05c015e693", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "80dcbacf3ebcc764140cda9f589c267fa06eccf55b7d598ffc4aad05c015e693", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "80dcbacf3ebcc764140cda9f589c267fa06eccf55b7d598ffc4aad05c015e693", kill_on_drop: false }`
[INFO] [stdout] 80dcbacf3ebcc764140cda9f589c267fa06eccf55b7d598ffc4aad05c015e693
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 3d6792c36ac2daf874bb49f7f0fb54fc3e785aadcd2c1113373216d66040e6f8
[INFO] running `Command { std: "docker" "start" "-a" "3d6792c36ac2daf874bb49f7f0fb54fc3e785aadcd2c1113373216d66040e6f8", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.174
[INFO] [stderr]    Compiling cfg-if v1.0.1
[INFO] [stderr]    Compiling memchr v2.7.5
[INFO] [stderr]    Compiling regex-syntax v0.8.5
[INFO] [stderr]    Compiling either v1.15.0
[INFO] [stderr]    Compiling itertools v0.14.0
[INFO] [stderr]    Compiling aho-corasick v1.1.3
[INFO] [stderr]    Compiling getrandom v0.3.3
[INFO] [stderr]    Compiling rand_core v0.9.3
[INFO] [stderr]    Compiling rand_chacha v0.9.0
[INFO] [stderr]    Compiling rand v0.9.1
[INFO] [stderr]    Compiling regex-automata v0.4.9
[INFO] [stderr]    Compiling regex v1.11.1
[INFO] [stderr]    Compiling leetcode-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::cmp::max`
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cmp::max;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Index`
[INFO] [stdout]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array_string/gas_station.rs:27:9
[INFO] [stdout]    |
[INFO] [stdout] 27 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::Solution`
[INFO] [stdout]   --> src/array_string/length_of_last_word.rs:40:9
[INFO] [stdout]    |
[INFO] [stdout] 40 |     use super::Solution;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stdout]  --> src/array_string/insert_delete_getrandom_o1.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use rand::{Rng, thread_rng};
[INFO] [stdout]   |                 ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:40:23
[INFO] [stdout]    |
[INFO] [stdout] 40 |         let mut rng = thread_rng();
[INFO] [stdout]    |                       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated method `rand::Rng::gen_range`: Renamed to `random_range`
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:41:23
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let idx = rng.gen_range(0..self.values.len());
[INFO] [stdout]    |                       ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `linked_list_cycle::ListNode` is more private than the item `has_cycle`
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:1
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ function `has_cycle` is reachable at visibility `pub(in crate::linked_list)`
[INFO] [stdout]    |
[INFO] [stdout] note: but type `linked_list_cycle::ListNode` is only usable at visibility `pub(self)`
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:5:1
[INFO] [stdout]    |
[INFO] [stdout]  5 | struct ListNode{
[INFO] [stdout]    | ^^^^^^^^^^^^^^^
[INFO] [stdout]    = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     // 假设我们在第 i 天卖出股票得到了最大的利润，那我们的买入价格一定是 前i-1天 中最低价格时买入的。
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `str_str` is never used
[INFO] [stdout]   --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/gas_station.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_complete_circuit` is never used
[INFO] [stdout]  --> src/array_string/gas_station.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/h_index.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `h_index` is never used
[INFO] [stdout]  --> src/array_string/h_index.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn h_index(mut citations: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RandomizedSet` is never constructed
[INFO] [stdout]  --> src/array_string/insert_delete_getrandom_o1.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct RandomizedSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl RandomizedSet {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 10 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn get_random(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/insert_interval.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insert` is never used
[INFO] [stdout]  --> src/array_string/insert_interval.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn insert(mut intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/integer_to_roman.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `int_to_roman` is never used
[INFO] [stdout]  --> src/array_string/integer_to_roman.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn int_to_roman(mut num: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/jump_game.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_jump` is never used
[INFO] [stdout]  --> src/array_string/jump_game.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     // 如果一个位置能够到达，那么这个位置左侧所有位置都能到达。
[INFO] [stdout] 4 |     pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/jump_game_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `jump` is never used
[INFO] [stdout]  --> src/array_string/jump_game_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/length_of_last_word.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_last_word` is never used
[INFO] [stdout]  --> src/array_string/length_of_last_word.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn length_of_last_word(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/longest_common_prefix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/array_string/longest_common_prefix.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/longest_substring_without_repeating_characters.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/array_string/longest_substring_without_repeating_characters.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/majority_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `majority_element` is never used
[INFO] [stdout]  --> src/array_string/majority_element.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/merge_intervals.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array_string/merge_intervals.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/merge_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array_string/merge_sorted_array.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn find_min_arrow_shots(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/minimum_size_subarray_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_sub_array_len` is never used
[INFO] [stdout]  --> src/array_string/minimum_size_subarray_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/product_of_array_except_self.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/array_string/product_of_array_except_self.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_element` is never used
[INFO] [stdout]  --> src/array_string/remove_element.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/reverse_words_in_a_string.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_words` is never used
[INFO] [stdout]   --> src/array_string/reverse_words_in_a_string.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 35 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/roman_to_integer.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `roman_to_int` is never used
[INFO] [stdout]   --> src/array_string/roman_to_integer.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/rotate_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]   --> src/array_string/rotate_array.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 11 |     pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/summary_ranges.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `summary_ranges` is never used
[INFO] [stdout]  --> src/array_string/summary_ranges.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/zigzag_conversion.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert` is never used
[INFO] [stdout]  --> src/array_string/zigzag_conversion.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/combination_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `backtrack` are never used
[INFO] [stdout]   --> src/backtracking/combination_sum.rs:3:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  3 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn backtrack(
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/combinations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `combine` is never used
[INFO] [stdout]  --> src/backtracking/combinations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/generate_parentheses.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate_parenthesis` is never used
[INFO] [stdout]  --> src/backtracking/generate_parentheses.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `letter_combinations` is never used
[INFO] [stdout]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/permutations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `permute` is never used
[INFO] [stdout]  --> src/backtracking/permutations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_range` is never used
[INFO] [stdout]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min` is never used
[INFO] [stdout]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak_element` is never used
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_a_2d_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix` is never used
[INFO] [stdout]  --> src/binary_search/search_a_2d_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_in_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_min`, `lower_bound`, and `search` are never used
[INFO] [stdout]   --> src/binary_search/search_in_rotated_sorted_array.rs:5:8
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     // 153. 寻找旋转排序数组中的最小值（返回的是下标）
[INFO] [stdout]  5 |     fn find_min(nums: &[i32]) -> usize {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn lower_bound(nums: &[i32], mut left: usize, mut right: usize, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_insert_position.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/binary_search/search_insert_position.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `average_of_levels` is never used
[INFO] [stdout]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_level_order_traversal.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_level_order_traversal.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_level_order_traversal.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_level_order_traversal.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_right_side_view.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_right_side_view.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_right_side_view.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `right_side_view` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_right_side_view.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `zigzag_level_order` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     #[inline]
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     #[inline]
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/count_complete_tree_nodes.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/count_complete_tree_nodes.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_nodes` is never used
[INFO] [stdout]   --> src/binary_tree/count_complete_tree_nodes.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/flatten_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten` and `travel` are never used
[INFO] [stdout]   --> src/binary_tree/flatten_binary_tree.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 25 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn travel(
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/invert_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `invert_tree` and `invert` are never used
[INFO] [stdout]   --> src/binary_tree/invert_binary_tree.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn invert(node: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_valid_bst.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_bst` is never used
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/kth_smallest_element_in_a_bst.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `kth_smallest` is never used
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Node` is never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:22:6
[INFO] [stdout]    |
[INFO] [stdout] 22 | type Node = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `find_path` are never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 27 |     pub fn lowest_common_ancestor(root: Node, p: Node, q: Node) -> Node {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn find_path(node: &Node, target: i32, path: &mut Vec<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `TreeNodeExt` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:39:11
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub trait TreeNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:55:12
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 55 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/minimum_absolute_difference_in_bst.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_minimum_difference` is never used
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/path_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `has_path_sum` is never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/same_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/same_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/same_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/binary_tree/same_tree.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 52 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/sum_root_to_leaf_numbers.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sum_numbers` is never used
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn sum_numbers(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/symmetric_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/symmetric_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/symmetric_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `is_mirror` are never used
[INFO] [stdout]   --> src/binary_tree/symmetric_tree.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn is_mirror(t1: Option<Rc<RefCell<TreeNode>>>, t2: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/container_with_most_water.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area` is never used
[INFO] [stdout]  --> src/double_ptr/container_with_most_water.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/is_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]  --> src/double_ptr/is_subsequence.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/three_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]  --> src/double_ptr/three_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/valid_palindrome.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/double_ptr/valid_palindrome.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_finish` is never used
[INFO] [stdout]  --> src/graph/course_schedule.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/number_of_islands.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_islands` is never used
[INFO] [stdout]  --> src/graph/number_of_islands.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `solve` is never used
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn solve(board: &mut Vec<Vec<char>>) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/contains_duplicate_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used
[INFO] [stdout]  --> src/hash_table/contains_duplicate_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/group_anagrams_1.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]  --> src/hash_table/group_anagrams_1.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/happy_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_happy` is never used
[INFO] [stdout]   --> src/hash_table/happy_number.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/isomorphic_strings.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]  --> src/hash_table/isomorphic_strings.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_isomorphic(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/longest_consecutive_sequence.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]  --> src/hash_table/longest_consecutive_sequence.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/ransom_note.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_construct` is never used
[INFO] [stdout]  --> src/hash_table/ransom_note.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/two_sum.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/hash_table/two_sum.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/valid_anagram.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]  --> src/hash_table/valid_anagram.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/word_pattern.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_pattern` is never used
[INFO] [stdout]  --> src/hash_table/word_pattern.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn word_pattern(pattern: String, s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/add_two_numbers.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/box_linkedlist.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `ListLink` is never used
[INFO] [stdout]   --> src/linked_list/box_linkedlist.rs:20:10
[INFO] [stdout]    |
[INFO] [stdout] 20 | pub type ListLink = Option<Box<ListNode>>;
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListMaker` is never used
[INFO] [stdout]   --> src/linked_list/box_linkedlist.rs:22:11
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub trait ListMaker {
[INFO] [stdout]    |           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/linked_list_cycle.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct ListNode{
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode{
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn new(val: i32) -> ListNode {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_cycle` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/merge_two_sorted_lists.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new`, `boxed`, and `take` are never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn boxed(val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn take(node: Option<Box<ListNode>>) -> (i32, Option<Box<ListNode>>) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_two_lists` is never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linked_list/partition_list.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/partition_list.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/partition_list.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `partition` is never used
[INFO] [stdout]   --> src/linked_list/partition_list.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn partition(head: Option<Box<ListNode>>, x: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 46 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:69:8
[INFO] [stdout]    |
[INFO] [stdout] 69 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]    --> src/linked_list/remove_nth_node_from_end_of_list.rs:138:12
[INFO] [stdout]     |
[INFO] [stdout] 137 | impl Solution {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 138 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/reverse_linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/reverse_linked_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_between` is never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 46 |     pub fn reverse_between(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/rotate_list.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate_right` is never used
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     pub fn rotate_right(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/rotate_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]  --> src/matrix/rotate_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/set_matrix_zeroes.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `set_zeroes` is never used
[INFO] [stdout]  --> src/matrix/set_matrix_zeroes.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn set_zeroes(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/spiral_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIRS` is never used
[INFO] [stdout]   --> src/matrix/spiral_matrix.rs:52:7
[INFO] [stdout]    |
[INFO] [stdout] 52 | const DIRS: [(i32, i32); 4] = [(0, 1), (1, 0), (0, -1), (-1, 0)]; // 右下左上
[INFO] [stdout]    |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `spiral_order` is never used
[INFO] [stdout]   --> src/matrix/spiral_matrix.rs:55:12
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 55 |     pub fn spiral_order(mut matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/valid_sudoku.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_sudoku` is never used
[INFO] [stdout]  --> src/matrix/valid_sudoku.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/evaluate_reverse_polish_notation.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `eval_rpn` is never used
[INFO] [stdout]  --> src/stack/evaluate_reverse_polish_notation.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/stack/min_stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/stack/min_stack.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/simplify_path.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `simplify_path` is never used
[INFO] [stdout]  --> src/stack/simplify_path.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn simplify_path(path: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid` is never used
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 11.11s
[INFO] running `Command { std: "docker" "inspect" "3d6792c36ac2daf874bb49f7f0fb54fc3e785aadcd2c1113373216d66040e6f8", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "3d6792c36ac2daf874bb49f7f0fb54fc3e785aadcd2c1113373216d66040e6f8", kill_on_drop: false }`
[INFO] [stdout] 3d6792c36ac2daf874bb49f7f0fb54fc3e785aadcd2c1113373216d66040e6f8
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 0266bb87e5c50599d74bba483a4772cce00c97ecb0c2271c491436b2dd55b26a
[INFO] running `Command { std: "docker" "start" "-a" "0266bb87e5c50599d74bba483a4772cce00c97ecb0c2271c491436b2dd55b26a", kill_on_drop: false }`
[INFO] [stdout] warning: unused import: `std::cmp::max`
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cmp::max;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Index`
[INFO] [stdout]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array_string/gas_station.rs:27:9
[INFO] [stdout]    |
[INFO] [stdout] 27 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::Solution`
[INFO] [stdout]   --> src/array_string/length_of_last_word.rs:40:9
[INFO] [stdout]    |
[INFO] [stdout] 40 |     use super::Solution;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stdout]  --> src/array_string/insert_delete_getrandom_o1.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use rand::{Rng, thread_rng};
[INFO] [stdout]   |                 ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:40:23
[INFO] [stdout]    |
[INFO] [stdout] 40 |         let mut rng = thread_rng();
[INFO] [stdout]    |                       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated method `rand::Rng::gen_range`: Renamed to `random_range`
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:41:23
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let idx = rng.gen_range(0..self.values.len());
[INFO] [stdout]    |                       ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `linked_list_cycle::ListNode` is more private than the item `has_cycle`
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:1
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ function `has_cycle` is reachable at visibility `pub(in crate::linked_list)`
[INFO] [stdout]    |
[INFO] [stdout] note: but type `linked_list_cycle::ListNode` is only usable at visibility `pub(self)`
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:5:1
[INFO] [stdout]    |
[INFO] [stdout]  5 | struct ListNode{
[INFO] [stdout]    | ^^^^^^^^^^^^^^^
[INFO] [stdout]    = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     // 假设我们在第 i 天卖出股票得到了最大的利润，那我们的买入价格一定是 前i-1天 中最低价格时买入的。
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `str_str` is never used
[INFO] [stdout]   --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/gas_station.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_complete_circuit` is never used
[INFO] [stdout]  --> src/array_string/gas_station.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/h_index.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `h_index` is never used
[INFO] [stdout]  --> src/array_string/h_index.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn h_index(mut citations: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RandomizedSet` is never constructed
[INFO] [stdout]  --> src/array_string/insert_delete_getrandom_o1.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct RandomizedSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl RandomizedSet {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 10 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn get_random(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/insert_interval.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insert` is never used
[INFO] [stdout]  --> src/array_string/insert_interval.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn insert(mut intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/integer_to_roman.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `int_to_roman` is never used
[INFO] [stdout]  --> src/array_string/integer_to_roman.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn int_to_roman(mut num: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/jump_game.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_jump` is never used
[INFO] [stdout]  --> src/array_string/jump_game.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     // 如果一个位置能够到达，那么这个位置左侧所有位置都能到达。
[INFO] [stdout] 4 |     pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/jump_game_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `jump` is never used
[INFO] [stdout]  --> src/array_string/jump_game_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/length_of_last_word.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_last_word` is never used
[INFO] [stdout]  --> src/array_string/length_of_last_word.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn length_of_last_word(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/longest_common_prefix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/array_string/longest_common_prefix.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/longest_substring_without_repeating_characters.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/array_string/longest_substring_without_repeating_characters.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/majority_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `majority_element` is never used
[INFO] [stdout]  --> src/array_string/majority_element.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/merge_intervals.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array_string/merge_intervals.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/merge_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array_string/merge_sorted_array.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn find_min_arrow_shots(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/minimum_size_subarray_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_sub_array_len` is never used
[INFO] [stdout]  --> src/array_string/minimum_size_subarray_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/product_of_array_except_self.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/array_string/product_of_array_except_self.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_element` is never used
[INFO] [stdout]  --> src/array_string/remove_element.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/reverse_words_in_a_string.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_words` is never used
[INFO] [stdout]   --> src/array_string/reverse_words_in_a_string.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 35 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/roman_to_integer.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `roman_to_int` is never used
[INFO] [stdout]   --> src/array_string/roman_to_integer.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/rotate_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]   --> src/array_string/rotate_array.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 11 |     pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/summary_ranges.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `summary_ranges` is never used
[INFO] [stdout]  --> src/array_string/summary_ranges.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/zigzag_conversion.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert` is never used
[INFO] [stdout]  --> src/array_string/zigzag_conversion.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/combination_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `backtrack` are never used
[INFO] [stdout]   --> src/backtracking/combination_sum.rs:3:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  3 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn backtrack(
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/combinations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `combine` is never used
[INFO] [stdout]  --> src/backtracking/combinations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/generate_parentheses.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate_parenthesis` is never used
[INFO] [stdout]  --> src/backtracking/generate_parentheses.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `letter_combinations` is never used
[INFO] [stdout]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/permutations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `permute` is never used
[INFO] [stdout]  --> src/backtracking/permutations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_range` is never used
[INFO] [stdout]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min` is never used
[INFO] [stdout]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak_element` is never used
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_a_2d_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix` is never used
[INFO] [stdout]  --> src/binary_search/search_a_2d_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_in_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_min`, `lower_bound`, and `search` are never used
[INFO] [stdout]   --> src/binary_search/search_in_rotated_sorted_array.rs:5:8
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     // 153. 寻找旋转排序数组中的最小值（返回的是下标）
[INFO] [stdout]  5 |     fn find_min(nums: &[i32]) -> usize {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn lower_bound(nums: &[i32], mut left: usize, mut right: usize, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_insert_position.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/binary_search/search_insert_position.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `average_of_levels` is never used
[INFO] [stdout]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_level_order_traversal.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_level_order_traversal.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_level_order_traversal.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_level_order_traversal.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_right_side_view.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_right_side_view.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_right_side_view.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `right_side_view` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_right_side_view.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `zigzag_level_order` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     #[inline]
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     #[inline]
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/count_complete_tree_nodes.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/count_complete_tree_nodes.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_nodes` is never used
[INFO] [stdout]   --> src/binary_tree/count_complete_tree_nodes.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/flatten_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten` and `travel` are never used
[INFO] [stdout]   --> src/binary_tree/flatten_binary_tree.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 25 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn travel(
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/invert_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `invert_tree` and `invert` are never used
[INFO] [stdout]   --> src/binary_tree/invert_binary_tree.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn invert(node: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_valid_bst.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_bst` is never used
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/kth_smallest_element_in_a_bst.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `kth_smallest` is never used
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Node` is never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:22:6
[INFO] [stdout]    |
[INFO] [stdout] 22 | type Node = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `find_path` are never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 27 |     pub fn lowest_common_ancestor(root: Node, p: Node, q: Node) -> Node {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn find_path(node: &Node, target: i32, path: &mut Vec<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `TreeNodeExt` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:39:11
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub trait TreeNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:55:12
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 55 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/minimum_absolute_difference_in_bst.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_minimum_difference` is never used
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/path_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `has_path_sum` is never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/same_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/same_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/same_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/binary_tree/same_tree.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 52 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/sum_root_to_leaf_numbers.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sum_numbers` is never used
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn sum_numbers(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/symmetric_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/symmetric_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/symmetric_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `is_mirror` are never used
[INFO] [stdout]   --> src/binary_tree/symmetric_tree.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn is_mirror(t1: Option<Rc<RefCell<TreeNode>>>, t2: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/container_with_most_water.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area` is never used
[INFO] [stdout]  --> src/double_ptr/container_with_most_water.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/is_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]  --> src/double_ptr/is_subsequence.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/three_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]  --> src/double_ptr/three_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/valid_palindrome.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/double_ptr/valid_palindrome.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_finish` is never used
[INFO] [stdout]  --> src/graph/course_schedule.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/number_of_islands.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_islands` is never used
[INFO] [stdout]  --> src/graph/number_of_islands.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `solve` is never used
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn solve(board: &mut Vec<Vec<char>>) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/contains_duplicate_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used
[INFO] [stdout]  --> src/hash_table/contains_duplicate_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/group_anagrams_1.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]  --> src/hash_table/group_anagrams_1.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/happy_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_happy` is never used
[INFO] [stdout]   --> src/hash_table/happy_number.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/isomorphic_strings.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]  --> src/hash_table/isomorphic_strings.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_isomorphic(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/longest_consecutive_sequence.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]  --> src/hash_table/longest_consecutive_sequence.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/ransom_note.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_construct` is never used
[INFO] [stdout]  --> src/hash_table/ransom_note.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/two_sum.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/hash_table/two_sum.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/valid_anagram.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]  --> src/hash_table/valid_anagram.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/word_pattern.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_pattern` is never used
[INFO] [stdout]  --> src/hash_table/word_pattern.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn word_pattern(pattern: String, s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/add_two_numbers.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/box_linkedlist.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `ListLink` is never used
[INFO] [stdout]   --> src/linked_list/box_linkedlist.rs:20:10
[INFO] [stdout]    |
[INFO] [stdout] 20 | pub type ListLink = Option<Box<ListNode>>;
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListMaker` is never used
[INFO] [stdout]   --> src/linked_list/box_linkedlist.rs:22:11
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub trait ListMaker {
[INFO] [stdout]    |           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/linked_list_cycle.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct ListNode{
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode{
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn new(val: i32) -> ListNode {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_cycle` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/merge_two_sorted_lists.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new`, `boxed`, and `take` are never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn boxed(val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn take(node: Option<Box<ListNode>>) -> (i32, Option<Box<ListNode>>) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_two_lists` is never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linked_list/partition_list.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/partition_list.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/partition_list.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `partition` is never used
[INFO] [stdout]   --> src/linked_list/partition_list.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn partition(head: Option<Box<ListNode>>, x: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 46 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:69:8
[INFO] [stdout]    |
[INFO] [stdout] 69 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling leetcode-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]    --> src/linked_list/remove_nth_node_from_end_of_list.rs:138:12
[INFO] [stdout]     |
[INFO] [stdout] 137 | impl Solution {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 138 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/reverse_linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/reverse_linked_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_between` is never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 46 |     pub fn reverse_between(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/rotate_list.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate_right` is never used
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     pub fn rotate_right(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/rotate_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]  --> src/matrix/rotate_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/set_matrix_zeroes.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `set_zeroes` is never used
[INFO] [stdout]  --> src/matrix/set_matrix_zeroes.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn set_zeroes(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/spiral_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIRS` is never used
[INFO] [stdout]   --> src/matrix/spiral_matrix.rs:52:7
[INFO] [stdout]    |
[INFO] [stdout] 52 | const DIRS: [(i32, i32); 4] = [(0, 1), (1, 0), (0, -1), (-1, 0)]; // 右下左上
[INFO] [stdout]    |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `spiral_order` is never used
[INFO] [stdout]   --> src/matrix/spiral_matrix.rs:55:12
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 55 |     pub fn spiral_order(mut matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/valid_sudoku.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_sudoku` is never used
[INFO] [stdout]  --> src/matrix/valid_sudoku.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/evaluate_reverse_polish_notation.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `eval_rpn` is never used
[INFO] [stdout]  --> src/stack/evaluate_reverse_polish_notation.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/stack/min_stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/stack/min_stack.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/simplify_path.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `simplify_path` is never used
[INFO] [stdout]  --> src/stack/simplify_path.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn simplify_path(path: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid` is never used
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::max`
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cmp::max;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Index`
[INFO] [stdout]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stdout]  --> src/array_string/insert_delete_getrandom_o1.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use rand::{Rng, thread_rng};
[INFO] [stdout]   |                 ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:40:23
[INFO] [stdout]    |
[INFO] [stdout] 40 |         let mut rng = thread_rng();
[INFO] [stdout]    |                       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated method `rand::Rng::gen_range`: Renamed to `random_range`
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:41:23
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let idx = rng.gen_range(0..self.values.len());
[INFO] [stdout]    |                       ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `linked_list_cycle::ListNode` is more private than the item `has_cycle`
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:1
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ function `has_cycle` is reachable at visibility `pub(in crate::linked_list)`
[INFO] [stdout]    |
[INFO] [stdout] note: but type `linked_list_cycle::ListNode` is only usable at visibility `pub(self)`
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:5:1
[INFO] [stdout]    |
[INFO] [stdout]  5 | struct ListNode{
[INFO] [stdout]    | ^^^^^^^^^^^^^^^
[INFO] [stdout]    = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     // 假设我们在第 i 天卖出股票得到了最大的利润，那我们的买入价格一定是 前i-1天 中最低价格时买入的。
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `str_str` is never used
[INFO] [stdout]   --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/h_index.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `h_index` is never used
[INFO] [stdout]  --> src/array_string/h_index.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn h_index(mut citations: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RandomizedSet` is never constructed
[INFO] [stdout]  --> src/array_string/insert_delete_getrandom_o1.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct RandomizedSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stdout]   --> src/array_string/insert_delete_getrandom_o1.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl RandomizedSet {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 10 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn get_random(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/insert_interval.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insert` is never used
[INFO] [stdout]  --> src/array_string/insert_interval.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn insert(mut intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/integer_to_roman.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `int_to_roman` is never used
[INFO] [stdout]  --> src/array_string/integer_to_roman.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn int_to_roman(mut num: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/jump_game.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_jump` is never used
[INFO] [stdout]  --> src/array_string/jump_game.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     // 如果一个位置能够到达，那么这个位置左侧所有位置都能到达。
[INFO] [stdout] 4 |     pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/jump_game_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `jump` is never used
[INFO] [stdout]  --> src/array_string/jump_game_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/longest_common_prefix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/array_string/longest_common_prefix.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/longest_substring_without_repeating_characters.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/array_string/longest_substring_without_repeating_characters.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/majority_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `majority_element` is never used
[INFO] [stdout]  --> src/array_string/majority_element.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/merge_intervals.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array_string/merge_intervals.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/merge_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array_string/merge_sorted_array.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn find_min_arrow_shots(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/minimum_size_subarray_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_sub_array_len` is never used
[INFO] [stdout]  --> src/array_string/minimum_size_subarray_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/product_of_array_except_self.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/array_string/product_of_array_except_self.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/remove_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_element` is never used
[INFO] [stdout]  --> src/array_string/remove_element.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/reverse_words_in_a_string.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_words` is never used
[INFO] [stdout]   --> src/array_string/reverse_words_in_a_string.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 35 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/roman_to_integer.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `roman_to_int` is never used
[INFO] [stdout]   --> src/array_string/roman_to_integer.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/rotate_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]   --> src/array_string/rotate_array.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 11 |     pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/summary_ranges.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `summary_ranges` is never used
[INFO] [stdout]  --> src/array_string/summary_ranges.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array_string/zigzag_conversion.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert` is never used
[INFO] [stdout]  --> src/array_string/zigzag_conversion.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/combination_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `backtrack` are never used
[INFO] [stdout]   --> src/backtracking/combination_sum.rs:3:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  3 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn backtrack(
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/combinations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `combine` is never used
[INFO] [stdout]  --> src/backtracking/combinations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/generate_parentheses.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate_parenthesis` is never used
[INFO] [stdout]  --> src/backtracking/generate_parentheses.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `letter_combinations` is never used
[INFO] [stdout]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtracking/permutations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `permute` is never used
[INFO] [stdout]  --> src/backtracking/permutations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_range` is never used
[INFO] [stdout]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min` is never used
[INFO] [stdout]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak_element` is never used
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_a_2d_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix` is never used
[INFO] [stdout]  --> src/binary_search/search_a_2d_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_in_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_min`, `lower_bound`, and `search` are never used
[INFO] [stdout]   --> src/binary_search/search_in_rotated_sorted_array.rs:5:8
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     // 153. 寻找旋转排序数组中的最小值（返回的是下标）
[INFO] [stdout]  5 |     fn find_min(nums: &[i32]) -> usize {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn lower_bound(nums: &[i32], mut left: usize, mut right: usize, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_insert_position.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/binary_search/search_insert_position.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `average_of_levels` is never used
[INFO] [stdout]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_level_order_traversal.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_level_order_traversal.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_level_order_traversal.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_level_order_traversal.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_right_side_view.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_right_side_view.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_right_side_view.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `right_side_view` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_right_side_view.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `zigzag_level_order` is never used
[INFO] [stdout]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     #[inline]
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     #[inline]
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/count_complete_tree_nodes.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/count_complete_tree_nodes.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_nodes` is never used
[INFO] [stdout]   --> src/binary_tree/count_complete_tree_nodes.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/flatten_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten` and `travel` are never used
[INFO] [stdout]   --> src/binary_tree/flatten_binary_tree.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 25 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn travel(
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/invert_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `invert_tree` and `invert` are never used
[INFO] [stdout]   --> src/binary_tree/invert_binary_tree.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn invert(node: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_valid_bst.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_bst` is never used
[INFO] [stdout]   --> src/binary_tree/is_valid_bst.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/kth_smallest_element_in_a_bst.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `kth_smallest` is never used
[INFO] [stdout]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Node` is never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:22:6
[INFO] [stdout]    |
[INFO] [stdout] 22 | type Node = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `find_path` are never used
[INFO] [stdout]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 27 |     pub fn lowest_common_ancestor(root: Node, p: Node, q: Node) -> Node {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn find_path(node: &Node, target: i32, path: &mut Vec<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `TreeNodeExt` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:39:11
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub trait TreeNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:55:12
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 55 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/minimum_absolute_difference_in_bst.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_minimum_difference` is never used
[INFO] [stdout]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/path_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `has_path_sum` is never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/same_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/same_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/same_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/binary_tree/same_tree.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 52 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/sum_root_to_leaf_numbers.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sum_numbers` is never used
[INFO] [stdout]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn sum_numbers(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/symmetric_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/symmetric_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/symmetric_tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `is_mirror` are never used
[INFO] [stdout]   --> src/binary_tree/symmetric_tree.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn is_mirror(t1: Option<Rc<RefCell<TreeNode>>>, t2: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/container_with_most_water.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area` is never used
[INFO] [stdout]  --> src/double_ptr/container_with_most_water.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/is_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]  --> src/double_ptr/is_subsequence.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/three_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]  --> src/double_ptr/three_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_ptr/valid_palindrome.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/double_ptr/valid_palindrome.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_finish` is never used
[INFO] [stdout]  --> src/graph/course_schedule.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/number_of_islands.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_islands` is never used
[INFO] [stdout]  --> src/graph/number_of_islands.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `solve` is never used
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn solve(board: &mut Vec<Vec<char>>) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/contains_duplicate_ii.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used
[INFO] [stdout]  --> src/hash_table/contains_duplicate_ii.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/group_anagrams_1.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]  --> src/hash_table/group_anagrams_1.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/happy_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_happy` is never used
[INFO] [stdout]   --> src/hash_table/happy_number.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/isomorphic_strings.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]  --> src/hash_table/isomorphic_strings.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_isomorphic(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/longest_consecutive_sequence.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]  --> src/hash_table/longest_consecutive_sequence.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/ransom_note.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_construct` is never used
[INFO] [stdout]  --> src/hash_table/ransom_note.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/two_sum.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/hash_table/two_sum.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/valid_anagram.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]  --> src/hash_table/valid_anagram.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash_table/word_pattern.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_pattern` is never used
[INFO] [stdout]  --> src/hash_table/word_pattern.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn word_pattern(pattern: String, s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/add_two_numbers.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/box_linkedlist.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `ListLink` is never used
[INFO] [stdout]   --> src/linked_list/box_linkedlist.rs:20:10
[INFO] [stdout]    |
[INFO] [stdout] 20 | pub type ListLink = Option<Box<ListNode>>;
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListMaker` is never used
[INFO] [stdout]   --> src/linked_list/box_linkedlist.rs:22:11
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub trait ListMaker {
[INFO] [stdout]    |           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/linked_list_cycle.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct ListNode{
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode{
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn new(val: i32) -> ListNode {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_cycle` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/merge_two_sorted_lists.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new`, `boxed`, and `take` are never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn boxed(val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn take(node: Option<Box<ListNode>>) -> (i32, Option<Box<ListNode>>) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_two_lists` is never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linked_list/partition_list.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/partition_list.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/partition_list.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `partition` is never used
[INFO] [stdout]   --> src/linked_list/partition_list.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn partition(head: Option<Box<ListNode>>, x: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 46 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:69:8
[INFO] [stdout]    |
[INFO] [stdout] 69 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]    --> src/linked_list/remove_nth_node_from_end_of_list.rs:138:12
[INFO] [stdout]     |
[INFO] [stdout] 137 | impl Solution {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 138 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/reverse_linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list/reverse_linked_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `ListNodeExt` is never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:14:11
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub trait ListNodeExt {
[INFO] [stdout]    |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_between` is never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 46 |     pub fn reverse_between(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list/rotate_list.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate_right` is never used
[INFO] [stdout]   --> src/linked_list/rotate_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     pub fn rotate_right(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/rotate_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]  --> src/matrix/rotate_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/set_matrix_zeroes.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `set_zeroes` is never used
[INFO] [stdout]  --> src/matrix/set_matrix_zeroes.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn set_zeroes(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/spiral_matrix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIRS` is never used
[INFO] [stdout]   --> src/matrix/spiral_matrix.rs:52:7
[INFO] [stdout]    |
[INFO] [stdout] 52 | const DIRS: [(i32, i32); 4] = [(0, 1), (1, 0), (0, -1), (-1, 0)]; // 右下左上
[INFO] [stdout]    |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `spiral_order` is never used
[INFO] [stdout]   --> src/matrix/spiral_matrix.rs:55:12
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 55 |     pub fn spiral_order(mut matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/matrix/valid_sudoku.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_sudoku` is never used
[INFO] [stdout]  --> src/matrix/valid_sudoku.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/evaluate_reverse_polish_notation.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `eval_rpn` is never used
[INFO] [stdout]  --> src/stack/evaluate_reverse_polish_notation.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/stack/min_stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/stack/min_stack.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/simplify_path.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `simplify_path` is never used
[INFO] [stdout]  --> src/stack/simplify_path.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn simplify_path(path: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid` is never used
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.89s
[INFO] running `Command { std: "docker" "inspect" "0266bb87e5c50599d74bba483a4772cce00c97ecb0c2271c491436b2dd55b26a", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0266bb87e5c50599d74bba483a4772cce00c97ecb0c2271c491436b2dd55b26a", kill_on_drop: false }`
[INFO] [stdout] 0266bb87e5c50599d74bba483a4772cce00c97ecb0c2271c491436b2dd55b26a
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] b813d09c0b3b9ba556098238ee99966e31d496dea500f87daa40f25a7bae7dcd
[INFO] running `Command { std: "docker" "start" "-a" "b813d09c0b3b9ba556098238ee99966e31d496dea500f87daa40f25a7bae7dcd", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `std::cmp::max`
[INFO] [stderr]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::cmp::max;
[INFO] [stderr]   |     ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::ops::Index`
[INFO] [stderr]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::ops::Index;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::*`
[INFO] [stderr]   --> src/array_string/gas_station.rs:27:9
[INFO] [stderr]    |
[INFO] [stderr] 27 |     use super::*;
[INFO] [stderr]    |         ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::Solution`
[INFO] [stderr]   --> src/array_string/length_of_last_word.rs:40:9
[INFO] [stderr]    |
[INFO] [stderr] 40 |     use super::Solution;
[INFO] [stderr]    |         ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stderr]  --> src/array_string/insert_delete_getrandom_o1.rs:1:17
[INFO] [stderr]   |
[INFO] [stderr] 1 | use rand::{Rng, thread_rng};
[INFO] [stderr]   |                 ^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(deprecated)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: use of deprecated function `rand::thread_rng`: Renamed to `rng`
[INFO] [stderr]   --> src/array_string/insert_delete_getrandom_o1.rs:40:23
[INFO] [stderr]    |
[INFO] [stderr] 40 |         let mut rng = thread_rng();
[INFO] [stderr]    |                       ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: use of deprecated method `rand::Rng::gen_range`: Renamed to `random_range`
[INFO] [stderr]   --> src/array_string/insert_delete_getrandom_o1.rs:41:23
[INFO] [stderr]    |
[INFO] [stderr] 41 |         let idx = rng.gen_range(0..self.values.len());
[INFO] [stderr]    |                       ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type `linked_list_cycle::ListNode` is more private than the item `has_cycle`
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:19:1
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ function `has_cycle` is reachable at visibility `pub(in crate::linked_list)`
[INFO] [stderr]    |
[INFO] [stderr] note: but type `linked_list_cycle::ListNode` is only usable at visibility `pub(self)`
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:5:1
[INFO] [stderr]    |
[INFO] [stderr]  5 | struct ListNode{
[INFO] [stderr]    | ^^^^^^^^^^^^^^^
[INFO] [stderr]    = note: `#[warn(private_interfaces)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:2:8
[INFO] [stderr]   |
[INFO] [stderr] 2 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `max_profit` is never used
[INFO] [stderr]  --> src/array_string/best_time_to_buy_and_sell_stock.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     // 假设我们在第 i 天卖出股票得到了最大的利润，那我们的买入价格一定是 前i-1天 中最低价格时买入的。
[INFO] [stderr] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `max_profit` is never used
[INFO] [stderr]  --> src/array_string/best_time_to_buy_and_sell_stock_ii.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `str_str` is never used
[INFO] [stderr]   --> src/array_string/find_the_index_of_the_first_occurence_in_a_string.rs:30:12
[INFO] [stderr]    |
[INFO] [stderr] 29 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 30 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stderr]    |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/gas_station.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `can_complete_circuit` is never used
[INFO] [stderr]  --> src/array_string/gas_station.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/h_index.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `h_index` is never used
[INFO] [stderr]  --> src/array_string/h_index.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn h_index(mut citations: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `RandomizedSet` is never constructed
[INFO] [stderr]  --> src/array_string/insert_delete_getrandom_o1.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | struct RandomizedSet {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stderr]   --> src/array_string/insert_delete_getrandom_o1.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr]  9 | impl RandomizedSet {
[INFO] [stderr]    | ------------------ associated items in this implementation
[INFO] [stderr] 10 |     fn new() -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 17 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 26 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 39 |     fn get_random(&self) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/insert_interval.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `insert` is never used
[INFO] [stderr]  --> src/array_string/insert_interval.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn insert(mut intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]   |            ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/integer_to_roman.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `int_to_roman` is never used
[INFO] [stderr]  --> src/array_string/integer_to_roman.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn int_to_roman(mut num: i32) -> String {
[INFO] [stderr]   |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/jump_game.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `can_jump` is never used
[INFO] [stderr]  --> src/array_string/jump_game.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     // 如果一个位置能够到达，那么这个位置左侧所有位置都能到达。
[INFO] [stderr] 4 |     pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/jump_game_ii.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `jump` is never used
[INFO] [stderr]  --> src/array_string/jump_game_ii.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/length_of_last_word.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `length_of_last_word` is never used
[INFO] [stderr]  --> src/array_string/length_of_last_word.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn length_of_last_word(s: String) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/longest_common_prefix.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `longest_common_prefix` is never used
[INFO] [stderr]  --> src/array_string/longest_common_prefix.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/longest_substring_without_repeating_characters.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `length_of_longest_substring` is never used
[INFO] [stderr]   --> src/array_string/longest_substring_without_repeating_characters.rs:28:12
[INFO] [stderr]    |
[INFO] [stderr] 27 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 28 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/majority_element.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `majority_element` is never used
[INFO] [stderr]  --> src/array_string/majority_element.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/merge_intervals.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `merge` is never used
[INFO] [stderr]  --> src/array_string/merge_intervals.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stderr]   |            ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/merge_sorted_array.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `merge` is never used
[INFO] [stderr]  --> src/array_string/merge_sorted_array.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stderr]   |            ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stderr]  --> src/array_string/minimal_number_of_arrows_to_burst_balloons.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn find_min_arrow_shots(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/minimum_size_subarray_sum.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `min_sub_array_len` is never used
[INFO] [stderr]  --> src/array_string/minimum_size_subarray_sum.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/product_of_array_except_self.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `product_except_self` is never used
[INFO] [stderr]  --> src/array_string/product_of_array_except_self.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/remove_duplicates_from_sorted_array.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `remove_duplicates` is never used
[INFO] [stderr]  --> src/array_string/remove_duplicates_from_sorted_array.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `remove_duplicates` is never used
[INFO] [stderr]  --> src/array_string/remove_duplicates_from_sorted_array_ii.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/remove_element.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `remove_element` is never used
[INFO] [stderr]  --> src/array_string/remove_element.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/reverse_words_in_a_string.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `reverse_words` is never used
[INFO] [stderr]   --> src/array_string/reverse_words_in_a_string.rs:35:12
[INFO] [stderr]    |
[INFO] [stderr] 34 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 35 |     pub fn reverse_words(s: String) -> String {
[INFO] [stderr]    |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/roman_to_integer.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `roman_to_int` is never used
[INFO] [stderr]   --> src/array_string/roman_to_integer.rs:31:12
[INFO] [stderr]    |
[INFO] [stderr] 30 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 31 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/rotate_array.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `rotate` is never used
[INFO] [stderr]   --> src/array_string/rotate_array.rs:11:12
[INFO] [stderr]    |
[INFO] [stderr]  2 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 11 |     pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stderr]    |            ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/summary_ranges.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `summary_ranges` is never used
[INFO] [stderr]  --> src/array_string/summary_ranges.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/array_string/zigzag_conversion.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `convert` is never used
[INFO] [stderr]  --> src/array_string/zigzag_conversion.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/backtracking/combination_sum.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `combination_sum` and `backtrack` are never used
[INFO] [stderr]   --> src/backtracking/combination_sum.rs:3:12
[INFO] [stderr]    |
[INFO] [stderr]  2 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  3 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 10 |     fn backtrack(
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/backtracking/combinations.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `combine` is never used
[INFO] [stderr]  --> src/backtracking/combinations.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/backtracking/generate_parentheses.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `generate_parenthesis` is never used
[INFO] [stderr]  --> src/backtracking/generate_parentheses.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `letter_combinations` is never used
[INFO] [stderr]  --> src/backtracking/letter_combinations_of_a_phone_number.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/backtracking/permutations.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `permute` is never used
[INFO] [stderr]  --> src/backtracking/permutations.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `search_range` is never used
[INFO] [stderr]  --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]   |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `find_min` is never used
[INFO] [stderr]  --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_search/find_peak_element.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_peak_element` is never used
[INFO] [stderr]  --> src/binary_search/find_peak_element.rs:2:8
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_search/search_a_2d_matrix.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `search_matrix` is never used
[INFO] [stderr]  --> src/binary_search/search_a_2d_matrix.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_search/search_in_rotated_sorted_array.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `find_min`, `lower_bound`, and `search` are never used
[INFO] [stderr]   --> src/binary_search/search_in_rotated_sorted_array.rs:5:8
[INFO] [stderr]    |
[INFO] [stderr]  3 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  4 |     // 153. 寻找旋转排序数组中的最小值（返回的是下标）
[INFO] [stderr]  5 |     fn find_min(nums: &[i32]) -> usize {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 21 |     fn lower_bound(nums: &[i32], mut left: usize, mut right: usize, target: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 38 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]    |            ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_search/search_insert_position.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `search_insert` is never used
[INFO] [stderr]  --> src/binary_search/search_insert_position.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/average_of_levels_in_binary_tree.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `average_of_levels` is never used
[INFO] [stderr]   --> src/binary_tree/average_of_levels_in_binary_tree.rs:29:12
[INFO] [stderr]    |
[INFO] [stderr] 28 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 29 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/binary_tree_level_order_traversal.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/binary_tree_level_order_traversal.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/binary_tree_level_order_traversal.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `level_order` is never used
[INFO] [stderr]   --> src/binary_tree/binary_tree_level_order_traversal.rs:29:12
[INFO] [stderr]    |
[INFO] [stderr] 28 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 29 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/binary_tree_right_side_view.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/binary_tree_right_side_view.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/binary_tree_right_side_view.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `right_side_view` is never used
[INFO] [stderr]   --> src/binary_tree/binary_tree_right_side_view.rs:29:12
[INFO] [stderr]    |
[INFO] [stderr] 28 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 29 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `zigzag_level_order` is never used
[INFO] [stderr]   --> src/binary_tree/binary_tree_zigzag_level_order_traversal.rs:29:12
[INFO] [stderr]    |
[INFO] [stderr] 28 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 29 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:6:12
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:14:12
[INFO] [stderr]    |
[INFO] [stderr] 12 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 13 |     #[inline]
[INFO] [stderr] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `build_tree` is never used
[INFO] [stderr]   --> src/binary_tree/construct_binary_tree_from_inorder_and_postorder_traversal.rs:24:12
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 24 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:12
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:14:12
[INFO] [stderr]    |
[INFO] [stderr] 12 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 13 |     #[inline]
[INFO] [stderr] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `build_tree` is never used
[INFO] [stderr]   --> src/binary_tree/construct_binary_tree_from_preorder_and_inorder_traversal.rs:24:12
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 24 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/count_complete_tree_nodes.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/binary_tree/count_complete_tree_nodes.rs:11:8
[INFO] [stderr]    |
[INFO] [stderr] 11 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `count_nodes` is never used
[INFO] [stderr]   --> src/binary_tree/count_complete_tree_nodes.rs:15:12
[INFO] [stderr]    |
[INFO] [stderr] 14 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 15 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/flatten_binary_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/flatten_binary_tree.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/flatten_binary_tree.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `flatten` and `travel` are never used
[INFO] [stderr]   --> src/binary_tree/flatten_binary_tree.rs:25:12
[INFO] [stderr]    |
[INFO] [stderr] 24 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr] 25 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stderr]    |            ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 41 |     pub fn travel(
[INFO] [stderr]    |            ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/invert_binary_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/invert_binary_tree.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/invert_binary_tree.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `invert_tree` and `invert` are never used
[INFO] [stderr]   --> src/binary_tree/invert_binary_tree.rs:24:12
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr] 24 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 28 |     fn invert(node: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/is_valid_bst.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/is_valid_bst.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/binary_tree/is_valid_bst.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `is_valid_bst` is never used
[INFO] [stderr]   --> src/binary_tree/is_valid_bst.rs:25:12
[INFO] [stderr]    |
[INFO] [stderr] 24 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 25 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/kth_smallest_element_in_a_bst.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:11:12
[INFO] [stderr]    |
[INFO] [stderr]  9 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 10 |     #[inline]
[INFO] [stderr] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `kth_smallest` is never used
[INFO] [stderr]   --> src/binary_tree/kth_smallest_element_in_a_bst.rs:24:12
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 24 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:2:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:10:12
[INFO] [stderr]    |
[INFO] [stderr]  8 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr]  9 |     #[inline]
[INFO] [stderr] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Node` is never used
[INFO] [stderr]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:22:6
[INFO] [stderr]    |
[INFO] [stderr] 22 | type Node = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stderr]    |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:24:8
[INFO] [stderr]    |
[INFO] [stderr] 24 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `lowest_common_ancestor` and `find_path` are never used
[INFO] [stderr]   --> src/binary_tree/lowest_common_ancestor_of_a_binary_tree.rs:27:12
[INFO] [stderr]    |
[INFO] [stderr] 26 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr] 27 |     pub fn lowest_common_ancestor(root: Node, p: Node, q: Node) -> Node {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 56 |     fn find_path(node: &Node, target: i32, path: &mut Vec<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/maximum_depth_of_binary_tree.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `TreeNodeExt` is never used
[INFO] [stderr]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:39:11
[INFO] [stderr]    |
[INFO] [stderr] 39 | pub trait TreeNodeExt {
[INFO] [stderr]    |           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `max_depth` is never used
[INFO] [stderr]   --> src/binary_tree/maximum_depth_of_binary_tree.rs:55:12
[INFO] [stderr]    |
[INFO] [stderr] 54 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 55 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/minimum_absolute_difference_in_bst.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:11:12
[INFO] [stderr]    |
[INFO] [stderr]  9 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 10 |     #[inline]
[INFO] [stderr] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `get_minimum_difference` is never used
[INFO] [stderr]   --> src/binary_tree/minimum_absolute_difference_in_bst.rs:24:12
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 24 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/path_sum.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/path_sum.rs:11:12
[INFO] [stderr]    |
[INFO] [stderr]  9 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 10 |     #[inline]
[INFO] [stderr] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/binary_tree/path_sum.rs:20:8
[INFO] [stderr]    |
[INFO] [stderr] 20 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `has_path_sum` is never used
[INFO] [stderr]   --> src/binary_tree/path_sum.rs:27:12
[INFO] [stderr]    |
[INFO] [stderr] 26 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 27 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/same_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/same_tree.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/same_tree.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `is_same_tree` is never used
[INFO] [stderr]   --> src/binary_tree/same_tree.rs:52:12
[INFO] [stderr]    |
[INFO] [stderr] 51 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 52 |     pub fn is_same_tree(
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/sum_root_to_leaf_numbers.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:11:12
[INFO] [stderr]    |
[INFO] [stderr]  9 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stdout] 
[INFO] [stderr] 10 |     #[inline]
[INFO] [stdout] running 2 tests
[INFO] [stderr] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `sum_numbers` is never used
[INFO] [stderr]   --> src/binary_tree/sum_root_to_leaf_numbers.rs:23:12
[INFO] [stderr]    |
[INFO] [stderr] 22 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 23 |     pub fn sum_numbers(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/binary_tree/symmetric_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/binary_tree/symmetric_tree.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/binary_tree/symmetric_tree.rs:13:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 12 |     #[inline]
[INFO] [stderr] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `is_symmetric` and `is_mirror` are never used
[INFO] [stderr]   --> src/binary_tree/symmetric_tree.rs:24:12
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr] 24 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 34 |     fn is_mirror(t1: Option<Rc<RefCell<TreeNode>>>, t2: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/double_ptr/container_with_most_water.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `max_area` is never used
[INFO] [stderr]  --> src/double_ptr/container_with_most_water.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 4 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 5 |     pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/double_ptr/is_subsequence.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `is_subsequence` is never used
[INFO] [stderr]  --> src/double_ptr/is_subsequence.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/double_ptr/three_sum.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `three_sum` is never used
[INFO] [stderr]  --> src/double_ptr/three_sum.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]   |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `two_sum` is never used
[INFO] [stderr]  --> src/double_ptr/two_sum_ii_input_array_is_sorted.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/double_ptr/valid_palindrome.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `is_palindrome` is never used
[INFO] [stderr]  --> src/double_ptr/valid_palindrome.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/graph/course_schedule.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stdout] test array_string::gas_station::test::test ... FAILED
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `can_finish` is never used
[INFO] [stderr]  --> src/graph/course_schedule.rs:8:12
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stderr]   |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/graph/course_schedule_ii.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout] test array_string::length_of_last_word::test::test222 ... FAILED
[INFO] [stderr] 
[INFO] [stdout] 
[INFO] [stderr] warning: associated function `find_order` is never used
[INFO] [stdout] failures:
[INFO] [stderr]  --> src/graph/course_schedule_ii.rs:8:12
[INFO] [stdout] 
[INFO] [stderr]   |
[INFO] [stdout] ---- array_string::gas_station::test::test stdout ----
[INFO] [stderr] 7 | impl Solution {
[INFO] [stdout] 
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout] thread 'array_string::gas_station::test::test' (24) panicked at src/array_string/gas_station.rs:34:9:
[INFO] [stderr] 8 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout] assertion `left == right` failed
[INFO] [stderr]   |            ^^^^^^^^^^
[INFO] [stdout]   left: -1
[INFO] [stderr] 
[INFO] [stdout]  right: 1
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout] stack backtrace:
[INFO] [stderr]  --> src/graph/number_of_islands.rs:1:8
[INFO] [stdout]    0:     0x56d7f97c7922 - std[3b51380354919863]::backtrace_rs::backtrace::libunwind::trace
[INFO] [stderr]   |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/../../backtrace/src/backtrace/libunwind.rs:117:9
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]    1:     0x56d7f97c7922 - std[3b51380354919863]::backtrace_rs::backtrace::trace_unsynchronized::<std[3b51380354919863]::sys::backtrace::_print_fmt::{closure#1}>
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/../../backtrace/src/backtrace/mod.rs:66:14
[INFO] [stderr] 
[INFO] [stdout]    2:     0x56d7f97c7922 - std[3b51380354919863]::sys::backtrace::_print_fmt
[INFO] [stderr] warning: associated function `num_islands` is never used
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:74:9
[INFO] [stderr]  --> src/graph/number_of_islands.rs:4:12
[INFO] [stdout]    3:     0x56d7f97c7922 - <<std[3b51380354919863]::sys::backtrace::BacktraceLock>::print::DisplayBacktrace as core[27de1724e4349be2]::fmt::Display>::fmt
[INFO] [stderr]   |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:44:26
[INFO] [stderr] 3 | impl Solution {
[INFO] [stdout]    4:     0x56d7f97dc12a - <core[27de1724e4349be2]::fmt::rt::Argument>::fmt
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/fmt/rt.rs:152:76
[INFO] [stderr] 4 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    5:     0x56d7f97dc12a - core[27de1724e4349be2]::fmt::write
[INFO] [stderr]   |            ^^^^^^^^^^^
[INFO] [stdout]    6:     0x56d7f97cc726 - std[3b51380354919863]::io::default_write_fmt::<alloc[a57f19327c0ad893]::vec::Vec<u8>>
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/io/mod.rs:639:11
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]    7:     0x56d7f97cc726 - <alloc[a57f19327c0ad893]::vec::Vec<u8> as std[3b51380354919863]::io::Write>::write_fmt
[INFO] [stderr]  --> src/graph/surrounded_regions.rs:1:8
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/io/mod.rs:1994:13
[INFO] [stderr]   |
[INFO] [stdout]    8:     0x56d7f97a60bf - <std[3b51380354919863]::sys::backtrace::BacktraceLock>::print
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:47:9
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]    9:     0x56d7f97a60bf - std[3b51380354919863]::panicking::default_hook::{closure#0}
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:292:27
[INFO] [stderr] warning: associated function `solve` is never used
[INFO] [stdout]   10:     0x56d7f97bfc09 - std[3b51380354919863]::panicking::default_hook
[INFO] [stderr]  --> src/graph/surrounded_regions.rs:3:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:316:9
[INFO] [stderr]   |
[INFO] [stdout]   11:     0x56d7f975b55e - <alloc[a57f19327c0ad893]::boxed::Box<dyn for<'a, 'b> core[27de1724e4349be2]::ops::function::Fn<(&'a std[3b51380354919863]::panic::PanicHookInfo<'b>,), Output = ()> + core[27de1724e4349be2]::marker::Sync + core[27de1724e4349be2]::marker::Send> as core[27de1724e4349be2]::ops::function::Fn<(&std[3b51380354919863]::panic::PanicHookInfo,)>>::call
[INFO] [stderr] 2 | impl Solution {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/alloc/src/boxed.rs:2220:9
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]   12:     0x56d7f975b55e - test[182b2e79ecd7bbd9]::test_main_with_exit_callback::<test[182b2e79ecd7bbd9]::test_main::{closure#0}>::{closure#0}
[INFO] [stderr] 3 |     pub fn solve(board: &mut Vec<Vec<char>>) {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:145:21
[INFO] [stderr]   |            ^^^^^
[INFO] [stdout]   13:     0x56d7f97bfdc2 - <alloc[a57f19327c0ad893]::boxed::Box<dyn for<'a, 'b> core[27de1724e4349be2]::ops::function::Fn<(&'a std[3b51380354919863]::panic::PanicHookInfo<'b>,), Output = ()> + core[27de1724e4349be2]::marker::Sync + core[27de1724e4349be2]::marker::Send> as core[27de1724e4349be2]::ops::function::Fn<(&std[3b51380354919863]::panic::PanicHookInfo,)>>::call
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/alloc/src/boxed.rs:2220:9
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]   14:     0x56d7f97bfdc2 - std[3b51380354919863]::panicking::panic_with_hook
[INFO] [stderr]  --> src/hash_table/contains_duplicate_ii.rs:1:8
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:833:13
[INFO] [stderr]   |
[INFO] [stdout]   15:     0x56d7f97a6178 - std[3b51380354919863]::panicking::panic_handler::{closure#0}
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:698:13
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]   16:     0x56d7f979b3f9 - std[3b51380354919863]::sys::backtrace::__rust_end_short_backtrace::<std[3b51380354919863]::panicking::panic_handler::{closure#0}, !>
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:182:18
[INFO] [stderr] warning: associated function `contains_nearby_duplicate` is never used
[INFO] [stdout]   17:     0x56d7f97a6fcd - __rustc[d79c0ace40940972]::rust_begin_unwind
[INFO] [stderr]  --> src/hash_table/contains_duplicate_ii.rs:3:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:689:5
[INFO] [stderr]   |
[INFO] [stdout]   18:     0x56d7f97dc7fc - core[27de1724e4349be2]::panicking::panic_fmt
[INFO] [stderr] 2 | impl Solution {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panicking.rs:80:14
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]   19:     0x56d7f97dc6b3 - core[27de1724e4349be2]::panicking::assert_failed_inner
[INFO] [stderr] 3 |     pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panicking.rs:439:17
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   20:     0x56d7f979a615 - core[27de1724e4349be2]::panicking::assert_failed::<i32, i32>
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panicking.rs:394:5
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]   21:     0x56d7f974dddd - leetcode_rs[739da7b6fdb79b1f]::array_string::gas_station::test::test
[INFO] [stderr]  --> src/hash_table/group_anagrams_1.rs:1:8
[INFO] [stdout]                                at /opt/rustwide/workdir/src/array_string/gas_station.rs:34:9
[INFO] [stderr]   |
[INFO] [stdout]   22:     0x56d7f974cf67 - leetcode_rs[739da7b6fdb79b1f]::array_string::gas_station::test::test::{closure#0}
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]                                at /opt/rustwide/workdir/src/array_string/gas_station.rs:30:14
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]   23:     0x56d7f974f766 - <leetcode_rs[739da7b6fdb79b1f]::array_string::gas_station::test::test::{closure#0} as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/ops/function.rs:250:5
[INFO] [stderr] warning: associated function `group_anagrams` is never used
[INFO] [stdout]   24:     0x56d7f974f90b - <fn() -> core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr]  --> src/hash_table/group_anagrams_1.rs:3:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/ops/function.rs:250:5
[INFO] [stderr]   |
[INFO] [stdout]   25:     0x56d7f974f90b - test[182b2e79ecd7bbd9]::__rust_begin_short_backtrace::<core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>, fn() -> core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>>
[INFO] [stderr] 2 | impl Solution {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:663:18
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]   26:     0x56d7f975c16a - test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}
[INFO] [stderr] 3 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:686:74
[INFO] [stderr]   |            ^^^^^^^^^^^^^^
[INFO] [stdout]   27:     0x56d7f975c16a - <core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panic/unwind_safe.rs:274:9
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]   28:     0x56d7f975c16a - std[3b51380354919863]::panicking::catch_unwind::do_call::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}>, core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>>
[INFO] [stderr]  --> src/hash_table/happy_number.rs:1:8
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:581:40
[INFO] [stderr]   |
[INFO] [stdout]   29:     0x56d7f975c16a - std[3b51380354919863]::panicking::catch_unwind::<core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>, core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}>>
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:544:19
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]   30:     0x56d7f975c16a - std[3b51380354919863]::panic::catch_unwind::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}>, core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>>
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panic.rs:359:14
[INFO] [stderr] warning: associated function `is_happy` is never used
[INFO] [stdout]   31:     0x56d7f975c16a - test[182b2e79ecd7bbd9]::run_test_in_process
[INFO] [stderr]   --> src/hash_table/happy_number.rs:27:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:686:27
[INFO] [stderr]    |
[INFO] [stdout]   32:     0x56d7f975c16a - test[182b2e79ecd7bbd9]::run_test::{closure#0}
[INFO] [stderr]  2 | impl Solution {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:607:43
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stdout]   33:     0x56d7f9757714 - test[182b2e79ecd7bbd9]::run_test::{closure#1}
[INFO] [stderr] ...
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:637:41
[INFO] [stderr] 27 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]   34:     0x56d7f9757714 - std[3b51380354919863]::sys::backtrace::__rust_begin_short_backtrace::<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>
[INFO] [stderr]    |            ^^^^^^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:166:18
[INFO] [stderr] 
[INFO] [stdout]   35:     0x56d7f975ec62 - std[3b51380354919863]::thread::lifecycle::spawn_unchecked::<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/thread/lifecycle.rs:91:13
[INFO] [stderr]  --> src/hash_table/isomorphic_strings.rs:1:8
[INFO] [stdout]   36:     0x56d7f975ec62 - <core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr]   |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panic/unwind_safe.rs:274:9
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]   37:     0x56d7f975ec62 - std[3b51380354919863]::panicking::catch_unwind::do_call::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}>, ()>
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:581:40
[INFO] [stderr] 
[INFO] [stdout]   38:     0x56d7f975ec62 - std[3b51380354919863]::panicking::catch_unwind::<(), core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}>>
[INFO] [stderr] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:544:19
[INFO] [stderr]  --> src/hash_table/isomorphic_strings.rs:3:12
[INFO] [stdout]   39:     0x56d7f975ec62 - std[3b51380354919863]::panic::catch_unwind::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}>, ()>
[INFO] [stderr]   |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panic.rs:359:14
[INFO] [stderr] 2 | impl Solution {
[INFO] [stdout]   40:     0x56d7f975ec62 - std[3b51380354919863]::thread::lifecycle::spawn_unchecked::<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/thread/lifecycle.rs:89:26
[INFO] [stderr] 3 |     pub fn is_isomorphic(s: String, t: String) -> bool {
[INFO] [stdout]   41:     0x56d7f975ec62 - <std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1} as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once::{shim:vtable#0}
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/ops/function.rs:250:5
[INFO] [stderr] 
[INFO] [stdout]   42:     0x56d7f97c71cf - <alloc[a57f19327c0ad893]::boxed::Box<dyn core[27de1724e4349be2]::ops::function::FnOnce<(), Output = ()> + core[27de1724e4349be2]::marker::Send> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/alloc/src/boxed.rs:2206:9
[INFO] [stderr]  --> src/hash_table/longest_consecutive_sequence.rs:3:8
[INFO] [stdout]   43:     0x56d7f97c71cf - <std[3b51380354919863]::sys::thread::unix::Thread>::new::thread_start
[INFO] [stderr]   |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/thread/unix.rs:119:17
[INFO] [stderr] 3 | struct Solution;
[INFO] [stdout]   44:     0x7cf5464c2aa4 - <unknown>
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]   45:     0x7cf54654fa64 - clone
[INFO] [stderr] 
[INFO] [stdout]   46:                0x0 - <unknown>
[INFO] [stderr] warning: associated function `longest_consecutive` is never used
[INFO] [stdout] 
[INFO] [stderr]  --> src/hash_table/longest_consecutive_sequence.rs:5:12
[INFO] [stdout] ---- array_string::length_of_last_word::test::test222 stdout ----
[INFO] [stderr]   |
[INFO] [stdout] [src/array_string/length_of_last_word.rs:9:9] j = 0
[INFO] [stderr] 4 | impl Solution {
[INFO] [stdout] 
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout] thread 'array_string::length_of_last_word::test::test222' (25) panicked at src/array_string/length_of_last_word.rs:12:13:
[INFO] [stderr] 5 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout] attempt to subtract with overflow
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] stack backtrace:
[INFO] [stderr] 
[INFO] [stdout]    0:     0x56d7f97c7922 - std[3b51380354919863]::backtrace_rs::backtrace::libunwind::trace
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/../../backtrace/src/backtrace/libunwind.rs:117:9
[INFO] [stderr]  --> src/hash_table/ransom_note.rs:6:8
[INFO] [stdout]    1:     0x56d7f97c7922 - std[3b51380354919863]::backtrace_rs::backtrace::trace_unsynchronized::<std[3b51380354919863]::sys::backtrace::_print_fmt::{closure#1}>
[INFO] [stderr]   |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/../../backtrace/src/backtrace/mod.rs:66:14
[INFO] [stderr] 6 | struct Solution;
[INFO] [stdout]    2:     0x56d7f97c7922 - std[3b51380354919863]::sys::backtrace::_print_fmt
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:74:9
[INFO] [stderr] 
[INFO] [stdout]    3:     0x56d7f97c7922 - <<std[3b51380354919863]::sys::backtrace::BacktraceLock>::print::DisplayBacktrace as core[27de1724e4349be2]::fmt::Display>::fmt
[INFO] [stderr] warning: associated function `can_construct` is never used
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:44:26
[INFO] [stderr]  --> src/hash_table/ransom_note.rs:9:12
[INFO] [stdout]    4:     0x56d7f97dc12a - <core[27de1724e4349be2]::fmt::rt::Argument>::fmt
[INFO] [stderr]   |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/fmt/rt.rs:152:76
[INFO] [stderr] 8 | impl Solution {
[INFO] [stdout]    5:     0x56d7f97dc12a - core[27de1724e4349be2]::fmt::write
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]    6:     0x56d7f97cc726 - std[3b51380354919863]::io::default_write_fmt::<alloc[a57f19327c0ad893]::vec::Vec<u8>>
[INFO] [stderr] 9 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/io/mod.rs:639:11
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stdout]    7:     0x56d7f97cc726 - <alloc[a57f19327c0ad893]::vec::Vec<u8> as std[3b51380354919863]::io::Write>::write_fmt
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/io/mod.rs:1994:13
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]    8:     0x56d7f97a60bf - <std[3b51380354919863]::sys::backtrace::BacktraceLock>::print
[INFO] [stderr]  --> src/hash_table/two_sum.rs:6:8
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:47:9
[INFO] [stderr]   |
[INFO] [stdout]    9:     0x56d7f97a60bf - std[3b51380354919863]::panicking::default_hook::{closure#0}
[INFO] [stderr] 6 | struct Solution;
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:292:27
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]   10:     0x56d7f97bfc09 - std[3b51380354919863]::panicking::default_hook
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:316:9
[INFO] [stderr] warning: associated function `two_sum` is never used
[INFO] [stdout]   11:     0x56d7f975b55e - <alloc[a57f19327c0ad893]::boxed::Box<dyn for<'a, 'b> core[27de1724e4349be2]::ops::function::Fn<(&'a std[3b51380354919863]::panic::PanicHookInfo<'b>,), Output = ()> + core[27de1724e4349be2]::marker::Sync + core[27de1724e4349be2]::marker::Send> as core[27de1724e4349be2]::ops::function::Fn<(&std[3b51380354919863]::panic::PanicHookInfo,)>>::call
[INFO] [stderr]  --> src/hash_table/two_sum.rs:9:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/alloc/src/boxed.rs:2220:9
[INFO] [stderr]   |
[INFO] [stdout]   12:     0x56d7f975b55e - test[182b2e79ecd7bbd9]::test_main_with_exit_callback::<test[182b2e79ecd7bbd9]::test_main::{closure#0}>::{closure#0}
[INFO] [stderr] 8 | impl Solution {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:145:21
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]   13:     0x56d7f97bfdc2 - <alloc[a57f19327c0ad893]::boxed::Box<dyn for<'a, 'b> core[27de1724e4349be2]::ops::function::Fn<(&'a std[3b51380354919863]::panic::PanicHookInfo<'b>,), Output = ()> + core[27de1724e4349be2]::marker::Sync + core[27de1724e4349be2]::marker::Send> as core[27de1724e4349be2]::ops::function::Fn<(&std[3b51380354919863]::panic::PanicHookInfo,)>>::call
[INFO] [stderr] 9 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/alloc/src/boxed.rs:2220:9
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stdout]   14:     0x56d7f97bfdc2 - std[3b51380354919863]::panicking::panic_with_hook
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:833:13
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]   15:     0x56d7f97a61aa - std[3b51380354919863]::panicking::panic_handler::{closure#0}
[INFO] [stderr]  --> src/hash_table/valid_anagram.rs:1:8
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:691:13
[INFO] [stderr]   |
[INFO] [stdout]   16:     0x56d7f979b3f9 - std[3b51380354919863]::sys::backtrace::__rust_end_short_backtrace::<std[3b51380354919863]::panicking::panic_handler::{closure#0}, !>
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:182:18
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]   17:     0x56d7f97a6fcd - __rustc[d79c0ace40940972]::rust_begin_unwind
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:689:5
[INFO] [stderr] warning: associated function `is_anagram` is never used
[INFO] [stdout]   18:     0x56d7f97dc7fc - core[27de1724e4349be2]::panicking::panic_fmt
[INFO] [stderr]  --> src/hash_table/valid_anagram.rs:3:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panicking.rs:80:14
[INFO] [stderr]   |
[INFO] [stdout]   19:     0x56d7f97dd839 - core[27de1724e4349be2]::panicking::panic_const::panic_const_sub_overflow
[INFO] [stderr] 2 | impl Solution {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panicking.rs:175:17
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]   20:     0x56d7f974d935 - <leetcode_rs[739da7b6fdb79b1f]::array_string::length_of_last_word::Solution>::length_of_last_word
[INFO] [stderr] 3 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]                                at /opt/rustwide/workdir/src/array_string/length_of_last_word.rs:12:13
[INFO] [stderr]   |            ^^^^^^^^^^
[INFO] [stdout]   21:     0x56d7f974de34 - leetcode_rs[739da7b6fdb79b1f]::array_string::length_of_last_word::test::test222
[INFO] [stderr] 
[INFO] [stdout]                                at /opt/rustwide/workdir/src/array_string/length_of_last_word.rs:44:20
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]   22:     0x56d7f974cf97 - leetcode_rs[739da7b6fdb79b1f]::array_string::length_of_last_word::test::test222::{closure#0}
[INFO] [stderr]  --> src/hash_table/word_pattern.rs:1:8
[INFO] [stdout]                                at /opt/rustwide/workdir/src/array_string/length_of_last_word.rs:43:17
[INFO] [stderr]   |
[INFO] [stdout]   23:     0x56d7f974f7a6 - <leetcode_rs[739da7b6fdb79b1f]::array_string::length_of_last_word::test::test222::{closure#0} as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr] 1 | struct Solution;
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/ops/function.rs:250:5
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout]   24:     0x56d7f974f90b - <fn() -> core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/ops/function.rs:250:5
[INFO] [stderr] warning: associated function `word_pattern` is never used
[INFO] [stdout]   25:     0x56d7f974f90b - test[182b2e79ecd7bbd9]::__rust_begin_short_backtrace::<core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>, fn() -> core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>>
[INFO] [stderr]  --> src/hash_table/word_pattern.rs:3:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:663:18
[INFO] [stderr]   |
[INFO] [stdout]   26:     0x56d7f975c16a - test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}
[INFO] [stderr] 2 | impl Solution {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:686:74
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stdout]   27:     0x56d7f975c16a - <core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr] 3 |     pub fn word_pattern(pattern: String, s: String) -> bool {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panic/unwind_safe.rs:274:9
[INFO] [stderr]   |            ^^^^^^^^^^^^
[INFO] [stdout]   28:     0x56d7f975c16a - std[3b51380354919863]::panicking::catch_unwind::do_call::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}>, core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>>
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:581:40
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stdout]   29:     0x56d7f975c16a - std[3b51380354919863]::panicking::catch_unwind::<core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>, core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}>>
[INFO] [stderr]  --> src/linked_list/add_two_numbers.rs:3:12
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:544:19
[INFO] [stderr]   |
[INFO] [stdout]   30:     0x56d7f975c16a - std[3b51380354919863]::panic::catch_unwind::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<test[182b2e79ecd7bbd9]::run_test_in_process::{closure#0}>, core[27de1724e4349be2]::result::Result<(), alloc[a57f19327c0ad893]::string::String>>
[INFO] [stderr] 3 | pub struct ListNode {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panic.rs:359:14
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stdout]   31:     0x56d7f975c16a - test[182b2e79ecd7bbd9]::run_test_in_process
[INFO] [stderr] 
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:686:27
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stdout]   32:     0x56d7f975c16a - test[182b2e79ecd7bbd9]::run_test::{closure#0}
[INFO] [stderr]   --> src/linked_list/add_two_numbers.rs:10:8
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:607:43
[INFO] [stderr]    |
[INFO] [stdout]   33:     0x56d7f9757714 - test[182b2e79ecd7bbd9]::run_test::{closure#1}
[INFO] [stderr]  8 | impl ListNode {
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/test/src/lib.rs:637:41
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stdout]   34:     0x56d7f9757714 - std[3b51380354919863]::sys::backtrace::__rust_begin_short_backtrace::<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>
[INFO] [stderr]  9 |     #[inline]
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/backtrace.rs:166:18
[INFO] [stderr] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]   35:     0x56d7f975ec62 - std[3b51380354919863]::thread::lifecycle::spawn_unchecked::<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}
[INFO] [stderr]    |        ^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/thread/lifecycle.rs:91:13
[INFO] [stderr] 
[INFO] [stdout]   36:     0x56d7f975ec62 - <core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/panic/unwind_safe.rs:274:9
[INFO] [stderr]   --> src/linked_list/add_two_numbers.rs:14:8
[INFO] [stdout]   37:     0x56d7f975ec62 - std[3b51380354919863]::panicking::catch_unwind::do_call::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}>, ()>
[INFO] [stderr]    |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:581:40
[INFO] [stderr] 14 | struct Solution;
[INFO] [stdout]   38:     0x56d7f975ec62 - std[3b51380354919863]::panicking::catch_unwind::<(), core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}>>
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panicking.rs:544:19
[INFO] [stderr] 
[INFO] [stdout]   39:     0x56d7f975ec62 - std[3b51380354919863]::panic::catch_unwind::<core[27de1724e4349be2]::panic::unwind_safe::AssertUnwindSafe<std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}::{closure#0}>, ()>
[INFO] [stderr] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/panic.rs:359:14
[INFO] [stderr]   --> src/linked_list/add_two_numbers.rs:16:12
[INFO] [stdout]   40:     0x56d7f975ec62 - std[3b51380354919863]::thread::lifecycle::spawn_unchecked::<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1}
[INFO] [stderr]    |
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/thread/lifecycle.rs:89:26
[INFO] [stderr] 15 | impl Solution {
[INFO] [stdout]   41:     0x56d7f975ec62 - <std[3b51380354919863]::thread::lifecycle::spawn_unchecked<test[182b2e79ecd7bbd9]::run_test::{closure#1}, ()>::{closure#1} as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once::{shim:vtable#0}
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/core/src/ops/function.rs:250:5
[INFO] [stderr] 16 |     pub fn add_two_numbers(
[INFO] [stdout]   42:     0x56d7f97c71cf - <alloc[a57f19327c0ad893]::boxed::Box<dyn core[27de1724e4349be2]::ops::function::FnOnce<(), Output = ()> + core[27de1724e4349be2]::marker::Send> as core[27de1724e4349be2]::ops::function::FnOnce<()>>::call_once
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/alloc/src/boxed.rs:2206:9
[INFO] [stderr] 
[INFO] [stdout]   43:     0x56d7f97c71cf - <std[3b51380354919863]::sys::thread::unix::Thread>::new::thread_start
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stdout]                                at /rustc/0d162b25edd5bf0dba9a22e83b614f1113e90474/library/std/src/sys/thread/unix.rs:119:17
[INFO] [stderr]  --> src/linked_list/box_linkedlist.rs:2:12
[INFO] [stdout]   44:     0x7cf5464c2aa4 - <unknown>
[INFO] [stderr]   |
[INFO] [stdout]   45:     0x7cf54654fa64 - clone
[INFO] [stderr] 2 | pub struct ListNode {
[INFO] [stdout]   46:                0x0 - <unknown>
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stderr] 
[INFO] [stdout] 
[INFO] [stderr] warning: type alias `ListLink` is never used
[INFO] [stdout] failures:
[INFO] [stderr]   --> src/linked_list/box_linkedlist.rs:20:10
[INFO] [stdout]     array_string::gas_station::test::test
[INFO] [stderr]    |
[INFO] [stdout]     array_string::length_of_last_word::test::test222
[INFO] [stderr] 20 | pub type ListLink = Option<Box<ListNode>>;
[INFO] [stdout] 
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stdout] test result: FAILED. 0 passed; 2 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.02s
[INFO] [stderr] 
[INFO] [stdout] 
[INFO] [stderr] warning: trait `ListMaker` is never used
[INFO] [stderr]   --> src/linked_list/box_linkedlist.rs:22:11
[INFO] [stderr]    |
[INFO] [stderr] 22 | pub trait ListMaker {
[INFO] [stderr]    |           ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list/linked_list_cycle.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | struct ListNode{
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:11:12
[INFO] [stderr]    |
[INFO] [stderr] 10 | impl ListNode{
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 11 |     pub fn new(val: i32) -> ListNode {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `has_cycle` is never used
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub fn has_cycle(head: Option<Rc<RefCell<ListNode>>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list/merge_two_sorted_lists.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `new`, `boxed`, and `take` are never used
[INFO] [stderr]   --> src/linked_list/merge_two_sorted_lists.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr]  8 | impl ListNode {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  9 |     #[inline]
[INFO] [stderr] 10 |     fn new(val: i32) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 14 |     fn boxed(val: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 19 |     fn take(node: Option<Box<ListNode>>) -> (i32, Option<Box<ListNode>>) {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/linked_list/merge_two_sorted_lists.rs:27:8
[INFO] [stderr]    |
[INFO] [stderr] 27 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `merge_two_lists` is never used
[INFO] [stderr]   --> src/linked_list/merge_two_sorted_lists.rs:29:12
[INFO] [stderr]    |
[INFO] [stderr] 28 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 29 |     pub fn merge_two_lists(
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/linked_list/partition_list.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list/partition_list.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/linked_list/partition_list.rs:12:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | impl ListNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 11 |     #[inline]
[INFO] [stderr] 12 |     fn new(val: i32) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `partition` is never used
[INFO] [stderr]   --> src/linked_list/partition_list.rs:31:12
[INFO] [stderr]    |
[INFO] [stderr] 30 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 31 |     pub fn partition(head: Option<Box<ListNode>>, x: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:2:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/linked_list/remove_duplicates_from_sorted_list.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     #[inline]
[INFO] [stderr] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]   |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `ListNodeExt` is never used
[INFO] [stderr]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:14:11
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub trait ListNodeExt {
[INFO] [stderr]    |           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:44:8
[INFO] [stderr]    |
[INFO] [stderr] 44 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `delete_duplicates` is never used
[INFO] [stderr]   --> src/linked_list/remove_duplicates_from_sorted_list.rs:46:12
[INFO] [stderr]    |
[INFO] [stderr] 45 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 46 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:2:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/linked_list/remove_nth_node_from_end_of_list.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     #[inline]
[INFO] [stderr] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]   |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `ListNodeExt` is never used
[INFO] [stderr]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:14:11
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub trait ListNodeExt {
[INFO] [stderr]    |           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/linked_list/remove_nth_node_from_end_of_list.rs:69:8
[INFO] [stderr]    |
[INFO] [stderr] 69 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `remove_nth_from_end` is never used
[INFO] [stderr]    --> src/linked_list/remove_nth_node_from_end_of_list.rs:138:12
[INFO] [stderr]     |
[INFO] [stderr] 137 | impl Solution {
[INFO] [stderr]     | ------------- associated function in this implementation
[INFO] [stderr] 138 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list/reverse_linked_list.rs:2:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/linked_list/reverse_linked_list.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     #[inline]
[INFO] [stderr] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]   |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `ListNodeExt` is never used
[INFO] [stderr]   --> src/linked_list/reverse_linked_list.rs:14:11
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub trait ListNodeExt {
[INFO] [stderr]    |           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/linked_list/reverse_linked_list.rs:43:12
[INFO] [stderr]    |
[INFO] [stderr] 43 | pub struct Solution;
[INFO] [stderr]    |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `reverse_between` is never used
[INFO] [stderr]   --> src/linked_list/reverse_linked_list.rs:46:12
[INFO] [stderr]    |
[INFO] [stderr] 45 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 46 |     pub fn reverse_between(
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list/rotate_list.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/linked_list/rotate_list.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr]  8 | impl ListNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr]  9 |     #[inline]
[INFO] [stderr] 10 |     fn new(val: i32) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/linked_list/rotate_list.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `rotate_right` is never used
[INFO] [stderr]   --> src/linked_list/rotate_list.rs:17:12
[INFO] [stderr]    |
[INFO] [stderr] 16 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 17 |     pub fn rotate_right(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/matrix/rotate_matrix.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `rotate` is never used
[INFO] [stderr]  --> src/matrix/rotate_matrix.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stderr]   |            ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/matrix/set_matrix_zeroes.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `set_zeroes` is never used
[INFO] [stderr]  --> src/matrix/set_matrix_zeroes.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn set_zeroes(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stderr]   |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/matrix/spiral_matrix.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: constant `DIRS` is never used
[INFO] [stderr]   --> src/matrix/spiral_matrix.rs:52:7
[INFO] [stderr]    |
[INFO] [stderr] 52 | const DIRS: [(i32, i32); 4] = [(0, 1), (1, 0), (0, -1), (-1, 0)]; // 右下左上
[INFO] [stderr]    |       ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `spiral_order` is never used
[INFO] [stderr]   --> src/matrix/spiral_matrix.rs:55:12
[INFO] [stderr]    |
[INFO] [stderr] 54 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 55 |     pub fn spiral_order(mut matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/matrix/valid_sudoku.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `is_valid_sudoku` is never used
[INFO] [stderr]  --> src/matrix/valid_sudoku.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 4 |     pub fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/stack/evaluate_reverse_polish_notation.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `eval_rpn` is never used
[INFO] [stderr]  --> src/stack/evaluate_reverse_polish_notation.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `MinStack` is never constructed
[INFO] [stderr]  --> src/stack/min_stack.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct MinStack {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stderr]   --> src/stack/min_stack.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | impl MinStack {
[INFO] [stderr]    | ------------- associated items in this implementation
[INFO] [stderr] 13 |     fn new() -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |     fn push(&mut self, val: i32) {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 26 |     fn pop(&mut self) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 31 |     fn top(&self) -> i32 {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 35 |     fn get_min(&self) -> i32 {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/stack/simplify_path.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `simplify_path` is never used
[INFO] [stderr]  --> src/stack/simplify_path.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn simplify_path(path: String) -> String {
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/stack/valid_parentheses.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `is_valid` is never used
[INFO] [stderr]  --> src/stack/valid_parentheses.rs:5:12
[INFO] [stderr]   |
[INFO] [stderr] 4 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 5 |     pub fn is_valid(s: String) -> bool {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode-rs` (lib) generated 247 warnings (run `cargo fix --lib -p leetcode-rs` to apply 4 suggestions)
[INFO] [stderr] warning: `leetcode-rs` (lib test) generated 241 warnings (241 duplicates)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.14s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/leetcode_rs-8bbd829fc9baf1fc)
[INFO] [stderr] error: test failed, to rerun pass `--lib`
[INFO] running `Command { std: "docker" "inspect" "b813d09c0b3b9ba556098238ee99966e31d496dea500f87daa40f25a7bae7dcd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b813d09c0b3b9ba556098238ee99966e31d496dea500f87daa40f25a7bae7dcd", kill_on_drop: false }`
[INFO] [stdout] b813d09c0b3b9ba556098238ee99966e31d496dea500f87daa40f25a7bae7dcd
