[INFO] cloning repository https://github.com/NaizDis/leetcode_rust_assets
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/NaizDis/leetcode_rust_assets" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FNaizDis%2Fleetcode_rust_assets", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FNaizDis%2Fleetcode_rust_assets'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] a5b51d500bc581e5640cfa5246f3e90b0c664e8f
[INFO] checking NaizDis/leetcode_rust_assets/a5b51d500bc581e5640cfa5246f3e90b0c664e8f against try#c387b04bf028733cd561d62128c8a5eee4bc1458+rustflags=-Dtail_expr_drop_order for pr-130930
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FNaizDis%2Fleetcode_rust_assets" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/NaizDis/leetcode_rust_assets on toolchain c387b04bf028733cd561d62128c8a5eee4bc1458
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+c387b04bf028733cd561d62128c8a5eee4bc1458" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/NaizDis/leetcode_rust_assets
[INFO] finished tweaking git repo https://github.com/NaizDis/leetcode_rust_assets
[INFO] tweaked toml for git repo https://github.com/NaizDis/leetcode_rust_assets written to /workspace/builds/worker-6-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/NaizDis/leetcode_rust_assets 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" "+c387b04bf028733cd561d62128c8a5eee4bc1458" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:6252d7ea7fb8caaf7af6d800c5fb250a9cd862b9a7f9508afb3c54fa7fe1102e" "/opt/rustwide/cargo-home/bin/cargo" "+c387b04bf028733cd561d62128c8a5eee4bc1458" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] b89ed07c1c93d8b432e2b271fee587b8051baa41284a837d37969c96e67d5212
[INFO] running `Command { std: "docker" "start" "-a" "b89ed07c1c93d8b432e2b271fee587b8051baa41284a837d37969c96e67d5212", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "b89ed07c1c93d8b432e2b271fee587b8051baa41284a837d37969c96e67d5212", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b89ed07c1c93d8b432e2b271fee587b8051baa41284a837d37969c96e67d5212", kill_on_drop: false }`
[INFO] [stdout] b89ed07c1c93d8b432e2b271fee587b8051baa41284a837d37969c96e67d5212
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Dtail_expr_drop_order" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:6252d7ea7fb8caaf7af6d800c5fb250a9cd862b9a7f9508afb3c54fa7fe1102e" "/opt/rustwide/cargo-home/bin/cargo" "+c387b04bf028733cd561d62128c8a5eee4bc1458" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 6836221a050afaba4f620a812dc483bd4dccefb7f952fc30a61a728561ab1dfc
[INFO] running `Command { std: "docker" "start" "-a" "6836221a050afaba4f620a812dc483bd4dccefb7f952fc30a61a728561ab1dfc", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: found module declaration for lib.rs
[INFO] [stdout]  --> src/main.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | mod lib;
[INFO] [stdout]   | ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: lib.rs is the root of this crate's library target
[INFO] [stdout]   = help: to refer to it from other targets, use the library's name as the path
[INFO] [stdout]   = note: `#[warn(special_module_name)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::linklist::middle_node`
[INFO] [stdout]  --> src/lib/binary_search.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::linklist::middle_node;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::process::Output`
[INFO] [stdout]  --> src/lib/linklist.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::process::Output;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BitOrAssign`, `Deref`, `collections::HashSet`, `str::FromStr`, and `string`
[INFO] [stdout]   --> src/lib/recursive_backtracking.rs:44:5
[INFO] [stdout]    |
[INFO] [stdout] 44 |     collections::HashSet,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 45 |     ops::{BitOrAssign, Deref},
[INFO] [stdout]    |           ^^^^^^^^^^^  ^^^^^
[INFO] [stdout] 46 |     str::FromStr,
[INFO] [stdout]    |     ^^^^^^^^^^^^
[INFO] [stdout] 47 |     string, usize,
[INFO] [stdout]    |     ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `num`
[INFO] [stdout]  --> src/lib/sliding_win.rs:2:19
[INFO] [stdout]   |
[INFO] [stdout] 2 |     collections::{HashMap, HashSet},
[INFO] [stdout]   |                   ^^^^^^^
[INFO] [stdout] 3 |     num,
[INFO] [stdout]   |     ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::num::NonZero`
[INFO] [stdout]   --> src/lib/trees.rs:21:5
[INFO] [stdout]    |
[INFO] [stdout] 21 | use std::num::NonZero;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::stack`
[INFO] [stdout]   --> src/lib/trees.rs:25:5
[INFO] [stdout]    |
[INFO] [stdout] 25 | use super::stack;
[INFO] [stdout]    |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `cmp::Ordering` and `ops::RangeBounds`
[INFO] [stdout]  --> src/lib/two_pointer.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 |     cmp::Ordering,
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 3 |     collections::{HashMap, HashSet},
[INFO] [stdout] 4 |     ops::RangeBounds,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `chosen_one_dcode`, `death_note_dcode`, `master_magic_dcode`, `paint_wall_dcode`, and `rnd_file_dcode`
[INFO] [stdout]  --> src/main.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 |     chosen_one_dcode, death_note_dcode, master_magic_dcode, paint_wall_dcode, rnd_file_dcode,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `combine`
[INFO] [stdout]  --> src/main.rs:5:35
[INFO] [stdout]   |
[INFO] [stdout] 5 | use lib::recursive_backtracking::{combine, generate_parenthesis};
[INFO] [stdout]   |                                   ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::BinaryHeap`
[INFO] [stdout]  --> src/main.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::BinaryHeap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: found module declaration for lib.rs
[INFO] [stdout]  --> src/main.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | mod lib;
[INFO] [stdout]   | ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: lib.rs is the root of this crate's library target
[INFO] [stdout]   = help: to refer to it from other targets, use the library's name as the path
[INFO] [stdout]   = note: `#[warn(special_module_name)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::linklist::middle_node`
[INFO] [stdout]  --> src/lib/binary_search.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::linklist::middle_node;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::process::Output`
[INFO] [stdout]  --> src/lib/linklist.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::process::Output;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BitOrAssign`, `Deref`, `collections::HashSet`, `str::FromStr`, and `string`
[INFO] [stdout]   --> src/lib/recursive_backtracking.rs:44:5
[INFO] [stdout]    |
[INFO] [stdout] 44 |     collections::HashSet,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 45 |     ops::{BitOrAssign, Deref},
[INFO] [stdout]    |           ^^^^^^^^^^^  ^^^^^
[INFO] [stdout] 46 |     str::FromStr,
[INFO] [stdout]    |     ^^^^^^^^^^^^
[INFO] [stdout] 47 |     string, usize,
[INFO] [stdout]    |     ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `num`
[INFO] [stdout]  --> src/lib/sliding_win.rs:2:19
[INFO] [stdout]   |
[INFO] [stdout] 2 |     collections::{HashMap, HashSet},
[INFO] [stdout]   |                   ^^^^^^^
[INFO] [stdout] 3 |     num,
[INFO] [stdout]   |     ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::num::NonZero`
[INFO] [stdout]   --> src/lib/trees.rs:21:5
[INFO] [stdout]    |
[INFO] [stdout] 21 | use std::num::NonZero;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::stack`
[INFO] [stdout]   --> src/lib/trees.rs:25:5
[INFO] [stdout]    |
[INFO] [stdout] 25 | use super::stack;
[INFO] [stdout]    |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `cmp::Ordering` and `ops::RangeBounds`
[INFO] [stdout]  --> src/lib/two_pointer.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 |     cmp::Ordering,
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 3 |     collections::{HashMap, HashSet},
[INFO] [stdout] 4 |     ops::RangeBounds,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `chosen_one_dcode`, `death_note_dcode`, `master_magic_dcode`, `paint_wall_dcode`, and `rnd_file_dcode`
[INFO] [stdout]  --> src/main.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 |     chosen_one_dcode, death_note_dcode, master_magic_dcode, paint_wall_dcode, rnd_file_dcode,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `combine`
[INFO] [stdout]  --> src/main.rs:5:35
[INFO] [stdout]   |
[INFO] [stdout] 5 | use lib::recursive_backtracking::{combine, generate_parenthesis};
[INFO] [stdout]   |                                   ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::BinaryHeap`
[INFO] [stdout]  --> src/main.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::BinaryHeap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]    --> src/lib/array_strings.rs:267:27
[INFO] [stdout]     |
[INFO] [stdout] 267 | pub fn master_magic_dcode(n: i32, x: i32, y: i32, diff: Vec<i32>) -> i32 {
[INFO] [stdout]     |                           ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `m` is never read
[INFO] [stdout]   --> src/lib/binary_search.rs:79:13
[INFO] [stdout]    |
[INFO] [stdout] 79 |     let mut m = 0;
[INFO] [stdout]    |             ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `m` is never read
[INFO] [stdout]   --> src/lib/binary_search.rs:94:13
[INFO] [stdout]    |
[INFO] [stdout] 94 |     let mut m = 0;
[INFO] [stdout]    |             ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]    --> src/lib/array_strings.rs:267:27
[INFO] [stdout]     |
[INFO] [stdout] 267 | pub fn master_magic_dcode(n: i32, x: i32, y: i32, diff: Vec<i32>) -> i32 {
[INFO] [stdout]     |                           ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/lib/binary_search.rs:107:9
[INFO] [stdout]     |
[INFO] [stdout] 107 |     let mut start: i32;
[INFO] [stdout]     |         ----^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `m` is never read
[INFO] [stdout]   --> src/lib/binary_search.rs:79:13
[INFO] [stdout]    |
[INFO] [stdout] 79 |     let mut m = 0;
[INFO] [stdout]    |             ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/lib/binary_search.rs:108:9
[INFO] [stdout]     |
[INFO] [stdout] 108 |     let mut end: i32;
[INFO] [stdout]     |         ----^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `m` is never read
[INFO] [stdout]   --> src/lib/binary_search.rs:94:13
[INFO] [stdout]    |
[INFO] [stdout] 94 |     let mut m = 0;
[INFO] [stdout]    |             ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `m` is never read
[INFO] [stdout]    --> src/lib/binary_search.rs:163:13
[INFO] [stdout]     |
[INFO] [stdout] 163 |     let mut m = -1;
[INFO] [stdout]     |             ^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/lib/binary_search.rs:107:9
[INFO] [stdout]     |
[INFO] [stdout] 107 |     let mut start: i32;
[INFO] [stdout]     |         ----^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/lib/binary_search.rs:108:9
[INFO] [stdout]     |
[INFO] [stdout] 108 |     let mut end: i32;
[INFO] [stdout]     |         ----^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `m` is never read
[INFO] [stdout]    --> src/lib/binary_search.rs:163:13
[INFO] [stdout]     |
[INFO] [stdout] 163 |     let mut m = -1;
[INFO] [stdout]     |             ^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `res`
[INFO] [stdout]   --> src/lib/hashmap.rs:66:13
[INFO] [stdout]    |
[INFO] [stdout] 66 |     let mut res: Vec<i32> = vec![];
[INFO] [stdout]    |             ^^^ help: if this is intentional, prefix it with an underscore: `_res`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `res`
[INFO] [stdout]   --> src/lib/hashmap.rs:66:13
[INFO] [stdout]    |
[INFO] [stdout] 66 |     let mut res: Vec<i32> = vec![];
[INFO] [stdout]    |             ^^^ help: if this is intentional, prefix it with an underscore: `_res`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/lib/hashmap.rs:66:9
[INFO] [stdout]    |
[INFO] [stdout] 66 |     let mut res: Vec<i32> = vec![];
[INFO] [stdout]    |         ----^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/lib/hashmap.rs:66:9
[INFO] [stdout]    |
[INFO] [stdout] 66 |     let mut res: Vec<i32> = vec![];
[INFO] [stdout]    |         ----^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `choice`
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:156:9
[INFO] [stdout]     |
[INFO] [stdout] 156 |     let choice = vec!['(', ')'];
[INFO] [stdout]     |         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_choice`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `choice`
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:156:9
[INFO] [stdout]     |
[INFO] [stdout] 156 |     let choice = vec!['(', ')'];
[INFO] [stdout]     |         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_choice`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/lib/two_pointer.rs:7:23
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn sorted_squares(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                       ----^^^^
[INFO] [stdout]   |                       |
[INFO] [stdout]   |                       help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/lib/two_pointer.rs:91:17
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub fn max_area(mut height: Vec<i32>) -> i32 {
[INFO] [stdout]    |                 ----^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/lib/two_pointer.rs:7:23
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn sorted_squares(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                       ----^^^^
[INFO] [stdout]   |                       |
[INFO] [stdout]   |                       help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_alternately` is never used
[INFO] [stdout]  --> src/lib/array_strings.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn merge_alternately(word1: String, word2: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `roman_to_int` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subsequence` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:54:8
[INFO] [stdout]    |
[INFO] [stdout] 54 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_prefix` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:70:8
[INFO] [stdout]    |
[INFO] [stdout] 70 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `summary_ranges` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:88:8
[INFO] [stdout]    |
[INFO] [stdout] 88 | pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `product_except_self` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:106:8
[INFO] [stdout]     |
[INFO] [stdout] 106 | pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:125:8
[INFO] [stdout]     |
[INFO] [stdout] 125 | pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_closest_number` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:147:8
[INFO] [stdout]     |
[INFO] [stdout] 147 | pub fn find_closest_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `spiral_order` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:157:8
[INFO] [stdout]     |
[INFO] [stdout] 157 | pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:222:8
[INFO] [stdout]     |
[INFO] [stdout] 222 | pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `larg_arith_sub` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:235:8
[INFO] [stdout]     |
[INFO] [stdout] 235 | pub fn larg_arith_sub(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:248:8
[INFO] [stdout]     |
[INFO] [stdout] 248 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:260:8
[INFO] [stdout]     |
[INFO] [stdout] 260 | pub fn fib(n: i32) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `master_magic_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:267:8
[INFO] [stdout]     |
[INFO] [stdout] 267 | pub fn master_magic_dcode(n: i32, x: i32, y: i32, diff: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rnd_file_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:277:8
[INFO] [stdout]     |
[INFO] [stdout] 277 | pub fn rnd_file_dcode(nums: Vec<i32>) -> (i32, i32) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `chosen_one_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:303:8
[INFO] [stdout]     |
[INFO] [stdout] 303 | pub fn chosen_one_dcode(strr: String) -> char {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `paint_wall_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:313:8
[INFO] [stdout]     |
[INFO] [stdout] 313 | pub fn paint_wall_dcode(strr: String) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `death_note_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:336:8
[INFO] [stdout]     |
[INFO] [stdout] 336 | pub fn death_note_dcode(l: i32, r: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/lib/binary_search.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_perfect_square` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn is_perfect_square(num: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:56:8
[INFO] [stdout]    |
[INFO] [stdout] 56 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:77:8
[INFO] [stdout]    |
[INFO] [stdout] 77 | pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_rot` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:92:8
[INFO] [stdout]    |
[INFO] [stdout] 92 | pub fn search_rot(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_eating_speed` is never used
[INFO] [stdout]    --> src/lib/binary_search.rs:137:8
[INFO] [stdout]     |
[INFO] [stdout] 137 | pub fn min_eating_speed(piles: Vec<i32>, h: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_test` is never used
[INFO] [stdout]    --> src/lib/binary_search.rs:151:8
[INFO] [stdout]     |
[INFO] [stdout] 151 | pub fn k_test(pp: &Vec<i32>, hr: i32, k: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `my_sqrt` is never used
[INFO] [stdout]    --> src/lib/binary_search.rs:158:8
[INFO] [stdout]     |
[INFO] [stdout] 158 | pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_jewels_in_stones` is never used
[INFO] [stdout]  --> src/lib/hashmap.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_duplicate` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/lib/two_pointer.rs:91:17
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub fn max_area(mut height: Vec<i32>) -> i32 {
[INFO] [stdout]    |                 ----^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_construct` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_anagram` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_number_of_balloons` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn max_number_of_balloons(text: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:65:8
[INFO] [stdout]    |
[INFO] [stdout] 65 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:76:8
[INFO] [stdout]    |
[INFO] [stdout] 76 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `majority_element` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:85:8
[INFO] [stdout]    |
[INFO] [stdout] 85 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_consecutive` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:99:8
[INFO] [stdout]    |
[INFO] [stdout] 99 | pub fn longest_consecutive(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_consecutive2` is never used
[INFO] [stdout]    --> src/lib/hashmap.rs:121:8
[INFO] [stdout]     |
[INFO] [stdout] 121 | pub fn longest_consecutive2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `last_stone_weight` is never used
[INFO] [stdout]  --> src/lib/heaps.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn last_stone_weight(stones: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_kth_largest` is never used
[INFO] [stdout]   --> src/lib/heaps.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent` is never used
[INFO] [stdout]   --> src/lib/heaps.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_closest` is never used
[INFO] [stdout]   --> src/lib/heaps.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 | pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_duplicates` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn merge_two_lists(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `middle_node` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | pub fn middle_node(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets` is never used
[INFO] [stdout]  --> src/lib/recursive_backtracking.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `permute` is never used
[INFO] [stdout]   --> src/lib/recursive_backtracking.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combine` is never used
[INFO] [stdout]   --> src/lib/recursive_backtracking.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum` is never used
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:101:8
[INFO] [stdout]     |
[INFO] [stdout] 101 | pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations` is never used
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:131:8
[INFO] [stdout]     |
[INFO] [stdout] 131 | pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exist` is never used
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:177:8
[INFO] [stdout]     |
[INFO] [stdout] 177 | pub fn exist(mut board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_max_average` is never used
[INFO] [stdout]  --> src/lib/sliding_win.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn find_max_average(nums: Vec<i32>, k: i32) -> f64 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_ones` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn longest_ones(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:56:8
[INFO] [stdout]    |
[INFO] [stdout] 56 | pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_alternately` is never used
[INFO] [stdout]  --> src/lib/array_strings.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn merge_alternately(word1: String, word2: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `character_replacement` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:73:8
[INFO] [stdout]    |
[INFO] [stdout] 73 | pub fn character_replacement(s: String, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `roman_to_int` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_sub_array_len` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:88:8
[INFO] [stdout]    |
[INFO] [stdout] 88 | pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subsequence` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_inclusion` is never used
[INFO] [stdout]    --> src/lib/sliding_win.rs:107:8
[INFO] [stdout]     |
[INFO] [stdout] 107 | pub fn check_inclusion(s1: String, s2: String) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_points` is never used
[INFO] [stdout]  --> src/lib/stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn cal_points(operations: Vec<String>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:54:8
[INFO] [stdout]    |
[INFO] [stdout] 54 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_prefix` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:70:8
[INFO] [stdout]    |
[INFO] [stdout] 70 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid` is never used
[INFO] [stdout]   --> src/lib/stack.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `summary_ranges` is never used
[INFO] [stdout]   --> src/lib/array_strings.rs:88:8
[INFO] [stdout]    |
[INFO] [stdout] 88 | pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `product_except_self` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:106:8
[INFO] [stdout]     |
[INFO] [stdout] 106 | pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `eval_rpn` is never used
[INFO] [stdout]   --> src/lib/stack.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `daily_temperatures` is never used
[INFO] [stdout]   --> src/lib/stack.rs:82:8
[INFO] [stdout]    |
[INFO] [stdout] 82 | pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:125:8
[INFO] [stdout]     |
[INFO] [stdout] 125 | pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]    --> src/lib/stack.rs:111:8
[INFO] [stdout]     |
[INFO] [stdout] 111 | struct MinStack {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_closest_number` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:147:8
[INFO] [stdout]     |
[INFO] [stdout] 147 | pub fn find_closest_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `spiral_order` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:157:8
[INFO] [stdout]     |
[INFO] [stdout] 157 | pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]    --> src/lib/stack.rs:121:8
[INFO] [stdout]     |
[INFO] [stdout] 120 | impl MinStack {
[INFO] [stdout]     | ------------- associated items in this implementation
[INFO] [stdout] 121 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 128 |     fn push(&mut self, val: i32) {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 139 |     fn pop(&mut self) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 144 |     fn top(&self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 148 |     fn get_min(&self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:222:8
[INFO] [stdout]     |
[INFO] [stdout] 222 | pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/lib/trees.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: function `larg_arith_sub` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:235:8
[INFO] [stdout]     |
[INFO] [stdout] 235 | pub fn larg_arith_sub(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `TreeLink` is never used
[INFO] [stdout]   --> src/lib/trees.rs:26:6
[INFO] [stdout]    |
[INFO] [stdout] 26 | type TreeLink = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `invert_tree` is never used
[INFO] [stdout]   --> src/lib/trees.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_depth` is never used
[INFO] [stdout]   --> src/lib/trees.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:248:8
[INFO] [stdout]     |
[INFO] [stdout] 248 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_balanced` is never used
[INFO] [stdout]   --> src/lib/trees.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diameter_of_binary_tree` is never used
[INFO] [stdout]   --> src/lib/trees.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 | pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_same_tree` is never used
[INFO] [stdout]   --> src/lib/trees.rs:89:8
[INFO] [stdout]    |
[INFO] [stdout] 89 | pub fn is_same_tree(p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_symmetric` is never used
[INFO] [stdout]    --> src/lib/trees.rs:105:8
[INFO] [stdout]     |
[INFO] [stdout] 105 | pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:260:8
[INFO] [stdout]     |
[INFO] [stdout] 260 | pub fn fib(n: i32) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_path_sum` is never used
[INFO] [stdout]    --> src/lib/trees.rs:121:8
[INFO] [stdout]     |
[INFO] [stdout] 121 | pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, sum: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subtree` is never used
[INFO] [stdout]    --> src/lib/trees.rs:132:8
[INFO] [stdout]     |
[INFO] [stdout] 132 | pub fn is_subtree(
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `level_order` is never used
[INFO] [stdout]    --> src/lib/trees.rs:147:8
[INFO] [stdout]     |
[INFO] [stdout] 147 | pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `master_magic_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:267:8
[INFO] [stdout]     |
[INFO] [stdout] 267 | pub fn master_magic_dcode(n: i32, x: i32, y: i32, diff: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `kth_smallest` is never used
[INFO] [stdout]    --> src/lib/trees.rs:173:8
[INFO] [stdout]     |
[INFO] [stdout] 173 | pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_minimum_difference` is never used
[INFO] [stdout]    --> src/lib/trees.rs:186:8
[INFO] [stdout]     |
[INFO] [stdout] 186 | pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rnd_file_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:277:8
[INFO] [stdout]     |
[INFO] [stdout] 277 | pub fn rnd_file_dcode(nums: Vec<i32>) -> (i32, i32) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_bst` is never used
[INFO] [stdout]    --> src/lib/trees.rs:203:8
[INFO] [stdout]     |
[INFO] [stdout] 203 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor` is never used
[INFO] [stdout]    --> src/lib/trees.rs:218:8
[INFO] [stdout]     |
[INFO] [stdout] 218 | pub fn lowest_common_ancestor(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `chosen_one_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:303:8
[INFO] [stdout]     |
[INFO] [stdout] 303 | pub fn chosen_one_dcode(strr: String) -> char {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]    --> src/lib/trees.rs:240:8
[INFO] [stdout]     |
[INFO] [stdout] 240 | struct Trie {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `Trie` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `paint_wall_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:313:8
[INFO] [stdout]     |
[INFO] [stdout] 313 | pub fn paint_wall_dcode(strr: String) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `death_note_dcode` is never used
[INFO] [stdout]    --> src/lib/array_strings.rs:336:8
[INFO] [stdout]     |
[INFO] [stdout] 336 | pub fn death_note_dcode(l: i32, r: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `get`, `search`, and `starts_with` are never used
[INFO] [stdout]    --> src/lib/trees.rs:246:8
[INFO] [stdout]     |
[INFO] [stdout] 245 | impl Trie {
[INFO] [stdout]     | --------- associated items in this implementation
[INFO] [stdout] 246 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 250 |     fn insert(&mut self, word: String) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 256 |     fn get(&self, word: String) -> Option<&Trie> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 260 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 264 |     fn starts_with(&self, prefix: String) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sorted_squares` is never used
[INFO] [stdout]  --> src/lib/two_pointer.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn sorted_squares(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/lib/binary_search.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_string` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn is_palindrome(mut s: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:65:8
[INFO] [stdout]    |
[INFO] [stdout] 65 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:91:8
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub fn max_area(mut height: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_perfect_square` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn is_perfect_square(num: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `trap` is never used
[INFO] [stdout]    --> src/lib/two_pointer.rs:113:8
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn trap(height: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:56:8
[INFO] [stdout]    |
[INFO] [stdout] 56 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:77:8
[INFO] [stdout]    |
[INFO] [stdout] 77 | pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_rot` is never used
[INFO] [stdout]   --> src/lib/binary_search.rs:92:8
[INFO] [stdout]    |
[INFO] [stdout] 92 | pub fn search_rot(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_eating_speed` is never used
[INFO] [stdout]    --> src/lib/binary_search.rs:137:8
[INFO] [stdout]     |
[INFO] [stdout] 137 | pub fn min_eating_speed(piles: Vec<i32>, h: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_test` is never used
[INFO] [stdout]    --> src/lib/binary_search.rs:151:8
[INFO] [stdout]     |
[INFO] [stdout] 151 | pub fn k_test(pp: &Vec<i32>, hr: i32, k: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `my_sqrt` is never used
[INFO] [stdout]    --> src/lib/binary_search.rs:158:8
[INFO] [stdout]     |
[INFO] [stdout] 158 | pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_jewels_in_stones` is never used
[INFO] [stdout]  --> src/lib/hashmap.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_duplicate` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_construct` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_anagram` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_number_of_balloons` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn max_number_of_balloons(text: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:65:8
[INFO] [stdout]    |
[INFO] [stdout] 65 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:76:8
[INFO] [stdout]    |
[INFO] [stdout] 76 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `majority_element` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:85:8
[INFO] [stdout]    |
[INFO] [stdout] 85 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_consecutive` is never used
[INFO] [stdout]   --> src/lib/hashmap.rs:99:8
[INFO] [stdout]    |
[INFO] [stdout] 99 | pub fn longest_consecutive(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_consecutive2` is never used
[INFO] [stdout]    --> src/lib/hashmap.rs:121:8
[INFO] [stdout]     |
[INFO] [stdout] 121 | pub fn longest_consecutive2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `last_stone_weight` is never used
[INFO] [stdout]  --> src/lib/heaps.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn last_stone_weight(stones: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_kth_largest` is never used
[INFO] [stdout]   --> src/lib/heaps.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent` is never used
[INFO] [stdout]   --> src/lib/heaps.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_closest` is never used
[INFO] [stdout]   --> src/lib/heaps.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 | pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_duplicates` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn merge_two_lists(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `middle_node` is never used
[INFO] [stdout]   --> src/lib/linklist.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | pub fn middle_node(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets` is never used
[INFO] [stdout]  --> src/lib/recursive_backtracking.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `permute` is never used
[INFO] [stdout]   --> src/lib/recursive_backtracking.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combine` is never used
[INFO] [stdout]   --> src/lib/recursive_backtracking.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum` is never used
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:101:8
[INFO] [stdout]     |
[INFO] [stdout] 101 | pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations` is never used
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:131:8
[INFO] [stdout]     |
[INFO] [stdout] 131 | pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exist` is never used
[INFO] [stdout]    --> src/lib/recursive_backtracking.rs:177:8
[INFO] [stdout]     |
[INFO] [stdout] 177 | pub fn exist(mut board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_max_average` is never used
[INFO] [stdout]  --> src/lib/sliding_win.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn find_max_average(nums: Vec<i32>, k: i32) -> f64 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_ones` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn longest_ones(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:56:8
[INFO] [stdout]    |
[INFO] [stdout] 56 | pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `character_replacement` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:73:8
[INFO] [stdout]    |
[INFO] [stdout] 73 | pub fn character_replacement(s: String, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_sub_array_len` is never used
[INFO] [stdout]   --> src/lib/sliding_win.rs:88:8
[INFO] [stdout]    |
[INFO] [stdout] 88 | pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_inclusion` is never used
[INFO] [stdout]    --> src/lib/sliding_win.rs:107:8
[INFO] [stdout]     |
[INFO] [stdout] 107 | pub fn check_inclusion(s1: String, s2: String) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_points` is never used
[INFO] [stdout]  --> src/lib/stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn cal_points(operations: Vec<String>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid` is never used
[INFO] [stdout]   --> src/lib/stack.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `eval_rpn` is never used
[INFO] [stdout]   --> src/lib/stack.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `daily_temperatures` is never used
[INFO] [stdout]   --> src/lib/stack.rs:82:8
[INFO] [stdout]    |
[INFO] [stdout] 82 | pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]    --> src/lib/stack.rs:111:8
[INFO] [stdout]     |
[INFO] [stdout] 111 | 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/lib/stack.rs:121:8
[INFO] [stdout]     |
[INFO] [stdout] 120 | impl MinStack {
[INFO] [stdout]     | ------------- associated items in this implementation
[INFO] [stdout] 121 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 128 |     fn push(&mut self, val: i32) {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 139 |     fn pop(&mut self) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 144 |     fn top(&self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 148 |     fn get_min(&self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/lib/trees.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: type alias `TreeLink` is never used
[INFO] [stdout]   --> src/lib/trees.rs:26:6
[INFO] [stdout]    |
[INFO] [stdout] 26 | type TreeLink = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `invert_tree` is never used
[INFO] [stdout]   --> src/lib/trees.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_depth` is never used
[INFO] [stdout]   --> src/lib/trees.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_balanced` is never used
[INFO] [stdout]   --> src/lib/trees.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diameter_of_binary_tree` is never used
[INFO] [stdout]   --> src/lib/trees.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 | pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_same_tree` is never used
[INFO] [stdout]   --> src/lib/trees.rs:89:8
[INFO] [stdout]    |
[INFO] [stdout] 89 | pub fn is_same_tree(p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_symmetric` is never used
[INFO] [stdout]    --> src/lib/trees.rs:105:8
[INFO] [stdout]     |
[INFO] [stdout] 105 | pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_path_sum` is never used
[INFO] [stdout]    --> src/lib/trees.rs:121:8
[INFO] [stdout]     |
[INFO] [stdout] 121 | pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, sum: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subtree` is never used
[INFO] [stdout]    --> src/lib/trees.rs:132:8
[INFO] [stdout]     |
[INFO] [stdout] 132 | pub fn is_subtree(
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `level_order` is never used
[INFO] [stdout]    --> src/lib/trees.rs:147:8
[INFO] [stdout]     |
[INFO] [stdout] 147 | pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `kth_smallest` is never used
[INFO] [stdout]    --> src/lib/trees.rs:173:8
[INFO] [stdout]     |
[INFO] [stdout] 173 | pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_minimum_difference` is never used
[INFO] [stdout]    --> src/lib/trees.rs:186:8
[INFO] [stdout]     |
[INFO] [stdout] 186 | pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_bst` is never used
[INFO] [stdout]    --> src/lib/trees.rs:203:8
[INFO] [stdout]     |
[INFO] [stdout] 203 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor` is never used
[INFO] [stdout]    --> src/lib/trees.rs:218:8
[INFO] [stdout]     |
[INFO] [stdout] 218 | pub fn lowest_common_ancestor(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]    --> src/lib/trees.rs:240:8
[INFO] [stdout]     |
[INFO] [stdout] 240 | struct Trie {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `Trie` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `get`, `search`, and `starts_with` are never used
[INFO] [stdout]    --> src/lib/trees.rs:246:8
[INFO] [stdout]     |
[INFO] [stdout] 245 | impl Trie {
[INFO] [stdout]     | --------- associated items in this implementation
[INFO] [stdout] 246 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 250 |     fn insert(&mut self, word: String) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 256 |     fn get(&self, word: String) -> Option<&Trie> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 260 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 264 |     fn starts_with(&self, prefix: String) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sorted_squares` is never used
[INFO] [stdout]  --> src/lib/two_pointer.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn sorted_squares(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_string` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn is_palindrome(mut s: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:65:8
[INFO] [stdout]    |
[INFO] [stdout] 65 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area` is never used
[INFO] [stdout]   --> src/lib/two_pointer.rs:91:8
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub fn max_area(mut height: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `trap` is never used
[INFO] [stdout]    --> src/lib/two_pointer.rs:113:8
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn trap(height: Vec<i32>) -> i32 {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 111 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 111 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.43s
[INFO] running `Command { std: "docker" "inspect" "6836221a050afaba4f620a812dc483bd4dccefb7f952fc30a61a728561ab1dfc", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6836221a050afaba4f620a812dc483bd4dccefb7f952fc30a61a728561ab1dfc", kill_on_drop: false }`
[INFO] [stdout] 6836221a050afaba4f620a812dc483bd4dccefb7f952fc30a61a728561ab1dfc