[INFO] cloning repository https://github.com/Yogaflre/leetcode
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Yogaflre/leetcode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYogaflre%2Fleetcode", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYogaflre%2Fleetcode'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] d0c81ee22efb931a407b3cd8827ef41cb6aca4be
[INFO] building Yogaflre/leetcode against try#b8e88e5ddf5521a9f43ee3f62a702388c713e4bb for pr-155114
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYogaflre%2Fleetcode" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/Yogaflre/leetcode
[INFO] finished tweaking git repo https://github.com/Yogaflre/leetcode
[INFO] tweaked toml for git repo https://github.com/Yogaflre/leetcode written to /workspace/builds/worker-2-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/Yogaflre/leetcode on toolchain b8e88e5ddf5521a9f43ee3f62a702388c713e4bb
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/Yogaflre/leetcode 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" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 0ddfaf963684fdbcbb1351f06b682fc37814b50fbf28f19b37e38f618ae5a672
[INFO] running `Command { std: "docker" "start" "-a" "0ddfaf963684fdbcbb1351f06b682fc37814b50fbf28f19b37e38f618ae5a672", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "0ddfaf963684fdbcbb1351f06b682fc37814b50fbf28f19b37e38f618ae5a672", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0ddfaf963684fdbcbb1351f06b682fc37814b50fbf28f19b37e38f618ae5a672", kill_on_drop: false }`
[INFO] [stdout] 0ddfaf963684fdbcbb1351f06b682fc37814b50fbf28f19b37e38f618ae5a672
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 3a4160e38a58346958291c2e5c515e9ec5d41fb173cbb8074fbc56860d38de29
[INFO] running `Command { std: "docker" "start" "-a" "3a4160e38a58346958291c2e5c515e9ec5d41fb173cbb8074fbc56860d38de29", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/hard/longest_valid_parentheses.rs:38:53
[INFO] [stdout]    |
[INFO] [stdout] 38 |                     sum = max(sum, i as i32 - stack[(stack.len() - 1)]);
[INFO] [stdout]    |                                                     ^               ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 38 -                     sum = max(sum, i as i32 - stack[(stack.len() - 1)]);
[INFO] [stdout] 38 +                     sum = max(sum, i as i32 - stack[stack.len() - 1]);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `matrix`
[INFO] [stdout]   --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:39
[INFO] [stdout]    |
[INFO] [stdout] 25 |     pub fn kth_smallest_binary_search(matrix: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]    |                                       ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:62
[INFO] [stdout]    |
[INFO] [stdout] 25 |     pub fn kth_smallest_binary_search(matrix: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]    |                                                              ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `mains`
[INFO] [stdout]    --> src/base/matchs.rs:106:16
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                ^^^^^ help: if this is intentional, prefix it with an underscore: `_mains`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `aims`
[INFO] [stdout]    --> src/base/matchs.rs:106:35
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                                   ^^^^ help: if this is intentional, prefix it with an underscore: `_aims`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]    --> src/base/matchs.rs:106:53
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                                                     ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `j`
[INFO] [stdout]    --> src/base/matchs.rs:106:63
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                                                               ^ help: if this is intentional, prefix it with an underscore: `_j`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `a`
[INFO] [stdout]    --> src/base/matchs.rs:117:8
[INFO] [stdout]     |
[INFO] [stdout] 117 | fn kmp(a: &str, b: &str) -> bool {
[INFO] [stdout]     |        ^ help: if this is intentional, prefix it with an underscore: `_a`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `b`
[INFO] [stdout]    --> src/base/matchs.rs:117:17
[INFO] [stdout]     |
[INFO] [stdout] 117 | fn kmp(a: &str, b: &str) -> bool {
[INFO] [stdout]     |                 ^ help: if this is intentional, prefix it with an underscore: `_b`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/bit/reverse_bits.rs:29:13
[INFO] [stdout]    |
[INFO] [stdout] 29 |         for i in 0..32 {
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]   --> src/bit/total_hamming_distance.rs:26:35
[INFO] [stdout]    |
[INFO] [stdout] 26 |     pub fn total_hamming_distance(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                   ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/geometry/k_closest_points_to_origin.rs:29:14
[INFO] [stdout]    |
[INFO] [stdout] 29 |         for (i, point) in points.into_iter().enumerate() {
[INFO] [stdout]    |              ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `graph`
[INFO] [stdout]   --> src/graph/is_graph_bipartite.rs:37:25
[INFO] [stdout]    |
[INFO] [stdout] 37 |     pub fn is_bipartite(graph: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `graph`
[INFO] [stdout]   --> src/graph/sequence_reconstruction.rs:26:9
[INFO] [stdout]    |
[INFO] [stdout] 26 |         graph: &HashMap<i32, HashSet<i32>>,
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `flags`
[INFO] [stdout]   --> src/graph/sequence_reconstruction.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |         flags: &mut HashMap<i32, i32>,
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_flags`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]   --> src/graph/sequence_reconstruction.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |         let target = org[o_index];
[INFO] [stdout]    |             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `heights`
[INFO] [stdout]   --> src/hard/largest_rectangle_in_histogram.rs:18:35
[INFO] [stdout]    |
[INFO] [stdout] 18 |     pub fn largest_rectangle_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                   ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_heights`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:56:21
[INFO] [stdout]    |
[INFO] [stdout] 56 |                 let mut tmp = j;
[INFO] [stdout]    |                     ----^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `tmp`
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:56:21
[INFO] [stdout]    |
[INFO] [stdout] 56 |                 let mut tmp = j;
[INFO] [stdout]    |                     ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_tmp`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `l` is never read
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:51:21
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let mut l = i;
[INFO] [stdout]    |                     ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 55 |                 l = a;
[INFO] [stdout]    |                 ----- `l` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/hard/regular_expression_matching.rs:58:27
[INFO] [stdout]    |
[INFO] [stdout] 58 |     fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool {
[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/hard/regular_expression_matching.rs:58:54
[INFO] [stdout]    |
[INFO] [stdout] 58 |     fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool {
[INFO] [stdout]    |                                                      ----^^
[INFO] [stdout]    |                                                      |
[INFO] [stdout]    |                                                      help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/hash/longest_harmonious_subsequence.rs:41:17
[INFO] [stdout]    |
[INFO] [stdout] 41 |         for (k, v) in map.iter() {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:21:9
[INFO] [stdout]    |
[INFO] [stdout] 21 |         mut pre: Option<Box<ListNode>>,
[INFO] [stdout]    |         ----^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary `unsafe` block
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:28:9
[INFO] [stdout]    |
[INFO] [stdout] 28 |         unsafe {}
[INFO] [stdout]    |         ^^^^^^ unnecessary `unsafe` block
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_unsafe)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:27:57
[INFO] [stdout]    |
[INFO] [stdout] 27 |     pub fn reverse_k_group(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                                         ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `str`
[INFO] [stdout]   --> src/medium/string_to_integer_atoi.rs:42:20
[INFO] [stdout]    |
[INFO] [stdout] 42 |     pub fn my_atoi(str: String) -> i32 {
[INFO] [stdout]    |                    ^^^ help: if this is intentional, prefix it with an underscore: `_str`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:38:13
[INFO] [stdout]    |
[INFO] [stdout] 38 |         let mut tmp: i32 = 0;
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `tmp`
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:38:13
[INFO] [stdout]    |
[INFO] [stdout] 38 |         let mut tmp: i32 = 0;
[INFO] [stdout]    |             ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_tmp`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `a`
[INFO] [stdout]   --> src/tree/house_robber_iii.rs:73:21
[INFO] [stdout]    |
[INFO] [stdout] 73 |                 let a = node.borrow();
[INFO] [stdout]    |                     ^ help: if this is intentional, prefix it with an underscore: `_a`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/array_nesting.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | 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 `array_nesting` is never used
[INFO] [stdout]   --> src/array/array_nesting.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn array_nesting(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/beautiful_arrangement_ii.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `construct_array` is never used
[INFO] [stdout]   --> src/array/beautiful_arrangement_ii.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn construct_array(n: i32, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/count_primes.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_primes`, `count_primes_sqrt`, and `is_prime` are never used
[INFO] [stdout]   --> src/array/count_primes.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn count_primes(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn count_primes_sqrt(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn is_prime(n: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/degree_of_an_array.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_shortest_sub_array` is never used
[INFO] [stdout]   --> src/array/degree_of_an_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn find_shortest_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/find_the_duplicate_number.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_duplicate` is never used
[INFO] [stdout]   --> src/array/find_the_duplicate_number.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn find_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `kth_smallest_binary_search` and `kth_smallest_heap` are never used
[INFO] [stdout]   --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn kth_smallest_binary_search(matrix: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn kth_smallest_heap(matrix: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/max_chunks_to_make_sorted.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_chunks_to_sorted` is never used
[INFO] [stdout]   --> src/array/max_chunks_to_make_sorted.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn max_chunks_to_sorted(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/max_consecutive_ones.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_max_consecutive_ones` is never used
[INFO] [stdout]   --> src/array/max_consecutive_ones.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     pub fn find_max_consecutive_ones(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/maximum_length_of_repeated_subarray.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_length` and `recu` are never used
[INFO] [stdout]   --> src/array/maximum_length_of_repeated_subarray.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 20 |     pub fn find_length(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn recu(nums1: &Vec<i32>, nums2: &Vec<i32>, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/median_of_two_sorted_arrays.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used
[INFO] [stdout]   --> src/array/median_of_two_sorted_arrays.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/minimum_size_subarray_sum.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_sub_array_len` and `min_sub_array_len_binary_search` are never used
[INFO] [stdout]   --> src/array/minimum_size_subarray_sum.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     pub fn min_sub_array_len_binary_search(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/plus_one.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `plus_one` is never used
[INFO] [stdout]   --> src/array/plus_one.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/reshape_the_matrix.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `matrix_reshape` is never used
[INFO] [stdout]   --> src/array/reshape_the_matrix.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn matrix_reshape(nums: Vec<Vec<i32>>, r: i32, c: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/search_a_2d_matrix_ii.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search_matrix` and `search_matrix2` are never used
[INFO] [stdout]   --> src/array/search_a_2d_matrix_ii.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn search_matrix2(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/set_mismatch.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_error_nums` and `find_error_nums_sort` are never used
[INFO] [stdout]   --> src/array/set_mismatch.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn find_error_nums(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn find_error_nums_sort(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/subarray_product_less_than_k.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_subarray_product_less_than_k` is never used
[INFO] [stdout]   --> src/array/subarray_product_less_than_k.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn num_subarray_product_less_than_k(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/toeplitz_matrix.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_toeplitz_matrix` is never used
[INFO] [stdout]   --> src/array/toeplitz_matrix.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn is_toeplitz_matrix(matrix: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/backtracking/generate_parentheses.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `generate_parenthesis` and `generate` are never used
[INFO] [stdout]   --> src/backtracking/generate_parentheses.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 15 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn generate(res: &mut Vec<String>, tmp: String, l: i32, r: i32) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/backtracking/n_queens.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `solve_n_queens`, `put`, and `is_ok` are never used
[INFO] [stdout]   --> src/backtracking/n_queens.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn solve_n_queens(n: i32) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn put(row: usize, mut items: Vec<usize>, result: &mut Vec<Vec<String>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn is_ok(row: usize, column: usize, items: &Vec<usize>) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/backtracking/n_queens_ii.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `total_n_queens`, `put`, and `is_ok` are never used
[INFO] [stdout]   --> src/backtracking/n_queens_ii.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn total_n_queens(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn put(row: usize, mut items: Vec<usize>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn is_ok(row: usize, column: usize, items: &Vec<usize>) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/backtracking/permutations.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute2` and `recursive` are never used
[INFO] [stdout]   --> src/backtracking/permutations.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn permute2(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn recursive(result: &mut Vec<Vec<i32>>, nums: Vec<i32>, tmp: Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `loop_search` is never used
[INFO] [stdout]  --> src/base/binary_search.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn loop_search(nums: &Vec<i32>, target: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursive_search` is never used
[INFO] [stdout]   --> src/base/binary_search.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn recursive_search(nums: &Vec<i32>, target: i32, left: usize, right: usize) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_first` is never used
[INFO] [stdout]   --> src/base/binary_search.rs:35:4
[INFO] [stdout]    |
[INFO] [stdout] 35 | fn find_first(nums: &Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_end` is never used
[INFO] [stdout]   --> src/base/binary_search.rs:60:4
[INFO] [stdout]    |
[INFO] [stdout] 60 | fn find_end(nums: &Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_first_bigger` is never used
[INFO] [stdout]   --> src/base/binary_search.rs:85:4
[INFO] [stdout]    |
[INFO] [stdout] 85 | fn find_first_bigger(nums: &Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_last_smaller` is never used
[INFO] [stdout]    --> src/base/binary_search.rs:107:4
[INFO] [stdout]     |
[INFO] [stdout] 107 | fn find_last_smaller(nums: &Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]  --> src/base/graph.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Graph {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `create`, `addEdge`, `bfs`, `dfs`, and `dfs_recursive` are never used
[INFO] [stdout]   --> src/base/graph.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Graph {
[INFO] [stdout]    | ---------- associated items in this implementation
[INFO] [stdout] 11 |     pub fn create(n: usize) -> Graph {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn addEdge(&mut self, i: usize, j: usize) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn bfs(&self, i: usize, j: usize) -> Vec<usize> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn dfs(&self, i: usize, j: usize) -> Vec<usize> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn dfs_recursive(&self, i: usize, j: usize, items: &mut Vec<Vec<usize>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `distribute_candy` is never used
[INFO] [stdout]  --> src/base/greedy.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn distribute_candy(mut candies: i32, mut children: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_disjoint_area` is never used
[INFO] [stdout]   --> src/base/greedy.rs:25:4
[INFO] [stdout]    |
[INFO] [stdout] 25 | fn find_disjoint_area(mut areas: Vec<(i32, i32)>) -> Vec<(i32, i32)> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_num` is never used
[INFO] [stdout]   --> src/base/greedy.rs:47:4
[INFO] [stdout]    |
[INFO] [stdout] 47 | fn remove_num(num: u32) -> Vec<u32> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Heap` is never constructed
[INFO] [stdout]  --> src/base/heap.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Heap {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `heapify`, `create`, `insert`, `remove_max`, and `sort` are never used
[INFO] [stdout]   --> src/base/heap.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Heap {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout]  9 |     // 对指定节点进行堆化
[INFO] [stdout] 10 |     fn heapify(nums: &mut Vec<i32>, mut index: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn create(mut nums: Vec<i32>) -> Heap {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn insert(&mut self, num: i32) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn remove_max(&mut self) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78 |     fn sort(&mut self) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `huffman_coding` is never used
[INFO] [stdout]  --> src/base/huffman_coding.rs:6:4
[INFO] [stdout]   |
[INFO] [stdout] 6 | fn huffman_coding(text: String) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `JavaMap` is never constructed
[INFO] [stdout]  --> src/base/java_map.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct JavaMap<K, V>
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/base/java_map.rs:30:8
[INFO] [stdout]     |
[INFO] [stdout]  25 | / impl<K, V> JavaMap<K, V>
[INFO] [stdout]  26 | | where
[INFO] [stdout]  27 | |     K: Eq + Hash + Clone,
[INFO] [stdout]  28 | |     V: Clone,
[INFO] [stdout]     | |_____________- associated items in this implementation
[INFO] [stdout]  29 |   {
[INFO] [stdout]  30 |       fn default() -> JavaMap<K, V> {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  39 |       fn new(capacity: u64) -> JavaMap<K, V> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout]  50 |       fn size(&self) -> u64 {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout]  57 |       fn init_capacity(capacity: u64) -> u64 {
[INFO] [stdout]     |          ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  67 |       fn get_threshold(capacity: u64, load_factor: f32) -> u64 {
[INFO] [stdout]     |          ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  74 |       fn get_index(k: &K, capacity: u64) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  82 |       fn get(&mut self, k: K) -> Option<&V> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout]  94 |       fn put(&mut self, k: K, v: V) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 120 |       fn resize(&mut self) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 133 |       fn remove(&mut self, k: K) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/base/list_node.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new` and `create` are never used
[INFO] [stdout]   --> src/base/list_node.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     pub fn create(nums: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bp` is never used
[INFO] [stdout]  --> src/base/matchs.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn bp(main: &str, aim: &str) -> bool {
[INFO] [stdout]   |    ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rk` is never used
[INFO] [stdout]   --> src/base/matchs.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn rk(main: &str, aim: &str) -> bool {
[INFO] [stdout]    |    ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hash` is never used
[INFO] [stdout]   --> src/base/matchs.rs:49:4
[INFO] [stdout]    |
[INFO] [stdout] 49 | fn hash(text: &str, dict: &HashMap<char, i32>) -> i32 {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bm` is never used
[INFO] [stdout]   --> src/base/matchs.rs:69:4
[INFO] [stdout]    |
[INFO] [stdout] 69 | fn bm(a: &str, b: &str) -> bool {
[INFO] [stdout]    |    ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bad_char` is never used
[INFO] [stdout]   --> src/base/matchs.rs:91:4
[INFO] [stdout]    |
[INFO] [stdout] 91 | fn bad_char(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `good_suffix` is never used
[INFO] [stdout]    --> src/base/matchs.rs:106:4
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `kmp` is never used
[INFO] [stdout]    --> src/base/matchs.rs:117:4
[INFO] [stdout]     |
[INFO] [stdout] 117 | fn kmp(a: &str, b: &str) -> bool {
[INFO] [stdout]     |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/base/tree_node.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new` and `example` are never used
[INFO] [stdout]   --> src/base/tree_node.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl TreeNode {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 15 |     #[inline]
[INFO] [stdout] 16 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn example() -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]  --> src/base/trie.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Trie {
[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:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | 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:22:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     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:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | 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:21:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     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_smallest_letter_greater_than_target.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_greatest_letter` is never used
[INFO] [stdout]   --> src/binary_search/find_smallest_letter_greater_than_target.rs:47:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 47 |     pub fn next_greatest_letter(letters: Vec<char>, target: char) -> char {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_search/nth_digit.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_nth_digit` is never used
[INFO] [stdout]   --> src/binary_search/nth_digit.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 20 |     // FIXME
[INFO] [stdout] 21 |     pub fn find_nth_digit(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_search/powx_n.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `my_pow` is never used
[INFO] [stdout]   --> src/binary_search/powx_n.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn my_pow(x: f64, n: i32) -> f64 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_search/search_insert_position.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | 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:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     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_search/single_element_in_a_sorted_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `single_non_duplicate` and `single_non_duplicate2` are never used
[INFO] [stdout]   --> src/binary_search/single_element_in_a_sorted_array.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn single_non_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn single_non_duplicate2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_search/sqrtx.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `my_sqrt` is never used
[INFO] [stdout]   --> src/binary_search/sqrtx.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/binary_number_with_alternating_bits.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `has_alternating_bits` is never used
[INFO] [stdout]   --> src/bit/binary_number_with_alternating_bits.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn has_alternating_bits(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/counting_bits.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_bits`, `count_bits2`, `count_bits3`, and `count_bits4` are never used
[INFO] [stdout]   --> src/bit/counting_bits.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 25 |     pub fn count_bits(num: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn count_bits2(num: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     pub fn count_bits3(num: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     pub fn count_bits4(num: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/hamming_distance.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `hamming_distance` is never used
[INFO] [stdout]   --> src/bit/hamming_distance.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     pub fn hamming_distance(x: i32, y: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/maximum_product_of_word_lengths.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_product` is never used
[INFO] [stdout]   --> src/bit/maximum_product_of_word_lengths.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn max_product(words: Vec<String>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/missing_number.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `missing_number` is never used
[INFO] [stdout]   --> src/bit/missing_number.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/number_complement.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_complement` is never used
[INFO] [stdout]   --> src/bit/number_complement.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn find_complement(num: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/power_of_four.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_four` is never used
[INFO] [stdout]   --> src/bit/power_of_four.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn is_power_of_four(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/power_of_two.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_two` is never used
[INFO] [stdout]   --> src/bit/power_of_two.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 35 |     pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/reverse_bits.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_bits` is never used
[INFO] [stdout]   --> src/bit/reverse_bits.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn reverse_bits(x: u32) -> u32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/single_number.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]   --> src/bit/single_number.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/single_number_iii.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]   --> src/bit/single_number_iii.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/sum_of_two_integers.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_sum` is never used
[INFO] [stdout]   --> src/bit/sum_of_two_integers.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn get_sum(a: i32, b: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bit/total_hamming_distance.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `total_hamming_distance` is never used
[INFO] [stdout]   --> src/bit/total_hamming_distance.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     // TODO
[INFO] [stdout] 26 |     pub fn total_hamming_distance(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/divide/different_ways_to_add_parentheses.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `diff_ways_to_compute` is never used
[INFO] [stdout]   --> src/divide/different_ways_to_add_parentheses.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn diff_ways_to_compute(input: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/divide/unique_binary_search_trees_ii.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `generate_trees` and `recursive` are never used
[INFO] [stdout]   --> src/divide/unique_binary_search_trees_ii.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 21 |     pub fn generate_trees(n: i32) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn recursive(l: usize, r: usize) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/divide/score_of_parentheses.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `score_of_parentheses` and `divide` are never used
[INFO] [stdout]   --> src/divide/score_of_parentheses.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn score_of_parentheses(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn divide(s: &Vec<char>, l: usize, r: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/best_time_to_buy_and_sell_stock_with_cooldown.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_profit`, `max_profit2`, and `recursive` are never used
[INFO] [stdout]   --> src/dynamic_programming/best_time_to_buy_and_sell_stock_with_cooldown.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     pub fn max_profit2(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn recursive(prices: &Vec<i32>, index: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/climbing_stairs.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `climb_stairs` and `climb` are never used
[INFO] [stdout]   --> src/dynamic_programming/climbing_stairs.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn climb(n: usize, items: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `coin_change` and `change` are never used
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn change(coins: &Vec<i32>, amount: i32, items: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/edit_distance.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_distance` and `distance` are never used
[INFO] [stdout]   --> src/dynamic_programming/edit_distance.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 30 |     pub fn min_distance(word1: String, word2: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn distance(
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/fibonacci_number.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `fib` and `fib_loop` are never used
[INFO] [stdout]   --> src/dynamic_programming/fibonacci_number.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 15 |     pub fn fib(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn fib_loop(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/house_robber.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rob` and `recursive` are never used
[INFO] [stdout]   --> src/dynamic_programming/house_robber.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn recursive(nums: &Vec<i32>, index: usize, items: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/house_robber_ii.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rob` and `find` are never used
[INFO] [stdout]   --> src/dynamic_programming/house_robber_ii.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn find(nums: &[i32], index: usize, start: usize, dp: &mut [i32]) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/minimum_path_sum.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_path_sum`, `min_path_sum2`, `path_sum2`, `min_path_sum3`, and `path_sum3` are never used
[INFO] [stdout]   --> src/dynamic_programming/minimum_path_sum.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     pub fn min_path_sum2(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn path_sum2(grid: &Vec<Vec<i32>>, i: usize, j: usize, matrix: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     pub fn min_path_sum3(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn path_sum3(grid: &Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `zero_one_knapsack` is never used
[INFO] [stdout]  --> src/dynamic_programming/zero_one_knapsack.rs:6:4
[INFO] [stdout]   |
[INFO] [stdout] 6 | fn zero_one_knapsack(items: &[i32], capacity: usize) -> usize {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/zero_one_matrix.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `update_matrix` and `recursive` are never used
[INFO] [stdout]   --> src/dynamic_programming/zero_one_matrix.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     // FIXME time limit
[INFO] [stdout] 25 |     pub fn update_matrix(mut mat: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn recursive(mat: &mut Vec<Vec<i32>>, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/distribute_candies_to_people.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `distribute_candies` is never used
[INFO] [stdout]   --> src/easy/distribute_candies_to_people.rs:39:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn distribute_candies(candies: i32, num_people: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/find_all_numbers_disappeared_in_an_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_disappeared_numbers` and `find_disappeared_numbers2` are never used
[INFO] [stdout]   --> src/easy/find_all_numbers_disappeared_in_an_array.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 20 |     pub fn find_disappeared_numbers(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn find_disappeared_numbers2(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/intersection_of_two_arrays.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `intersection` and `intersection2` are never used
[INFO] [stdout]   --> src/easy/intersection_of_two_arrays.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn intersection(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn intersection2(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/longest_common_prefix.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_common_prefix` and `longest_common_prefix2` are never used
[INFO] [stdout]   --> src/easy/longest_common_prefix.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn longest_common_prefix2(strs: Vec<String>) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/majority_element.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `majority_element`, `majority_element2`, and `majority_element3` are never used
[INFO] [stdout]   --> src/easy/majority_element.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn majority_element2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn majority_element3(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/partition_array_into_three_parts_with_equal_sum.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_three_parts_equal_sum` is never used
[INFO] [stdout]   --> src/easy/partition_array_into_three_parts_with_equal_sum.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn can_three_parts_equal_sum(a: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/remove_duplicates_from_sorted_array.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `remove_duplicates` and `remove_duplicates2` are never used
[INFO] [stdout]   --> src/easy/remove_duplicates_from_sorted_array.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     pub fn remove_duplicates2(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/easy/roman_to_integer.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `roman_to_int` is never used
[INFO] [stdout]   --> src/easy/roman_to_integer.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 52 |     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/easy/shortest_unsorted_continuous_subarray.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_unsorted_subarray` is never used
[INFO] [stdout]   --> src/easy/shortest_unsorted_continuous_subarray.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn find_unsorted_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/check_if_it_is_a_straight_line.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `check_straight_line` and `rate` are never used
[INFO] [stdout]   --> src/geometry/check_if_it_is_a_straight_line.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn check_straight_line(mut coordinates: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn rate(a: &[i32], b: &[i32]) -> f32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/k_closest_points_to_origin.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `k_closest` is never used
[INFO] [stdout]   --> src/geometry/k_closest_points_to_origin.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/largest_triangle_area.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `largest_triangle_area` and `triangle_area` are never used
[INFO] [stdout]   --> src/geometry/largest_triangle_area.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn largest_triangle_area(points: Vec<Vec<i32>>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn triangle_area(i: &[i32], j: &[i32], k: &[i32]) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/rectangle_overlap.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_rectangle_overlap` is never used
[INFO] [stdout]   --> src/geometry/rectangle_overlap.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn is_rectangle_overlap(rec1: Vec<i32>, rec2: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/surface_area_of_3d_shapes.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `surface_area` is never used
[INFO] [stdout]   --> src/geometry/surface_area_of_3d_shapes.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn surface_area(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/all_ancestors_of_a_node_in_a_directed_acyclic_graph.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_ancestors` and `dfs` are never used
[INFO] [stdout]   --> src/graph/all_ancestors_of_a_node_in_a_directed_acyclic_graph.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 44 |     pub fn get_ancestors(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/all_paths_from_source_to_target.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `all_paths_source_target` and `dfs` are never used
[INFO] [stdout]   --> src/graph/all_paths_from_source_to_target.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 25 |     pub fn all_paths_source_target(graph: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn dfs(graph: &Vec<Vec<i32>>, index: i32, res: &mut Vec<Vec<i32>>, mut tmp: Vec<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_finish` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn dfs(graph: &Vec<Vec<i32>>, flags: &mut Vec<i32>, i: usize) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_order` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 33 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/find_eventual_safe_states.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `eventual_safe_nodes` and `dfs` are never used
[INFO] [stdout]   --> src/graph/find_eventual_safe_states.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 32 |     pub fn eventual_safe_nodes(graph: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn dfs(graph: &Vec<Vec<i32>>, flags: &mut Vec<i32>, res: &mut Vec<i32>, index: usize) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/is_graph_bipartite.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_bipartite` is never used
[INFO] [stdout]   --> src/graph/is_graph_bipartite.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn is_bipartite(graph: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_circle_num` and `dfs` are never used
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn find_circle_num(mut is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn dfs(is_connected: &mut Vec<Vec<i32>>, i: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/sequence_reconstruction.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sequence_reconstruction` and `check` are never used
[INFO] [stdout]   --> src/graph/sequence_reconstruction.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn sequence_reconstruction(org: Vec<i32>, seqs: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn check(
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/assign_cookies.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_content_children` is never used
[INFO] [stdout]   --> src/greedy/assign_cookies.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn find_content_children(g: Vec<i32>, s: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/best_time_to_buy_and_sell_stock.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]   --> src/greedy/best_time_to_buy_and_sell_stock.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     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/greedy/best_time_to_buy_and_sell_stock_ii.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]   --> src/greedy/best_time_to_buy_and_sell_stock_ii.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 35 |     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/greedy/boats_to_save_people.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_rescue_boats` is never used
[INFO] [stdout]   --> src/greedy/boats_to_save_people.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn num_rescue_boats(mut people: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/broken_calculator.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `broken_calc` is never used
[INFO] [stdout]   --> src/greedy/broken_calculator.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn broken_calc(start_value: i32, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/can_place_flowers.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_place_flowers` is never used
[INFO] [stdout]   --> src/greedy/can_place_flowers.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn can_place_flowers(flowerbed: Vec<i32>, n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/maximum_subarray.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sub_array` is never used
[INFO] [stdout]   --> src/greedy/maximum_subarray.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/minimum_number_of_arrows_to_burst_balloons.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]   --> src/greedy/minimum_number_of_arrows_to_burst_balloons.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 20 |     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/greedy/monotone_increasing_digits.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `monotone_increasing_digits` is never used
[INFO] [stdout]   --> src/greedy/monotone_increasing_digits.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn monotone_increasing_digits(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/non_decreasing_array.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_possibility` is never used
[INFO] [stdout]   --> src/greedy/non_decreasing_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn check_possibility(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/non_overlapping_intervals.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `erase_overlap_intervals` is never used
[INFO] [stdout]   --> src/greedy/non_overlapping_intervals.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn erase_overlap_intervals(intervals: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/queue_reconstruction_by_height.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reconstruct_queue` is never used
[INFO] [stdout]   --> src/greedy/queue_reconstruction_by_height.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn reconstruct_queue(people: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/smallest_string_with_a_given_numeric_value.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_smallest_string` is never used
[INFO] [stdout]   --> src/greedy/smallest_string_with_a_given_numeric_value.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 22 |     pub fn get_smallest_string(mut n: i32, mut k: i32) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/best_time_to_buy_and_sell_stock_iii.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_profit` and `profit` are never used
[INFO] [stdout]   --> src/hard/best_time_to_buy_and_sell_stock_iii.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn profit(prices: &Vec<i32>, index: usize, twice: bool, items: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MedianFinder` is never constructed
[INFO] [stdout]   --> src/hard/find_median_from_data_stream.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct MedianFinder {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_num`, and `find_median` are never used
[INFO] [stdout]   --> src/hard/find_median_from_data_stream.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl MedianFinder {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 37 |     /* initialize your data structure here. */
[INFO] [stdout] 38 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn add_num(&mut self, num: i32) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn find_median(&self) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/first_missing_positive.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `first_missing_positive` is never used
[INFO] [stdout]   --> src/hard/first_missing_positive.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn first_missing_positive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/jump_game_ii.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `jump`, `jump2`, and `jump_recursive` are never used
[INFO] [stdout]   --> src/hard/jump_game_ii.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 19 |     pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn jump2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn jump_recursive(nums: &Vec<i32>, index: usize, items: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/largest_rectangle_in_histogram.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `largest_rectangle_area` and `largest_rectangle_area2` are never used
[INFO] [stdout]   --> src/hard/largest_rectangle_in_histogram.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn largest_rectangle_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn largest_rectangle_area2(heights: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/longest_valid_parentheses.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_valid_parentheses` is never used
[INFO] [stdout]   --> src/hard/longest_valid_parentheses.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn longest_valid_parentheses(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `maximal_rectangle` and `get_rectangle` are never used
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn maximal_rectangle(matrix: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn get_rectangle(
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/minimum_window_substring.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_window` is never used
[INFO] [stdout]   --> src/hard/minimum_window_substring.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/regular_expression_matching.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_match` and `rmatch` are never used
[INFO] [stdout]   --> src/hard/regular_expression_matching.rs:50:12
[INFO] [stdout]    |
[INFO] [stdout] 49 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 50 |     pub fn is_match(s: String, p: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/remove_invalid_parentheses.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `remove_invalid_parentheses` and `dfs` are never used
[INFO] [stdout]   --> src/hard/remove_invalid_parentheses.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn remove_invalid_parentheses(s: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/sliding_window_maximum.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_sliding_window` and `max_sliding_window2` are never used
[INFO] [stdout]   --> src/hard/sliding_window_maximum.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn max_sliding_window2(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/trapping_rain_water.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `trap` is never used
[INFO] [stdout]   --> src/hard/trapping_rain_water.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn trap(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/wildcard_matching.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_match`, `is_match2`, and `recursive_match` are never used
[INFO] [stdout]   --> src/hard/wildcard_matching.rs:48:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 48 |     pub fn is_match(s: String, p: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78 |     pub fn is_match2(s: String, p: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 89 |     fn recursive_match(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hard/word_search_ii.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_words` and `search` are never used
[INFO] [stdout]   --> src/hard/word_search_ii.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn find_words(board: Vec<Vec<char>>, words: Vec<String>) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn search(
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/contains_duplicate.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contains_duplicate` is never used
[INFO] [stdout]   --> src/hash/contains_duplicate.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Codec` is never constructed
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Codec {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `encode`, and `decode` are never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Codec {
[INFO] [stdout]    | ---------- associated items in this implementation
[INFO] [stdout] 35 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn encode(&mut self, longURL: String) -> String {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn decode(&self, mut shortURL: String) -> String {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `PREFIX` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:57:7
[INFO] [stdout]    |
[INFO] [stdout] 57 | const PREFIX: &str = "http://tinyurl.com/";
[INFO] [stdout]    |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `SCALE` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:58:7
[INFO] [stdout]    |
[INFO] [stdout] 58 | const SCALE: usize = 62;
[INFO] [stdout]    |       ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `CHARS` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:59:7
[INFO] [stdout]    |
[INFO] [stdout] 59 | const CHARS: [u8; SCALE] = [
[INFO] [stdout]    |       ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `encode` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn encode(mut num: usize) -> String {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `decode` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:77:4
[INFO] [stdout]    |
[INFO] [stdout] 77 | fn decode(string: String) -> usize {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/group_anagrams.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]   --> src/hash/group_anagrams.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LFUCache` is never constructed
[INFO] [stdout]   --> src/hash/lfu_cache.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct LFUCache {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get`, and `put` are never used
[INFO] [stdout]   --> src/hash/lfu_cache.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl LFUCache {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 38 |     fn new(capacity: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/longest_consecutive_sequence.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_consecutive` and `longest_consecutive2` are never used
[INFO] [stdout]   --> src/hash/longest_consecutive_sequence.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn longest_consecutive2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/longest_harmonious_subsequence.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_lhs` is never used
[INFO] [stdout]   --> src/hash/longest_harmonious_subsequence.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn find_lhs(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/hash/lru_cache.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/hash/lru_cache.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | impl Node {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 39 |     fn new(key: i32, val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LRUCache` is never constructed
[INFO] [stdout]   --> src/hash/lru_cache.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | struct LRUCache {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get`, `put`, `removeNode`, and `addNode` are never used
[INFO] [stdout]    --> src/hash/lru_cache.rs:60:8
[INFO] [stdout]     |
[INFO] [stdout]  59 | impl LRUCache {
[INFO] [stdout]     | ------------- associated items in this implementation
[INFO] [stdout]  60 |     fn new(capacity: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  69 |     fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  78 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  87 |     fn removeNode(&mut self, node: Rc<RefCell<Node>>) {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 111 |     fn addNode(&mut self, node: Rc<RefCell<Node>>) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/replace_words.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `replace_words` is never used
[INFO] [stdout]   --> src/hash/replace_words.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn replace_words(dictionary: Vec<String>, sentence: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/add_two_numbers.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | 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:18:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/add_two_numbers_ii.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `add_two_numbers`, `add_two_numbers2`, `reverse_list`, and `add_two_number` are never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers_ii.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn add_two_numbers2(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn reverse_list(
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86 |     fn add_two_number(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/intersection_of_two_linked_lists.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_intersection_node` is never used
[INFO] [stdout]   --> src/linked_list/intersection_of_two_linked_lists.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn get_intersection_node(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/linked_list_cycle_ii.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `detect_cycle` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle_ii.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn detect_cycle(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/merge_k_sorted_lists.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge_k_lists`, `merge_k_lists2`, and `merge_two_lists` are never used
[INFO] [stdout]   --> src/linked_list/merge_k_sorted_lists.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn merge_k_lists(lists: Vec<Option<Box<ListNode>>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn merge_k_lists2(lists: Vec<Option<Box<ListNode>>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge_two_lists` and `merge_two_lists2` are never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn merge_two_lists2(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/middle_of_the_linked_list.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `middle_node` is never used
[INFO] [stdout]   --> src/linked_list/middle_of_the_linked_list.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn middle_node(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/odd_even_linked_list.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `odd_even_list` is never used
[INFO] [stdout]   --> src/linked_list/odd_even_linked_list.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn odd_even_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/palindrome_linked_list.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_palindrome` and `reverse_loop` are never used
[INFO] [stdout]   --> src/linked_list/palindrome_linked_list.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn reverse_loop(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[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:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | 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:19:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 19 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_linked_list_elements.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_elements` is never used
[INFO] [stdout]   --> src/linked_list/remove_linked_list_elements.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn remove_elements(mut head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
[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:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | 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:22:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     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 `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_list`, `reverse_list_recursive`, and `reverse_list_loop` are never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn reverse_list_recursive(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn reverse_list_loop(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/reverse_linked_list_ii.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_between` and `reverse` are never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list_ii.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn reverse_between(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     unsafe fn reverse(mut head: *mut Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_k_group` and `reverse` are never used
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     // TODO 用unsafe方式完成
[INFO] [stdout] 27 |     pub fn reverse_k_group(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     unsafe fn reverse(head: *mut Option<Box<ListNode>>) -> *mut Option<Box<ListNode>> {
[INFO] [stdout]    |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/sort_list.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sort_list` and `merge` are never used
[INFO] [stdout]   --> src/linked_list/sort_list.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 15 |     // 归并排序
[INFO] [stdout] 16 |     pub fn sort_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn merge(left: Option<Box<ListNode>>, right: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/split_linked_list_in_parts.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `split_list_to_parts` is never used
[INFO] [stdout]   --> src/linked_list/split_linked_list_in_parts.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn split_list_to_parts(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/swap_nodes_in_pairs.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `swap_pairs` and `swap_pairs2` are never used
[INFO] [stdout]   --> src/linked_list/swap_nodes_in_pairs.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 16 |     pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn swap_pairs2(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rand7` is never used
[INFO] [stdout]   --> src/math/implement_rand10_using_rand7.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn rand7() -> i32 {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/math/implement_rand10_using_rand7.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rand10` is never used
[INFO] [stdout]   --> src/math/implement_rand10_using_rand7.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn rand10() -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/math/reverse_integer.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse` and `reverse_by_string` are never used
[INFO] [stdout]   --> src/math/reverse_integer.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn reverse(mut x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn reverse_by_string(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/math/swap_numbers_lcci.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `swap_numbers` is never used
[INFO] [stdout]   --> src/math/swap_numbers_lcci.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn swap_numbers(mut numbers: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/binary_tree_level_order_traversal.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/medium/binary_tree_level_order_traversal.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     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/medium/combination_sum.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `recursive` are never used
[INFO] [stdout]   --> src/medium/combination_sum.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 33 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn recursive(
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/combinations.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `recursive` are never used
[INFO] [stdout]   --> src/medium/combinations.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn recursive(s: i32, n: i32, k: i32, mut tmp: Vec<i32>, results: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `build_tree` and `build_recursive` are never used
[INFO] [stdout]   --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions 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] 28 |     fn build_recursive(preorder: &[i32], inorder: &[i32]) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/container_with_most_water.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_area` and `max_area2` are never used
[INFO] [stdout]   --> src/medium/container_with_most_water.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn max_area2(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/find_all_anagrams_in_a_string.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_anagrams`, `find_anagrams2`, and `find_anagrams3` are never used
[INFO] [stdout]   --> src/medium/find_all_anagrams_in_a_string.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn find_anagrams(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn find_anagrams2(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 98 |     pub fn find_anagrams3(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/flatten_binary_tree_to_linked_list.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flatten` is never used
[INFO] [stdout]   --> src/medium/flatten_binary_tree_to_linked_list.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/jump_game.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_jump`, `can_jump2`, and `jump2` are never used
[INFO] [stdout]   --> src/medium/jump_game.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 29 |     // NOTE 转换思维很重要，从后往前遍历
[INFO] [stdout] 30 |     pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn can_jump2(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn jump2(nums: &Vec<i32>, start: usize) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/letter_combinations_of_a_phone_number.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `combine` are never used
[INFO] [stdout]   --> src/medium/letter_combinations_of_a_phone_number.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 19 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78 |     fn combine(base: Vec<String>, next: Vec<String>) -> Vec<String> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/longest_increasing_subsequence.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `length_of_lis` and `length_of_lis2` are never used
[INFO] [stdout]   --> src/medium/longest_increasing_subsequence.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn length_of_lis2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/longest_palindromic_substring.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_palindrome` and `check` are never used
[INFO] [stdout]   --> src/medium/longest_palindromic_substring.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 21 |     pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn check(chars: &Vec<char>, mut l: i32, mut r: i32) -> String {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/maximal_square.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `maximal_square` and `get_square` are never used
[INFO] [stdout]   --> src/medium/maximal_square.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn maximal_square(matrix: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn get_square(i: usize, j: usize, matrix: &Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/maximum_product_subarray.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_product` is never used
[INFO] [stdout]   --> src/medium/maximum_product_subarray.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/merge_intervals.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]   --> src/medium/merge_intervals.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn merge(intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_of_subarrays` is never used
[INFO] [stdout]   --> src/medium/number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn num_of_subarrays(arr: Vec<i32>, k: i32, threshold: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/numbers_with_same_consecutive_differences.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `nums_same_consec_diff` and `recursive` are never used
[INFO] [stdout]   --> src/medium/numbers_with_same_consecutive_differences.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn nums_same_consec_diff(n: i32, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn recursive(n: i32, k: i32, pre: i32, tmp: String, nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/partition_equal_subset_sum.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_partition`, `can_partition2`, and `backtracking` are never used
[INFO] [stdout]   --> src/medium/partition_equal_subset_sum.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn can_partition(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     pub fn can_partition2(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 67 |     fn backtracking(left: i32, nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/product_of_array_except_self.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `product_except_self`, `product_except_self2`, and `product_except_self3` are never used
[INFO] [stdout]   --> src/medium/product_of_array_except_self.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn product_except_self2(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     pub fn product_except_self3(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/rotate_image.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]   --> src/medium/rotate_image.rs:45:12
[INFO] [stdout]    |
[INFO] [stdout] 44 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 45 |     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/medium/search_in_rotated_sorted_array.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search` is never used
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     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/medium/spiral_matrix.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `spiral_order` and `recursive` are never used
[INFO] [stdout]   --> src/medium/spiral_matrix.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn recursive(matrix: &mut Vec<Vec<i32>>, is_rotate: bool) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/string_to_integer_atoi.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `my_atoi` is never used
[INFO] [stdout]   --> src/medium/string_to_integer_atoi.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn my_atoi(str: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/subsets.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `subset` are never used
[INFO] [stdout]   --> src/medium/subsets.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn subset(nums: Vec<i32>, set: &mut HashSet<Vec<i32>>) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/target_sum.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_target_sum_ways` and `recursive` are never used
[INFO] [stdout]   --> src/medium/target_sum.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn find_target_sum_ways(nums: Vec<i32>, s: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn recursive(
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/task_scheduler.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `least_interval` is never used
[INFO] [stdout]   --> src/medium/task_scheduler.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 44 |     pub fn least_interval(tasks: Vec<char>, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/three_sum.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `three_sum` and `three_sum1` are never used
[INFO] [stdout]   --> src/medium/three_sum.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     pub fn three_sum1(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/three_sum_closest.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum_closest` is never used
[INFO] [stdout]   --> src/medium/three_sum_closest.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/unique_binary_search_trees.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_trees` is never used
[INFO] [stdout]   --> src/medium/unique_binary_search_trees.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn num_trees(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/unique_paths.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `unique_paths2`, `unique_paths`, and `recursive` are never used
[INFO] [stdout]   --> src/medium/unique_paths.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn unique_paths2(m: i32, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn recursive(m: usize, n: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/unique_paths_ii.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `unique_paths_with_obstacles` and `recursive` are never used
[INFO] [stdout]   --> src/medium/unique_paths_ii.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn unique_paths_with_obstacles(obstacle_grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn recursive(grid: &Vec<Vec<i32>>, i: usize, j: usize, matrix: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/validate_binary_search_tree.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid_bst` and `valid_recursive` are never used
[INFO] [stdout]   --> src/medium/validate_binary_search_tree.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 36 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn valid_recursive(root: Option<Rc<RefCell<TreeNode>>>, min_val: i64, max_val: i64) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/word_break.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `word_break` and `break_recursive` are never used
[INFO] [stdout]   --> src/medium/word_break.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn break_recursive(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/word_search.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `exist` and `exist_recursive` are never used
[INFO] [stdout]   --> src/medium/word_search.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn exist(board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn exist_recursive(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/zigzag_conversion.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert` is never used
[INFO] [stdout]   --> src/medium/zigzag_conversion.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     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/prefix_sum/contiguous_array.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_max_length` is never used
[INFO] [stdout]   --> src/prefix_sum/contiguous_array.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn find_max_length(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/continuous_subarray_sum.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_subarray_sum` is never used
[INFO] [stdout]   --> src/prefix_sum/continuous_subarray_sum.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn check_subarray_sum(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `pivot_index` is never used
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 37 |     pub fn pivot_index(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/random_pick_with_weight.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | struct Solution {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `pick_index`, and `rand` are never used
[INFO] [stdout]   --> src/prefix_sum/random_pick_with_weight.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 55 |     fn new(w: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn pick_index(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     fn rand(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rand` is never used
[INFO] [stdout]   --> src/prefix_sum/random_pick_with_weight.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 |     fn rand() -> i32;
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/subarray_sum_equals_k.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subarray_sum`, `subarray_sum2`, and `subarray_sum3` are never used
[INFO] [stdout]   --> src/prefix_sum/subarray_sum_equals_k.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn subarray_sum2(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     pub fn subarray_sum3(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/search/max_area_of_island.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_area_of_island` and `find` are never used
[INFO] [stdout]   --> src/search/max_area_of_island.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 25 |     pub fn max_area_of_island(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn find(i: usize, j: usize, grid: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/search/number_of_islands.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `num_islands` and `update_islands` are never used
[INFO] [stdout]   --> src/search/number_of_islands.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn update_islands(grid: &mut Vec<Vec<char>>, i: usize, j: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/search/perfect_squares.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `num_squares`, `dfs`, and `sqrt` are never used
[INFO] [stdout]   --> src/search/perfect_squares.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn num_squares(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn dfs(n: usize, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     fn sqrt(n: usize) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/search/shortest_path_in_binary_matrix.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `shortest_path_binary_matrix`, `bfs`, and `dp` are never used
[INFO] [stdout]   --> src/search/shortest_path_in_binary_matrix.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 35 |     pub fn shortest_path_binary_matrix(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn bfs(grid: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 85 |     fn dp(grid: &mut Vec<Vec<i32>>, dp: &mut Vec<Vec<i32>>, i: i32, j: i32) -> i32 {
[INFO] [stdout]    |        ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/search/word_ladder.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `ladder_length`, `dfs`, and `check_single_diff` are never used
[INFO] [stdout]   --> src/search/word_ladder.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     pub fn ladder_length(begin_word: String, end_word: String, word_list: Vec<String>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn check_single_diff(word1: &str, word2: &str) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/sort/kth_largest_element_in_an_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_kth_largest`, `find_kth_largest2`, and `fast` are never used
[INFO] [stdout]   --> src/sort/kth_largest_element_in_an_array.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn find_kth_largest2(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn fast(nums: &mut Vec<i32>, left: i32, right: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble` is never used
[INFO] [stdout]  --> src/sort/sort_algo.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn bubble(nums: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn insert(nums: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `select` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn select(nums: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fast` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:41:4
[INFO] [stdout]    |
[INFO] [stdout] 41 | fn fast(nums: &mut Vec<i32>, left: usize, right: usize) {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_split` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:68:4
[INFO] [stdout]    |
[INFO] [stdout] 68 | fn merge_split(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `do_merge` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:77:4
[INFO] [stdout]    |
[INFO] [stdout] 77 | fn do_merge(left: Vec<i32>, right: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/sort/sort_characters_by_frequency.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `frequency_sort` is never used
[INFO] [stdout]   --> src/sort/sort_characters_by_frequency.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn frequency_sort(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/sort/sort_colors.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort_colors` is never used
[INFO] [stdout]   --> src/sort/sort_colors.rs:39:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn sort_colors(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/sort/top_k_frequent_elements.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `top_k_frequent`, `top_k_frequent2`, and `top_k_frequent3` are never used
[INFO] [stdout]   --> src/sort/top_k_frequent_elements.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     pub fn top_k_frequent2(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 84 |     pub fn top_k_frequent3(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/daily_temperatures.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `daily_temperatures` and `daily_temperatures2` are never used
[INFO] [stdout]   --> src/stack_and_queue/daily_temperatures.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 15 |     pub fn daily_temperatures(t: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn daily_temperatures2(t: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyQueue` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/implement_queue_using_stacks.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | struct MyQueue {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used
[INFO] [stdout]   --> src/stack_and_queue/implement_queue_using_stacks.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 47 | impl MyQueue {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 48 |     /** Initialize your data structure here. */
[INFO] [stdout] 49 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn peek(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 83 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyStack` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/implement_stack_using_queues.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct MyStack {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used
[INFO] [stdout]   --> src/stack_and_queue/implement_stack_using_queues.rs:47:8
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl MyStack {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 46 |     /** Initialize your data structure here. */
[INFO] [stdout] 47 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 75 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/min_stack.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | 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_and_queue/min_stack.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 38 |     /** initialize your data structure here. */
[INFO] [stdout] 39 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn get_min(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/next_greater_element_ii.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_greater_elements` is never used
[INFO] [stdout]   --> src/stack_and_queue/next_greater_element_ii.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn next_greater_elements(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `StockSpanner` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/online_stock_span.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct StockSpanner {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `next` are never used
[INFO] [stdout]   --> src/stack_and_queue/online_stock_span.rs:37:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl StockSpanner {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 37 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn next(&mut self, price: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/remove_duplicate_letters.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicate_letters` is never used
[INFO] [stdout]   --> src/stack_and_queue/remove_duplicate_letters.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn remove_duplicate_letters(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/valid_parentheses.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid` and `is_valid2` are never used
[INFO] [stdout]   --> src/stack_and_queue/valid_parentheses.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn is_valid2(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/add_strings.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_strings` is never used
[INFO] [stdout]   --> src/string/add_strings.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn add_strings(num1: String, num2: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/count_binary_substrings.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_binary_substrings` is never used
[INFO] [stdout]   --> src/string/count_binary_substrings.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn count_binary_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/decode_string.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `decode_string` and `decode` are never used
[INFO] [stdout]   --> src/string/decode_string.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn decode_string(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn decode(repeat: usize, cs: &[char]) -> String {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/isomorphic_strings.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]   --> src/string/isomorphic_strings.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     // 记录每个字符的位置
[INFO] [stdout] 26 |     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/string/largest_number.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_number` is never used
[INFO] [stdout]   --> src/string/largest_number.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     pub fn largest_number(mut nums: Vec<i32>) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/longest_nice_substring.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_nice_substring` is never used
[INFO] [stdout]   --> src/string/longest_nice_substring.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn longest_nice_substring(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/longest_palindrome.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_palindrome` is never used
[INFO] [stdout]   --> src/string/longest_palindrome.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn longest_palindrome(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/palindrome_number.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_palindrome`, `is_palindrome2`, and `is_palindrome3` are never used
[INFO] [stdout]   --> src/string/palindrome_number.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     pub fn is_palindrome2(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     pub fn is_palindrome3(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/palindromic_substrings.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_substrings` and `search` are never used
[INFO] [stdout]   --> src/string/palindromic_substrings.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn count_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn search(chars: &Vec<char>, mut left: usize, mut right: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/permutation_in_string.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_inclusion` is never used
[INFO] [stdout]   --> src/string/permutation_in_string.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     pub fn check_inclusion(s1: String, s2: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/repeated_string_match.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `repeated_string_match` is never used
[INFO] [stdout]   --> src/string/repeated_string_match.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn repeated_string_match(a: String, b: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/repeated_substring_pattern.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `repeated_substring_pattern` is never used
[INFO] [stdout]   --> src/string/repeated_substring_pattern.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn repeated_substring_pattern(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/average_of_levels_in_binary_tree.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `average_of_levels` is never used
[INFO] [stdout]   --> src/tree/average_of_levels_in_binary_tree.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 26 |     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/tree/balanced_binary_tree.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_balanced` and `depth` are never used
[INFO] [stdout]   --> src/tree/balanced_binary_tree.rs:39:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     fn depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_inorder_traversal.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `inorder_traversal`, `recursive`, and `loops` are never used
[INFO] [stdout]   --> src/tree/binary_tree_inorder_traversal.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 20 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn loops(mut root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_maximum_path_sum.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_path_sum`, `multi_pah`, and `single_path` are never used
[INFO] [stdout]   --> src/tree/binary_tree_maximum_path_sum.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn max_path_sum(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn multi_pah(root: &Option<Rc<RefCell<TreeNode>>>) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn single_path(root: &Option<Rc<RefCell<TreeNode>>>) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_postorder_traversal.rs:47:8
[INFO] [stdout]    |
[INFO] [stdout] 47 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `postorder_traversal`, `recursive`, and `loops` are never used
[INFO] [stdout]   --> src/tree/binary_tree_postorder_traversal.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 49 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     fn loops(mut root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_preorder_traversal.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `preorder_traversal`, `recursive`, and `loops` are never used
[INFO] [stdout]   --> src/tree/binary_tree_preorder_traversal.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 20 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn loops(mut root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_pruning.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `prune_tree` is never used
[INFO] [stdout]   --> src/tree/binary_tree_pruning.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn prune_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_right_side_view.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `right_side_view` is never used
[INFO] [stdout]   --> src/tree/binary_tree_right_side_view.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/convert_bst_to_greater_tree.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `convert_bst` and `dfs` are never used
[INFO] [stdout]   --> src/tree/convert_bst_to_greater_tree.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn convert_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn dfs(root: &mut Option<Rc<RefCell<TreeNode>>>, tmp: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/convert_sorted_array_to_binary_search_tree.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sorted_array_to_bst` and `creator` are never used
[INFO] [stdout]   --> src/tree/convert_sorted_array_to_binary_search_tree.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 23 |     pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn creator(nums: &Vec<i32>, l: i32, r: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/convert_sorted_list_to_binary_search_tree.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sorted_list_to_bst` and `creator` are never used
[INFO] [stdout]   --> src/tree/convert_sorted_list_to_binary_search_tree.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 38 |     pub fn sorted_list_to_bst(head: Option<Box<ListNode>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn creator(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/diameter_of_binary_tree.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `diameter_of_binary_tree` and `depth` are never used
[INFO] [stdout]   --> src/tree/diameter_of_binary_tree.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/find_bottom_left_tree_value.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_bottom_left_value` is never used
[INFO] [stdout]   --> src/tree/find_bottom_left_tree_value.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/find_mode_in_binary_search_tree.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_mode`, `inorder`, and `check` are never used
[INFO] [stdout]   --> src/tree/find_mode_in_binary_search_tree.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn inorder(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 60 |     fn check(val: i32, res: &mut Vec<i32>, pre: &mut (Option<i32>, usize), count: &mut usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/house_robber_iii.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rob`, `dfs`, `rob2`, and `recursive` are never used
[INFO] [stdout]   --> src/tree/house_robber_iii.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn rob(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>) -> (i32, i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn rob2(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn recursive(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `create`, `new`, `insert`, `search`, `starts_with`, and `find` are never used
[INFO] [stdout]   --> src/tree/implement_trie_prefix_tree.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Trie {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 20 |     // 构建字典树(假设只存储26个英文字母)
[INFO] [stdout] 21 |     pub fn create(words: Vec<&str>) -> Trie {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn insert(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn search(&mut self, word: String) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     pub fn starts_with(&mut self, prefix: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61 |     fn find(&self, word: String, end: bool) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/invert_binary_tree.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]   --> src/tree/invert_binary_tree.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/kth_smallest_element_in_a_bst.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `kth_smallest`, `recursive`, `kth_smallest2`, and `recursive2` are never used
[INFO] [stdout]   --> src/tree/kth_smallest_element_in_a_bst.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, list: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     pub fn kth_smallest2(root: Option<Rc<RefCell<TreeNode>>>, mut k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn recursive2(root: Option<Rc<RefCell<TreeNode>>>, k: &mut i32, res: &mut i32) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/longest_univalue_path.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_univalue_path` and `max_length` are never used
[INFO] [stdout]   --> src/tree/longest_univalue_path.rs:39:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn longest_univalue_path(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn max_length(root: &Option<Rc<RefCell<TreeNode>>>, pre_val: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `dfs` are never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 32 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, pv: i32, qv: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor`, `dfs`, `lowest_common_ancestor2`, and `dfs2` are never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, p: i32, q: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     pub fn lowest_common_ancestor2(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |     fn dfs2(root: &Option<Rc<RefCell<TreeNode>>>, target: i32, paths: &mut Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/maximum_depth_of_binary_tree.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/tree/maximum_depth_of_binary_tree.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/merge_two_binary_trees.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_trees` is never used
[INFO] [stdout]   --> src/tree/merge_two_binary_trees.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn merge_trees(
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/minimum_absolute_difference_in_bst.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_minimum_difference` and `inorder` are never used
[INFO] [stdout]   --> src/tree/minimum_absolute_difference_in_bst.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn inorder(root: Option<Rc<RefCell<TreeNode>>>, pre: &mut Option<i32>, res: &mut i32) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/minimum_depth_of_binary_tree.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_depth` is never used
[INFO] [stdout]   --> src/tree/minimum_depth_of_binary_tree.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/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/tree/path_sum.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/path_sum_iii.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `path_sum` and `root_sum` are never used
[INFO] [stdout]   --> src/tree/path_sum_iii.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, sum: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn root_sum(root: &Option<Rc<RefCell<TreeNode>>>, sum: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/recover_binary_search_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `recover_tree` and `dfs` are never used
[INFO] [stdout]   --> src/tree/recover_binary_search_tree.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn recover_tree(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/same_tree.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/tree/same_tree.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/second_minimum_node_in_a_binary_tree.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_second_minimum_value` is never used
[INFO] [stdout]   --> src/tree/second_minimum_node_in_a_binary_tree.rs:39:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn find_second_minimum_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Codec` is never constructed
[INFO] [stdout]   --> src/tree/serialize_and_deserialize_binary_tree.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Codec;
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `serialize` and `deserialize` are never used
[INFO] [stdout]   --> src/tree/serialize_and_deserialize_binary_tree.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Codec {
[INFO] [stdout]    | ---------- associated functions in this implementation
[INFO] [stdout] 25 |     fn serialize(root: Option<Rc<RefCell<TreeNode>>>) -> String {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn deserialize(data: String) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/subtree_of_another_tree.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_subtree` and `check` are never used
[INFO] [stdout]   --> src/tree/subtree_of_another_tree.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn is_subtree(s: Option<Rc<RefCell<TreeNode>>>, t: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn check(s: &Option<Rc<RefCell<TreeNode>>>, t: &Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/sum_of_left_leaves.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sum_of_left_leaves` is never used
[INFO] [stdout]   --> src/tree/sum_of_left_leaves.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn sum_of_left_leaves(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/symmetric_tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric`, `symmetric_recursive`, and `symmetric_loop` are never used
[INFO] [stdout]   --> src/tree/symmetric_tree.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn symmetric_recursive(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     fn symmetric_loop(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/trim_a_binary_search_tree.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `trim_bst` is never used
[INFO] [stdout]   --> src/tree/trim_a_binary_search_tree.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 44 |     pub fn trim_bst(
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/two_sum_iv_input_is_a_bst.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_target` and `inorder` are never used
[INFO] [stdout]   --> src/tree/two_sum_iv_input_is_a_bst.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 40 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 41 |     // 时间复杂度O(n) 空间复杂度O(n)
[INFO] [stdout] 42 |     pub fn find_target(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn inorder(root: Option<Rc<RefCell<TreeNode>>>, values: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/is_subsequence.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]   --> src/two_point/is_subsequence.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     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/two_point/linked_list_cycle.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `has_cycle` is never used
[INFO] [stdout]   --> src/two_point/linked_list_cycle.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn has_cycle(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/longest_substring_without_repeating_characters.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/two_point/longest_substring_without_repeating_characters.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 26 |     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/two_point/longest_word_in_dictionary_through_deleting.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_longest_word` is never used
[INFO] [stdout]   --> src/two_point/longest_word_in_dictionary_through_deleting.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn find_longest_word(s: String, d: Vec<String>) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/merge_sorted_array.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge` and `merge2` are never used
[INFO] [stdout]   --> src/two_point/merge_sorted_array.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn merge2(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/two_point/move_zeroes.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `move_zeroes` is never used
[INFO] [stdout]   --> src/two_point/move_zeroes.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/next_permutation.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_permutation` is never used
[INFO] [stdout]   --> src/two_point/next_permutation.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn next_permutation(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/partition_labels.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `partition_labels` is never used
[INFO] [stdout]   --> src/two_point/partition_labels.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn partition_labels(s: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/reverse_vowels_of_a_string.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_vowels` is never used
[INFO] [stdout]   --> src/two_point/reverse_vowels_of_a_string.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn reverse_vowels(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/sum_of_square_numbers.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `judge_square_sum` is never used
[INFO] [stdout]   --> src/two_point/sum_of_square_numbers.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn judge_square_sum(c: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/two_sum_ii_input_array_is_sorted.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]   --> src/two_point/two_sum_ii_input_array_is_sorted.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[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: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/valid_palindrome.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]   --> src/two_point/valid_palindrome.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/valid_palindrome_ii.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `valid_palindrome` and `recursive` are never used
[INFO] [stdout]   --> src/two_point/valid_palindrome_ii.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn valid_palindrome(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn recursive(s: &Vec<char>, l: usize, r: usize, flag: bool) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `addEdge` should have a snake case name
[INFO] [stdout]   --> src/base/graph.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 22 |     pub fn addEdge(&mut self, i: usize, j: usize) {
[INFO] [stdout]    |            ^^^^^^^ help: convert the identifier to snake case: `add_edge`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused return value of `Vec::<T, A>::split_off` that must be used
[INFO] [stdout]   --> src/easy/remove_duplicates_from_sorted_array.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |         nums.split_off(index);
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: use `.truncate()` if you don't need the other half
[INFO] [stdout]    = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]    |
[INFO] [stdout] 49 |         let _ = nums.split_off(index);
[INFO] [stdout]    |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `longURL` should have a snake case name
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:43:26
[INFO] [stdout]    |
[INFO] [stdout] 43 |     fn encode(&mut self, longURL: String) -> String {
[INFO] [stdout]    |                          ^^^^^^^ help: convert the identifier to snake case: `long_url`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `shortURL` should have a snake case name
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:51:26
[INFO] [stdout]    |
[INFO] [stdout] 51 |     fn decode(&self, mut shortURL: String) -> String {
[INFO] [stdout]    |                          ^^^^^^^^ help: convert the identifier to snake case: `short_url`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `removeNode` should have a snake case name
[INFO] [stdout]   --> src/hash/lru_cache.rs:87:8
[INFO] [stdout]    |
[INFO] [stdout] 87 |     fn removeNode(&mut self, node: Rc<RefCell<Node>>) {
[INFO] [stdout]    |        ^^^^^^^^^^ help: convert the identifier to snake case: `remove_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `addNode` should have a snake case name
[INFO] [stdout]    --> src/hash/lru_cache.rs:111:8
[INFO] [stdout]     |
[INFO] [stdout] 111 |     fn addNode(&mut self, node: Rc<RefCell<Node>>) {
[INFO] [stdout]     |        ^^^^^^^ help: convert the identifier to snake case: `add_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 1.41s
[INFO] running `Command { std: "docker" "inspect" "3a4160e38a58346958291c2e5c515e9ec5d41fb173cbb8074fbc56860d38de29", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "3a4160e38a58346958291c2e5c515e9ec5d41fb173cbb8074fbc56860d38de29", kill_on_drop: false }`
[INFO] [stdout] 3a4160e38a58346958291c2e5c515e9ec5d41fb173cbb8074fbc56860d38de29
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] e692f8102069adfb62b17fce99b77b84088dd784f1c8c73bb43c61284313778c
[INFO] running `Command { std: "docker" "start" "-a" "e692f8102069adfb62b17fce99b77b84088dd784f1c8c73bb43c61284313778c", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/hard/longest_valid_parentheses.rs:38:53
[INFO] [stdout]    |
[INFO] [stdout] 38 |                     sum = max(sum, i as i32 - stack[(stack.len() - 1)]);
[INFO] [stdout]    |                                                     ^               ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 38 -                     sum = max(sum, i as i32 - stack[(stack.len() - 1)]);
[INFO] [stdout] 38 +                     sum = max(sum, i as i32 - stack[stack.len() - 1]);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `matrix`
[INFO] [stdout]   --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:39
[INFO] [stdout]    |
[INFO] [stdout] 25 |     pub fn kth_smallest_binary_search(matrix: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]    |                                       ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:62
[INFO] [stdout]    |
[INFO] [stdout] 25 |     pub fn kth_smallest_binary_search(matrix: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]    |                                                              ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `mains`
[INFO] [stdout]    --> src/base/matchs.rs:106:16
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                ^^^^^ help: if this is intentional, prefix it with an underscore: `_mains`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `aims`
[INFO] [stdout]    --> src/base/matchs.rs:106:35
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                                   ^^^^ help: if this is intentional, prefix it with an underscore: `_aims`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]    --> src/base/matchs.rs:106:53
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                                                     ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `j`
[INFO] [stdout]    --> src/base/matchs.rs:106:63
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |                                                               ^ help: if this is intentional, prefix it with an underscore: `_j`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `a`
[INFO] [stdout]    --> src/base/matchs.rs:117:8
[INFO] [stdout]     |
[INFO] [stdout] 117 | fn kmp(a: &str, b: &str) -> bool {
[INFO] [stdout]     |        ^ help: if this is intentional, prefix it with an underscore: `_a`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `b`
[INFO] [stdout]    --> src/base/matchs.rs:117:17
[INFO] [stdout]     |
[INFO] [stdout] 117 | fn kmp(a: &str, b: &str) -> bool {
[INFO] [stdout]     |                 ^ help: if this is intentional, prefix it with an underscore: `_b`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/bit/reverse_bits.rs:29:13
[INFO] [stdout]    |
[INFO] [stdout] 29 |         for i in 0..32 {
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]   --> src/bit/total_hamming_distance.rs:26:35
[INFO] [stdout]    |
[INFO] [stdout] 26 |     pub fn total_hamming_distance(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                   ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/geometry/k_closest_points_to_origin.rs:29:14
[INFO] [stdout]    |
[INFO] [stdout] 29 |         for (i, point) in points.into_iter().enumerate() {
[INFO] [stdout]    |              ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `graph`
[INFO] [stdout]   --> src/graph/is_graph_bipartite.rs:37:25
[INFO] [stdout]    |
[INFO] [stdout] 37 |     pub fn is_bipartite(graph: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `graph`
[INFO] [stdout]   --> src/graph/sequence_reconstruction.rs:26:9
[INFO] [stdout]    |
[INFO] [stdout] 26 |         graph: &HashMap<i32, HashSet<i32>>,
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `flags`
[INFO] [stdout]   --> src/graph/sequence_reconstruction.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |         flags: &mut HashMap<i32, i32>,
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_flags`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]   --> src/graph/sequence_reconstruction.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |         let target = org[o_index];
[INFO] [stdout]    |             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `heights`
[INFO] [stdout]   --> src/hard/largest_rectangle_in_histogram.rs:18:35
[INFO] [stdout]    |
[INFO] [stdout] 18 |     pub fn largest_rectangle_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                   ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_heights`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:56:21
[INFO] [stdout]    |
[INFO] [stdout] 56 |                 let mut tmp = j;
[INFO] [stdout]    |                     ----^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `tmp`
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:56:21
[INFO] [stdout]    |
[INFO] [stdout] 56 |                 let mut tmp = j;
[INFO] [stdout]    |                     ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_tmp`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `l` is never read
[INFO] [stdout]   --> src/hard/maximal_rectangle.rs:51:21
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let mut l = i;
[INFO] [stdout]    |                     ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 55 |                 l = a;
[INFO] [stdout]    |                 ----- `l` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/hard/regular_expression_matching.rs:58:27
[INFO] [stdout]    |
[INFO] [stdout] 58 |     fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool {
[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/hard/regular_expression_matching.rs:58:54
[INFO] [stdout]    |
[INFO] [stdout] 58 |     fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool {
[INFO] [stdout]    |                                                      ----^^
[INFO] [stdout]    |                                                      |
[INFO] [stdout]    |                                                      help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/hash/longest_harmonious_subsequence.rs:41:17
[INFO] [stdout]    |
[INFO] [stdout] 41 |         for (k, v) in map.iter() {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:21:9
[INFO] [stdout]    |
[INFO] [stdout] 21 |         mut pre: Option<Box<ListNode>>,
[INFO] [stdout]    |         ----^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary `unsafe` block
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:28:9
[INFO] [stdout]    |
[INFO] [stdout] 28 |         unsafe {}
[INFO] [stdout]    |         ^^^^^^ unnecessary `unsafe` block
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_unsafe)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:27:57
[INFO] [stdout]    |
[INFO] [stdout] 27 |     pub fn reverse_k_group(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                                         ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `str`
[INFO] [stdout]   --> src/medium/string_to_integer_atoi.rs:42:20
[INFO] [stdout]    |
[INFO] [stdout] 42 |     pub fn my_atoi(str: String) -> i32 {
[INFO] [stdout]    |                    ^^^ help: if this is intentional, prefix it with an underscore: `_str`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:38:13
[INFO] [stdout]    |
[INFO] [stdout] 38 |         let mut tmp: i32 = 0;
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `tmp`
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:38:13
[INFO] [stdout]    |
[INFO] [stdout] 38 |         let mut tmp: i32 = 0;
[INFO] [stdout]    |             ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_tmp`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/sort/sort_algo.rs:101:9
[INFO] [stdout]     |
[INFO] [stdout] 101 |     let mut sorted_nums = vec![1, 2, 3, 3, 4, 8, 9];
[INFO] [stdout]     |         ----^^^^^^^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `a`
[INFO] [stdout]   --> src/tree/house_robber_iii.rs:73:21
[INFO] [stdout]    |
[INFO] [stdout] 73 |                 let a = node.borrow();
[INFO] [stdout]    |                     ^ help: if this is intentional, prefix it with an underscore: `_a`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]   --> src/tree/implement_trie_prefix_tree.rs:83:9
[INFO] [stdout]    |
[INFO] [stdout] 83 |     let t: Trie = Trie::create(words);
[INFO] [stdout]    |         ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_primes_sqrt` and `is_prime` are never used
[INFO] [stdout]   --> src/array/count_primes.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn count_primes_sqrt(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn is_prime(n: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/maximum_length_of_repeated_subarray.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_length` and `recu` are never used
[INFO] [stdout]   --> src/array/maximum_length_of_repeated_subarray.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 20 |     pub fn find_length(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn recu(nums1: &Vec<i32>, nums2: &Vec<i32>, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/minimum_size_subarray_sum.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_sub_array_len` and `min_sub_array_len_binary_search` are never used
[INFO] [stdout]   --> src/array/minimum_size_subarray_sum.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     pub fn min_sub_array_len_binary_search(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/plus_one.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `plus_one` is never used
[INFO] [stdout]   --> src/array/plus_one.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix2` is never used
[INFO] [stdout]   --> src/array/search_a_2d_matrix_ii.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn search_matrix2(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_error_nums_sort` is never used
[INFO] [stdout]   --> src/array/set_mismatch.rs:50:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn find_error_nums_sort(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/array/subarray_product_less_than_k.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_subarray_product_less_than_k` is never used
[INFO] [stdout]   --> src/array/subarray_product_less_than_k.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn num_subarray_product_less_than_k(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/backtracking/generate_parentheses.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `generate_parenthesis` and `generate` are never used
[INFO] [stdout]   --> src/backtracking/generate_parentheses.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 15 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn generate(res: &mut Vec<String>, tmp: String, l: i32, r: i32) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `default` and `size` are never used
[INFO] [stdout]   --> src/base/java_map.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | / impl<K, V> JavaMap<K, V>
[INFO] [stdout] 26 | | where
[INFO] [stdout] 27 | |     K: Eq + Hash + Clone,
[INFO] [stdout] 28 | |     V: Clone,
[INFO] [stdout]    | |_____________- associated items in this implementation
[INFO] [stdout] 29 |   {
[INFO] [stdout] 30 |       fn default() -> JavaMap<K, V> {
[INFO] [stdout]    |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |       fn size(&self) -> u64 {
[INFO] [stdout]    |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `good_suffix` is never used
[INFO] [stdout]    --> src/base/matchs.rs:106:4
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn good_suffix(mains: &Vec<char>, aims: &Vec<char>, i: usize, j: usize) -> usize {
[INFO] [stdout]     |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/binary_search/nth_digit.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_nth_digit` is never used
[INFO] [stdout]   --> src/binary_search/nth_digit.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 20 |     // FIXME
[INFO] [stdout] 21 |     pub fn find_nth_digit(n: 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:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | 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:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     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_search/single_element_in_a_sorted_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `single_non_duplicate` and `single_non_duplicate2` are never used
[INFO] [stdout]   --> src/binary_search/single_element_in_a_sorted_array.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn single_non_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn single_non_duplicate2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_bits2`, `count_bits3`, and `count_bits4` are never used
[INFO] [stdout]   --> src/bit/counting_bits.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn count_bits2(num: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     pub fn count_bits3(num: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     pub fn count_bits4(num: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/divide/unique_binary_search_trees_ii.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `generate_trees` and `recursive` are never used
[INFO] [stdout]   --> src/divide/unique_binary_search_trees_ii.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 21 |     pub fn generate_trees(n: i32) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn recursive(l: usize, r: usize) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/divide/score_of_parentheses.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `score_of_parentheses` and `divide` are never used
[INFO] [stdout]   --> src/divide/score_of_parentheses.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn score_of_parentheses(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn divide(s: &Vec<char>, l: usize, r: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_path_sum`, `min_path_sum3`, and `path_sum3` are never used
[INFO] [stdout]   --> src/dynamic_programming/minimum_path_sum.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     pub fn min_path_sum3(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn path_sum3(grid: &Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dynamic_programming/zero_one_matrix.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `update_matrix` and `recursive` are never used
[INFO] [stdout]   --> src/dynamic_programming/zero_one_matrix.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     // FIXME time limit
[INFO] [stdout] 25 |     pub fn update_matrix(mut mat: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn recursive(mat: &mut Vec<Vec<i32>>, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_disappeared_numbers2` is never used
[INFO] [stdout]   --> src/easy/find_all_numbers_disappeared_in_an_array.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn find_disappeared_numbers2(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_prefix2` is never used
[INFO] [stdout]   --> src/easy/longest_common_prefix.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn longest_common_prefix2(strs: Vec<String>) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `majority_element2` and `majority_element3` are never used
[INFO] [stdout]   --> src/easy/majority_element.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn majority_element2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn majority_element3(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates2` is never used
[INFO] [stdout]   --> src/easy/remove_duplicates_from_sorted_array.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 57 |     pub fn remove_duplicates2(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/check_if_it_is_a_straight_line.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `check_straight_line` and `rate` are never used
[INFO] [stdout]   --> src/geometry/check_if_it_is_a_straight_line.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn check_straight_line(mut coordinates: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn rate(a: &[i32], b: &[i32]) -> f32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/k_closest_points_to_origin.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `k_closest` is never used
[INFO] [stdout]   --> src/geometry/k_closest_points_to_origin.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/largest_triangle_area.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `largest_triangle_area` and `triangle_area` are never used
[INFO] [stdout]   --> src/geometry/largest_triangle_area.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 22 |     pub fn largest_triangle_area(points: Vec<Vec<i32>>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn triangle_area(i: &[i32], j: &[i32], k: &[i32]) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/rectangle_overlap.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_rectangle_overlap` is never used
[INFO] [stdout]   --> src/geometry/rectangle_overlap.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn is_rectangle_overlap(rec1: Vec<i32>, rec2: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/geometry/surface_area_of_3d_shapes.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `surface_area` is never used
[INFO] [stdout]   --> src/geometry/surface_area_of_3d_shapes.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn surface_area(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/all_ancestors_of_a_node_in_a_directed_acyclic_graph.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_ancestors` and `dfs` are never used
[INFO] [stdout]   --> src/graph/all_ancestors_of_a_node_in_a_directed_acyclic_graph.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 44 |     pub fn get_ancestors(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/all_paths_from_source_to_target.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `all_paths_source_target` and `dfs` are never used
[INFO] [stdout]   --> src/graph/all_paths_from_source_to_target.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 25 |     pub fn all_paths_source_target(graph: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn dfs(graph: &Vec<Vec<i32>>, index: i32, res: &mut Vec<Vec<i32>>, mut tmp: Vec<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_finish` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn dfs(graph: &Vec<Vec<i32>>, flags: &mut Vec<i32>, i: usize) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_order` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 33 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/find_eventual_safe_states.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `eventual_safe_nodes` and `dfs` are never used
[INFO] [stdout]   --> src/graph/find_eventual_safe_states.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 32 |     pub fn eventual_safe_nodes(graph: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn dfs(graph: &Vec<Vec<i32>>, flags: &mut Vec<i32>, res: &mut Vec<i32>, index: usize) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_circle_num` and `dfs` are never used
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn find_circle_num(mut is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn dfs(is_connected: &mut Vec<Vec<i32>>, i: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/best_time_to_buy_and_sell_stock.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]   --> src/greedy/best_time_to_buy_and_sell_stock.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     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/greedy/boats_to_save_people.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_rescue_boats` is never used
[INFO] [stdout]   --> src/greedy/boats_to_save_people.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn num_rescue_boats(mut people: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/broken_calculator.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `broken_calc` is never used
[INFO] [stdout]   --> src/greedy/broken_calculator.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn broken_calc(start_value: i32, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/monotone_increasing_digits.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `monotone_increasing_digits` is never used
[INFO] [stdout]   --> src/greedy/monotone_increasing_digits.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn monotone_increasing_digits(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/greedy/smallest_string_with_a_given_numeric_value.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_smallest_string` is never used
[INFO] [stdout]   --> src/greedy/smallest_string_with_a_given_numeric_value.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 22 |     pub fn get_smallest_string(mut n: i32, mut k: i32) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `jump2` and `jump_recursive` are never used
[INFO] [stdout]   --> src/hard/jump_game_ii.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn jump2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn jump_recursive(nums: &Vec<i32>, index: usize, items: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_rectangle_area2` is never used
[INFO] [stdout]   --> src/hard/largest_rectangle_in_histogram.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn largest_rectangle_area2(heights: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sliding_window2` is never used
[INFO] [stdout]   --> src/hard/sliding_window_maximum.rs:63:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn max_sliding_window2(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_match2` and `recursive_match` are never used
[INFO] [stdout]   --> src/hard/wildcard_matching.rs:78:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 78 |     pub fn is_match2(s: String, p: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 89 |     fn recursive_match(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/contains_duplicate.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contains_duplicate` is never used
[INFO] [stdout]   --> src/hash/contains_duplicate.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Codec` is never constructed
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Codec {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `encode`, and `decode` are never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Codec {
[INFO] [stdout]    | ---------- associated items in this implementation
[INFO] [stdout] 35 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn encode(&mut self, longURL: String) -> String {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn decode(&self, mut shortURL: String) -> String {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `PREFIX` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:57:7
[INFO] [stdout]    |
[INFO] [stdout] 57 | const PREFIX: &str = "http://tinyurl.com/";
[INFO] [stdout]    |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `SCALE` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:58:7
[INFO] [stdout]    |
[INFO] [stdout] 58 | const SCALE: usize = 62;
[INFO] [stdout]    |       ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `CHARS` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:59:7
[INFO] [stdout]    |
[INFO] [stdout] 59 | const CHARS: [u8; SCALE] = [
[INFO] [stdout]    |       ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `encode` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn encode(mut num: usize) -> String {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `decode` is never used
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:77:4
[INFO] [stdout]    |
[INFO] [stdout] 77 | fn decode(string: String) -> usize {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/group_anagrams.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]   --> src/hash/group_anagrams.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     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/longest_consecutive_sequence.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_consecutive` and `longest_consecutive2` are never used
[INFO] [stdout]   --> src/hash/longest_consecutive_sequence.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn longest_consecutive2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/hash/replace_words.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `replace_words` is never used
[INFO] [stdout]   --> src/hash/replace_words.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn replace_words(dictionary: Vec<String>, sentence: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/add_two_numbers_ii.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `add_two_numbers`, `add_two_numbers2`, `reverse_list`, and `add_two_number` are never used
[INFO] [stdout]   --> src/linked_list/add_two_numbers_ii.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn add_two_numbers2(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn reverse_list(
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86 |     fn add_two_number(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/intersection_of_two_linked_lists.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_intersection_node` is never used
[INFO] [stdout]   --> src/linked_list/intersection_of_two_linked_lists.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn get_intersection_node(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/linked_list_cycle_ii.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `detect_cycle` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle_ii.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn detect_cycle(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge_k_lists2` and `merge_two_lists` are never used
[INFO] [stdout]   --> src/linked_list/merge_k_sorted_lists.rs:48:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn merge_k_lists2(lists: Vec<Option<Box<ListNode>>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     pub fn merge_two_lists(
[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:22:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 22 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/odd_even_linked_list.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `odd_even_list` is never used
[INFO] [stdout]   --> src/linked_list/odd_even_linked_list.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn odd_even_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/palindrome_linked_list.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_palindrome` and `reverse_loop` are never used
[INFO] [stdout]   --> src/linked_list/palindrome_linked_list.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn reverse_loop(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[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:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | 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:19:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 19 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linked_list/remove_linked_list_elements.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_elements` is never used
[INFO] [stdout]   --> src/linked_list/remove_linked_list_elements.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn remove_elements(mut head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_list_loop` is never used
[INFO] [stdout]   --> src/linked_list/reverse_linked_list.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn reverse_list_loop(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_k_group` and `reverse` are never used
[INFO] [stdout]   --> src/linked_list/reverse_nodes_in_k_group.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     // TODO 用unsafe方式完成
[INFO] [stdout] 27 |     pub fn reverse_k_group(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     unsafe fn reverse(head: *mut Option<Box<ListNode>>) -> *mut Option<Box<ListNode>> {
[INFO] [stdout]    |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/split_linked_list_in_parts.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `split_list_to_parts` is never used
[INFO] [stdout]   --> src/linked_list/split_linked_list_in_parts.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn split_list_to_parts(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_list/swap_nodes_in_pairs.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `swap_pairs` and `swap_pairs2` are never used
[INFO] [stdout]   --> src/linked_list/swap_nodes_in_pairs.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 16 |     pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn swap_pairs2(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rand7` is never used
[INFO] [stdout]   --> src/math/implement_rand10_using_rand7.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn rand7() -> i32 {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/math/implement_rand10_using_rand7.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rand10` is never used
[INFO] [stdout]   --> src/math/implement_rand10_using_rand7.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn rand10() -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_by_string` is never used
[INFO] [stdout]   --> src/math/reverse_integer.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn reverse_by_string(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area2` is never used
[INFO] [stdout]   --> src/medium/container_with_most_water.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn max_area2(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_anagrams2` and `find_anagrams3` are never used
[INFO] [stdout]   --> src/medium/find_all_anagrams_in_a_string.rs:62:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn find_anagrams2(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 98 |     pub fn find_anagrams3(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/medium/flatten_binary_tree_to_linked_list.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flatten` is never used
[INFO] [stdout]   --> src/medium/flatten_binary_tree_to_linked_list.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_jump2` and `jump2` are never used
[INFO] [stdout]   --> src/medium/jump_game.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn can_jump2(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn jump2(nums: &Vec<i32>, start: usize) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_lis2` is never used
[INFO] [stdout]   --> src/medium/longest_increasing_subsequence.rs:48:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn length_of_lis2(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_partition2` and `backtracking` are never used
[INFO] [stdout]   --> src/medium/partition_equal_subset_sum.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 57 |     pub fn can_partition2(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 67 |     fn backtracking(left: i32, nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `product_except_self2` and `product_except_self3` are never used
[INFO] [stdout]   --> src/medium/product_of_array_except_self.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn product_except_self2(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     pub fn product_except_self3(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum1` is never used
[INFO] [stdout]   --> src/medium/three_sum.rs:73:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 73 |     pub fn three_sum1(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `unique_paths2` is never used
[INFO] [stdout]   --> src/medium/unique_paths.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn unique_paths2(m: i32, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/contiguous_array.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_max_length` is never used
[INFO] [stdout]   --> src/prefix_sum/contiguous_array.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn find_max_length(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/continuous_subarray_sum.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_subarray_sum` is never used
[INFO] [stdout]   --> src/prefix_sum/continuous_subarray_sum.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn check_subarray_sum(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `pivot_index` is never used
[INFO] [stdout]   --> src/prefix_sum/find_pivot_index.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 37 |     pub fn pivot_index(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/prefix_sum/random_pick_with_weight.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | struct Solution {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `pick_index`, and `rand` are never used
[INFO] [stdout]   --> src/prefix_sum/random_pick_with_weight.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 54 | impl Solution {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 55 |     fn new(w: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn pick_index(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     fn rand(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rand` is never used
[INFO] [stdout]   --> src/prefix_sum/random_pick_with_weight.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 |     fn rand() -> i32;
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `subarray_sum3` is never used
[INFO] [stdout]   --> src/prefix_sum/subarray_sum_equals_k.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 58 |     pub fn subarray_sum3(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `dp` is never used
[INFO] [stdout]   --> src/search/shortest_path_in_binary_matrix.rs:85:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 85 |     fn dp(grid: &mut Vec<Vec<i32>>, dp: &mut Vec<Vec<i32>>, i: i32, j: i32) -> i32 {
[INFO] [stdout]    |        ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_kth_largest2` and `fast` are never used
[INFO] [stdout]   --> src/sort/kth_largest_element_in_an_array.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn find_kth_largest2(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn fast(nums: &mut Vec<i32>, left: i32, right: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn insert(nums: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `select` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn select(nums: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fast` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:41:4
[INFO] [stdout]    |
[INFO] [stdout] 41 | fn fast(nums: &mut Vec<i32>, left: usize, right: usize) {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_split` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:68:4
[INFO] [stdout]    |
[INFO] [stdout] 68 | fn merge_split(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `do_merge` is never used
[INFO] [stdout]   --> src/sort/sort_algo.rs:77:4
[INFO] [stdout]    |
[INFO] [stdout] 77 | fn do_merge(left: Vec<i32>, right: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `top_k_frequent3` is never used
[INFO] [stdout]   --> src/sort/top_k_frequent_elements.rs:84:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 84 |     pub fn top_k_frequent3(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `daily_temperatures2` is never used
[INFO] [stdout]   --> src/stack_and_queue/daily_temperatures.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn daily_temperatures2(t: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `StockSpanner` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/online_stock_span.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct StockSpanner {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `next` are never used
[INFO] [stdout]   --> src/stack_and_queue/online_stock_span.rs:37:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl StockSpanner {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 37 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn next(&mut self, price: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/remove_duplicate_letters.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicate_letters` is never used
[INFO] [stdout]   --> src/stack_and_queue/remove_duplicate_letters.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn remove_duplicate_letters(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/stack_and_queue/valid_parentheses.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid` and `is_valid2` are never used
[INFO] [stdout]   --> src/stack_and_queue/valid_parentheses.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn is_valid2(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/decode_string.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `decode_string` and `decode` are never used
[INFO] [stdout]   --> src/string/decode_string.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn decode_string(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn decode(repeat: usize, cs: &[char]) -> String {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/largest_number.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_number` is never used
[INFO] [stdout]   --> src/string/largest_number.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     pub fn largest_number(mut nums: Vec<i32>) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/longest_nice_substring.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_nice_substring` is never used
[INFO] [stdout]   --> src/string/longest_nice_substring.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn longest_nice_substring(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_palindrome2` and `is_palindrome3` are never used
[INFO] [stdout]   --> src/string/palindrome_number.rs:45:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 45 |     pub fn is_palindrome2(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     pub fn is_palindrome3(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/permutation_in_string.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_inclusion` is never used
[INFO] [stdout]   --> src/string/permutation_in_string.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     pub fn check_inclusion(s1: String, s2: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/repeated_string_match.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `repeated_string_match` is never used
[INFO] [stdout]   --> src/string/repeated_string_match.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn repeated_string_match(a: String, b: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/string/repeated_substring_pattern.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `repeated_substring_pattern` is never used
[INFO] [stdout]   --> src/string/repeated_substring_pattern.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn repeated_substring_pattern(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `recursive` is never used
[INFO] [stdout]   --> src/tree/binary_tree_inorder_traversal.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `recursive` is never used
[INFO] [stdout]   --> src/tree/binary_tree_postorder_traversal.rs:59:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 59 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `recursive` is never used
[INFO] [stdout]   --> src/tree/binary_tree_preorder_traversal.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_pruning.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `prune_tree` is never used
[INFO] [stdout]   --> src/tree/binary_tree_pruning.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn prune_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/binary_tree_right_side_view.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `right_side_view` is never used
[INFO] [stdout]   --> src/tree/binary_tree_right_side_view.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/convert_bst_to_greater_tree.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `convert_bst` and `dfs` are never used
[INFO] [stdout]   --> src/tree/convert_bst_to_greater_tree.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn convert_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn dfs(root: &mut Option<Rc<RefCell<TreeNode>>>, tmp: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/convert_sorted_array_to_binary_search_tree.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sorted_array_to_bst` and `creator` are never used
[INFO] [stdout]   --> src/tree/convert_sorted_array_to_binary_search_tree.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 23 |     pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn creator(nums: &Vec<i32>, l: i32, r: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/convert_sorted_list_to_binary_search_tree.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sorted_list_to_bst` and `creator` are never used
[INFO] [stdout]   --> src/tree/convert_sorted_list_to_binary_search_tree.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 38 |     pub fn sorted_list_to_bst(head: Option<Box<ListNode>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn creator(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/find_bottom_left_tree_value.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_bottom_left_value` is never used
[INFO] [stdout]   --> src/tree/find_bottom_left_tree_value.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/find_mode_in_binary_search_tree.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_mode`, `inorder`, and `check` are never used
[INFO] [stdout]   --> src/tree/find_mode_in_binary_search_tree.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn inorder(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 60 |     fn check(val: i32, res: &mut Vec<i32>, pre: &mut (Option<i32>, usize), count: &mut usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/house_robber_iii.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rob`, `dfs`, `rob2`, and `recursive` are never used
[INFO] [stdout]   --> src/tree/house_robber_iii.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn rob(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>) -> (i32, i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn rob2(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn recursive(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/invert_binary_tree.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]   --> src/tree/invert_binary_tree.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/kth_smallest_element_in_a_bst.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `kth_smallest`, `recursive`, `kth_smallest2`, and `recursive2` are never used
[INFO] [stdout]   --> src/tree/kth_smallest_element_in_a_bst.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn recursive(root: Option<Rc<RefCell<TreeNode>>>, list: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     pub fn kth_smallest2(root: Option<Rc<RefCell<TreeNode>>>, mut k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn recursive2(root: Option<Rc<RefCell<TreeNode>>>, k: &mut i32, res: &mut i32) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/longest_univalue_path.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_univalue_path` and `max_length` are never used
[INFO] [stdout]   --> src/tree/longest_univalue_path.rs:39:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn longest_univalue_path(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn max_length(root: &Option<Rc<RefCell<TreeNode>>>, pre_val: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `dfs` are never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 32 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, pv: i32, qv: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor`, `dfs`, `lowest_common_ancestor2`, and `dfs2` are never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, p: i32, q: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     pub fn lowest_common_ancestor2(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |     fn dfs2(root: &Option<Rc<RefCell<TreeNode>>>, target: i32, paths: &mut Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/merge_two_binary_trees.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_trees` is never used
[INFO] [stdout]   --> src/tree/merge_two_binary_trees.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn merge_trees(
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/minimum_absolute_difference_in_bst.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_minimum_difference` and `inorder` are never used
[INFO] [stdout]   --> src/tree/minimum_absolute_difference_in_bst.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn inorder(root: Option<Rc<RefCell<TreeNode>>>, pre: &mut Option<i32>, res: &mut i32) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/recover_binary_search_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `recover_tree` and `dfs` are never used
[INFO] [stdout]   --> src/tree/recover_binary_search_tree.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 26 |     pub fn recover_tree(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/same_tree.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/tree/same_tree.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/second_minimum_node_in_a_binary_tree.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_second_minimum_value` is never used
[INFO] [stdout]   --> src/tree/second_minimum_node_in_a_binary_tree.rs:39:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn find_second_minimum_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/subtree_of_another_tree.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_subtree` and `check` are never used
[INFO] [stdout]   --> src/tree/subtree_of_another_tree.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn is_subtree(s: Option<Rc<RefCell<TreeNode>>>, t: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn check(s: &Option<Rc<RefCell<TreeNode>>>, t: &Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `symmetric_loop` is never used
[INFO] [stdout]   --> src/tree/symmetric_tree.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 53 |     fn symmetric_loop(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/tree/two_sum_iv_input_is_a_bst.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_target` and `inorder` are never used
[INFO] [stdout]   --> src/tree/two_sum_iv_input_is_a_bst.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 40 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 41 |     // 时间复杂度O(n) 空间复杂度O(n)
[INFO] [stdout] 42 |     pub fn find_target(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn inorder(root: Option<Rc<RefCell<TreeNode>>>, values: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/linked_list_cycle.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `has_cycle` is never used
[INFO] [stdout]   --> src/two_point/linked_list_cycle.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn has_cycle(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/two_point/longest_substring_without_repeating_characters.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/two_point/longest_substring_without_repeating_characters.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge2` is never used
[INFO] [stdout]   --> src/two_point/merge_sorted_array.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn merge2(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/two_point/next_permutation.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_permutation` is never used
[INFO] [stdout]   --> src/two_point/next_permutation.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn next_permutation(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `addEdge` should have a snake case name
[INFO] [stdout]   --> src/base/graph.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 22 |     pub fn addEdge(&mut self, i: usize, j: usize) {
[INFO] [stdout]    |            ^^^^^^^ help: convert the identifier to snake case: `add_edge`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused return value of `Vec::<T, A>::split_off` that must be used
[INFO] [stdout]   --> src/easy/remove_duplicates_from_sorted_array.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |         nums.split_off(index);
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: use `.truncate()` if you don't need the other half
[INFO] [stdout]    = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]    |
[INFO] [stdout] 49 |         let _ = nums.split_off(index);
[INFO] [stdout]    |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `longURL` should have a snake case name
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:43:26
[INFO] [stdout]    |
[INFO] [stdout] 43 |     fn encode(&mut self, longURL: String) -> String {
[INFO] [stdout]    |                          ^^^^^^^ help: convert the identifier to snake case: `long_url`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `shortURL` should have a snake case name
[INFO] [stdout]   --> src/hash/encode_and_decode_tinyurl.rs:51:26
[INFO] [stdout]    |
[INFO] [stdout] 51 |     fn decode(&self, mut shortURL: String) -> String {
[INFO] [stdout]    |                          ^^^^^^^^ help: convert the identifier to snake case: `short_url`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `removeNode` should have a snake case name
[INFO] [stdout]   --> src/hash/lru_cache.rs:87:8
[INFO] [stdout]    |
[INFO] [stdout] 87 |     fn removeNode(&mut self, node: Rc<RefCell<Node>>) {
[INFO] [stdout]    |        ^^^^^^^^^^ help: convert the identifier to snake case: `remove_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `addNode` should have a snake case name
[INFO] [stdout]    --> src/hash/lru_cache.rs:111:8
[INFO] [stdout]     |
[INFO] [stdout] 111 |     fn addNode(&mut self, node: Rc<RefCell<Node>>) {
[INFO] [stdout]     |        ^^^^^^^ help: convert the identifier to snake case: `add_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 3.76s
[INFO] running `Command { std: "docker" "inspect" "e692f8102069adfb62b17fce99b77b84088dd784f1c8c73bb43c61284313778c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "e692f8102069adfb62b17fce99b77b84088dd784f1c8c73bb43c61284313778c", kill_on_drop: false }`
[INFO] [stdout] e692f8102069adfb62b17fce99b77b84088dd784f1c8c73bb43c61284313778c
