[INFO] cloning repository https://github.com/vickyone0/dsar
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/vickyone0/dsar" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fvickyone0%2Fdsar", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fvickyone0%2Fdsar'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 30d72da046b5f8a7782ecf5b783e19a514547389
[INFO] checking vickyone0/dsar against master#779e19d8baa3e3625bd4fc5c85cbb2ad47b43155 for pr-147589-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fvickyone0%2Fdsar" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/vickyone0/dsar
[INFO] finished tweaking git repo https://github.com/vickyone0/dsar
[INFO] tweaked toml for git repo https://github.com/vickyone0/dsar written to /workspace/builds/worker-7-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/vickyone0/dsar on toolchain 779e19d8baa3e3625bd4fc5c85cbb2ad47b43155
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/vickyone0/dsar 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" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 13faf7eced36b2aa9ce22c21230e68cbf5833c8c320ffdca5a75891eaba96191
[INFO] running `Command { std: "docker" "start" "-a" "13faf7eced36b2aa9ce22c21230e68cbf5833c8c320ffdca5a75891eaba96191", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "13faf7eced36b2aa9ce22c21230e68cbf5833c8c320ffdca5a75891eaba96191", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "13faf7eced36b2aa9ce22c21230e68cbf5833c8c320ffdca5a75891eaba96191", kill_on_drop: false }`
[INFO] [stdout] 13faf7eced36b2aa9ce22c21230e68cbf5833c8c320ffdca5a75891eaba96191
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 88c2289a0a483d70de5dd27e80e3c0841e1dd5e577285631407226ad86fa326e
[INFO] running `Command { std: "docker" "start" "-a" "88c2289a0a483d70de5dd27e80e3c0841e1dd5e577285631407226ad86fa326e", kill_on_drop: false }`
[INFO] [stderr]     Checking smallvec v1.15.1
[INFO] [stderr]    Compiling cc v1.2.27
[INFO] [stderr]    Compiling syn v2.0.103
[INFO] [stderr]     Checking socket2 v0.5.10
[INFO] [stderr]     Checking signal-hook-registry v1.4.5
[INFO] [stderr]     Checking mio v1.0.4
[INFO] [stderr]     Checking indexmap v2.9.0
[INFO] [stderr]     Checking futures-util v0.3.31
[INFO] [stderr]     Checking tracing v0.1.41
[INFO] [stderr]     Checking memchr v2.7.5
[INFO] [stderr]     Checking parking_lot_core v0.9.11
[INFO] [stderr]     Checking parking_lot v0.12.4
[INFO] [stderr]    Compiling openssl-sys v0.9.109
[INFO] [stderr]    Compiling openssl v0.10.73
[INFO] [stderr]    Compiling native-tls v0.2.14
[INFO] [stderr]    Compiling synstructure v0.13.2
[INFO] [stderr]    Compiling zerovec-derive v0.11.1
[INFO] [stderr]    Compiling displaydoc v0.2.5
[INFO] [stderr]    Compiling tokio-macros v2.5.0
[INFO] [stderr]    Compiling openssl-macros v0.1.1
[INFO] [stderr]    Compiling serde_derive v1.0.219
[INFO] [stderr]    Compiling zerofrom-derive v0.1.6
[INFO] [stderr]    Compiling yoke-derive v0.8.0
[INFO] [stderr]     Checking tokio v1.45.1
[INFO] [stderr]     Checking zerofrom v0.1.6
[INFO] [stderr]     Checking yoke v0.8.0
[INFO] [stderr]     Checking zerovec v0.11.2
[INFO] [stderr]     Checking zerotrie v0.2.2
[INFO] [stderr]     Checking tinystr v0.8.1
[INFO] [stderr]     Checking potential_utf v0.1.2
[INFO] [stderr]     Checking icu_collections v2.0.0
[INFO] [stderr]     Checking serde v1.0.219
[INFO] [stderr]     Checking icu_locale_core v2.0.0
[INFO] [stderr]     Checking icu_provider v2.0.0
[INFO] [stderr]     Checking icu_properties v2.0.1
[INFO] [stderr]     Checking icu_normalizer v2.0.0
[INFO] [stderr]     Checking idna_adapter v1.2.1
[INFO] [stderr]     Checking tokio-util v0.7.15
[INFO] [stderr]     Checking tokio-native-tls v0.3.1
[INFO] [stderr]     Checking idna v1.0.3
[INFO] [stderr]     Checking url v2.5.4
[INFO] [stderr]     Checking h2 v0.3.26
[INFO] [stderr]     Checking serde_urlencoded v0.7.1
[INFO] [stderr]     Checking serde_json v1.0.140
[INFO] [stderr]     Checking hyper v0.14.32
[INFO] [stderr]     Checking hyper-tls v0.5.0
[INFO] [stderr]     Checking reqwest v0.11.27
[INFO] [stderr]     Checking dsar v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/linkedlist.rs:115:21
[INFO] [stdout]     |
[INFO] [stdout] 115 |                 let mut next = node.next.take();
[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: field `data` is never read
[INFO] [stdout]   --> src/linkedlist.rs:83:5
[INFO] [stdout]    |
[INFO] [stdout] 82 | pub struct Node {
[INFO] [stdout]    |            ---- field in this struct
[INFO] [stdout] 83 |     data: i32,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/linkedlist.rs:115:21
[INFO] [stdout]     |
[INFO] [stdout] 115 |                 let mut next = node.next.take();
[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: field `data` is never read
[INFO] [stdout]   --> src/linkedlist.rs:83:5
[INFO] [stdout]    |
[INFO] [stdout] 82 | pub struct Node {
[INFO] [stdout]    |            ---- field in this struct
[INFO] [stdout] 83 |     data: i32,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::result`
[INFO] [stdout]   --> src/main.rs:69:5
[INFO] [stdout]    |
[INFO] [stdout] 69 | use std::result;
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::bubblesort::bubble_sort`
[INFO] [stdout]   --> src/main.rs:74:5
[INFO] [stdout]    |
[INFO] [stdout] 74 | use crate::bubblesort::bubble_sort;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::option`
[INFO] [stdout]  --> src/twosumsorted.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::option;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `two_sum`
[INFO] [stdout]   --> src/main.rs:78:27
[INFO] [stdout]    |
[INFO] [stdout] 78 | use crate::twosumsorted::{two_sum, two_sum_sorted};
[INFO] [stdout]    |                           ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `recursion_power_logn` and `recursion`
[INFO] [stdout]   --> src/main.rs:84:24
[INFO] [stdout]    |
[INFO] [stdout] 84 | use crate::recursion::{recursion,recursion_power_logn};
[INFO] [stdout]    |                        ^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::backtracking::n_queen`
[INFO] [stdout]   --> src/main.rs:86:5
[INFO] [stdout]    |
[INFO] [stdout] 86 | use crate::backtracking::n_queen;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `TreeNode`, `binary_search`, `insert_bst`, and `rsa_min_value`
[INFO] [stdout]   --> src/main.rs:88:27
[INFO] [stdout]    |
[INFO] [stdout] 88 | use crate::binarysearch::{binary_search, rsa_min_value,insert_bst,TreeNode};
[INFO] [stdout]    |                           ^^^^^^^^^^^^^  ^^^^^^^^^^^^^ ^^^^^^^^^^ ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::mergesort::merge_sort`
[INFO] [stdout]   --> src/main.rs:90:5
[INFO] [stdout]    |
[INFO] [stdout] 90 | use crate::mergesort::merge_sort;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::insertionsort::insertion_sort`
[INFO] [stdout]   --> src/main.rs:94:5
[INFO] [stdout]    |
[INFO] [stdout] 94 | use crate::insertionsort::insertion_sort;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::stack::stacked`
[INFO] [stdout]   --> src/main.rs:98:5
[INFO] [stdout]    |
[INFO] [stdout] 98 | use crate::stack::stacked;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `find_min_max`, `find_path`, and `size`
[INFO] [stdout]    --> src/main.rs:100:25
[INFO] [stdout]     |
[INFO] [stdout] 100 | use crate::binarytree::{size, find_min_max, find_path};
[INFO] [stdout]     |                         ^^^^  ^^^^^^^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `has_zero_subarray`, `longest_zero_sum_subarray`, and `two_sums`
[INFO] [stdout]    --> src/main.rs:102:22
[INFO] [stdout]     |
[INFO] [stdout] 102 | use crate::hashmap::{has_zero_subarray, count_zero_sum_subarrays,longest_zero_sum_subarray, longest_consecutive, hash_insert, two_sums,le...
[INFO] [stdout]     |                      ^^^^^^^^^^^^^^^^^                           ^^^^^^^^^^^^^^^^^^^^^^^^^                                    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fmt::format`
[INFO] [stdout]  --> src/graph.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fmt::format;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `num_of_island` and `oranges_rotting`
[INFO] [stdout]    --> src/main.rs:104:20
[INFO] [stdout]     |
[INFO] [stdout] 104 | use crate::graph::{num_of_island,oranges_rotting};
[INFO] [stdout]     |                    ^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::pipeline::pipe_line`
[INFO] [stdout]    --> src/main.rs:106:5
[INFO] [stdout]     |
[INFO] [stdout] 106 | use crate::pipeline::pipe_line;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::result`
[INFO] [stdout]   --> src/main.rs:69:5
[INFO] [stdout]    |
[INFO] [stdout] 69 | use std::result;
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::bubblesort::bubble_sort`
[INFO] [stdout]   --> src/main.rs:74:5
[INFO] [stdout]    |
[INFO] [stdout] 74 | use crate::bubblesort::bubble_sort;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::option`
[INFO] [stdout]  --> src/twosumsorted.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::option;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `two_sum`
[INFO] [stdout]   --> src/main.rs:78:27
[INFO] [stdout]    |
[INFO] [stdout] 78 | use crate::twosumsorted::{two_sum, two_sum_sorted};
[INFO] [stdout]    |                           ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `recursion_power_logn` and `recursion`
[INFO] [stdout]   --> src/main.rs:84:24
[INFO] [stdout]    |
[INFO] [stdout] 84 | use crate::recursion::{recursion,recursion_power_logn};
[INFO] [stdout]    |                        ^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::backtracking::n_queen`
[INFO] [stdout]   --> src/main.rs:86:5
[INFO] [stdout]    |
[INFO] [stdout] 86 | use crate::backtracking::n_queen;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `TreeNode`, `binary_search`, `insert_bst`, and `rsa_min_value`
[INFO] [stdout]   --> src/main.rs:88:27
[INFO] [stdout]    |
[INFO] [stdout] 88 | use crate::binarysearch::{binary_search, rsa_min_value,insert_bst,TreeNode};
[INFO] [stdout]    |                           ^^^^^^^^^^^^^  ^^^^^^^^^^^^^ ^^^^^^^^^^ ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::mergesort::merge_sort`
[INFO] [stdout]   --> src/main.rs:90:5
[INFO] [stdout]    |
[INFO] [stdout] 90 | use crate::mergesort::merge_sort;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::insertionsort::insertion_sort`
[INFO] [stdout]   --> src/main.rs:94:5
[INFO] [stdout]    |
[INFO] [stdout] 94 | use crate::insertionsort::insertion_sort;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::stack::stacked`
[INFO] [stdout]   --> src/main.rs:98:5
[INFO] [stdout]    |
[INFO] [stdout] 98 | use crate::stack::stacked;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `find_min_max`, `find_path`, and `size`
[INFO] [stdout]    --> src/main.rs:100:25
[INFO] [stdout]     |
[INFO] [stdout] 100 | use crate::binarytree::{size, find_min_max, find_path};
[INFO] [stdout]     |                         ^^^^  ^^^^^^^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `has_zero_subarray`, `longest_zero_sum_subarray`, and `two_sums`
[INFO] [stdout]    --> src/main.rs:102:22
[INFO] [stdout]     |
[INFO] [stdout] 102 | use crate::hashmap::{has_zero_subarray, count_zero_sum_subarrays,longest_zero_sum_subarray, longest_consecutive, hash_insert, two_sums,le...
[INFO] [stdout]     |                      ^^^^^^^^^^^^^^^^^                           ^^^^^^^^^^^^^^^^^^^^^^^^^                                    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fmt::format`
[INFO] [stdout]  --> src/graph.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fmt::format;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `num_of_island` and `oranges_rotting`
[INFO] [stdout]    --> src/main.rs:104:20
[INFO] [stdout]     |
[INFO] [stdout] 104 | use crate::graph::{num_of_island,oranges_rotting};
[INFO] [stdout]     |                    ^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::pipeline::pipe_line`
[INFO] [stdout]    --> src/main.rs:106:5
[INFO] [stdout]     |
[INFO] [stdout] 106 | use crate::pipeline::pipe_line;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable statement
[INFO] [stdout]   --> src/recursion.rs:31:5
[INFO] [stdout]    |
[INFO] [stdout] 24 |          return half * half;
[INFO] [stdout]    |          ------------------ any code following this expression is unreachable
[INFO] [stdout] ...
[INFO] [stdout] 31 |     return a;
[INFO] [stdout]    |     ^^^^^^^^^ unreachable statement
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unreachable_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable statement
[INFO] [stdout]   --> src/recursion.rs:31:5
[INFO] [stdout]    |
[INFO] [stdout] 24 |          return half * half;
[INFO] [stdout]    |          ------------------ any code following this expression is unreachable
[INFO] [stdout] ...
[INFO] [stdout] 31 |     return a;
[INFO] [stdout]    |     ^^^^^^^^^ unreachable statement
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unreachable_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/mergesort.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(mut arr: Vec<i32>) -> Vec<i32> {
[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: variable does not need to be mutable
[INFO] [stdout]  --> src/mergesort.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(mut arr: Vec<i32>) -> Vec<i32> {
[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: variable does not need to be mutable
[INFO] [stdout]   --> src/insertionsort.rs:24:13
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let mut temp = arr[i];
[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/linkedlist.rs:115:21
[INFO] [stdout]     |
[INFO] [stdout] 115 |                 let mut next = node.next.take();
[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/insertionsort.rs:24:13
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let mut temp = arr[i];
[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/linkedlist.rs:115:21
[INFO] [stdout]     |
[INFO] [stdout] 115 |                 let mut next = node.next.take();
[INFO] [stdout]     |                     ----^^^^
[INFO] [stdout]     |                     |
[INFO] [stdout]     |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `maps`
[INFO] [stdout]    --> src/hashmap.rs:215:5
[INFO] [stdout]     |
[INFO] [stdout] 215 | let maps: HashMap<_, _> = fruits.into_iter().collect();
[INFO] [stdout]     |     ^^^^ help: if this is intentional, prefix it with an underscore: `_maps`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `maps`
[INFO] [stdout]    --> src/hashmap.rs:215:5
[INFO] [stdout]     |
[INFO] [stdout] 215 | let maps: HashMap<_, _> = fruits.into_iter().collect();
[INFO] [stdout]     |     ^^^^ help: if this is intentional, prefix it with an underscore: `_maps`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]   --> src/bubblesort.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn bubble_sort(arr: &mut [i32]) -> & [i32] {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/twosumsorted.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn two_sum(arr: &[i32], tar: i32) -> (usize,usize){
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursion` is never used
[INFO] [stdout]  --> src/recursion.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn recursion(num:i32) -> i32{
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursion_power_logn` is never used
[INFO] [stdout]   --> src/recursion.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn recursion_power_logn(a:i32, n:i32) -> i32{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `n_queen` is never used
[INFO] [stdout]  --> src/backtracking.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn n_queen(n:i32)-> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve_n_queens` is never used
[INFO] [stdout]   --> src/backtracking.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn solve_n_queens(board: &mut Vec<i32>, row: i32, n: i32, solutions: &mut Vec<Vec<String>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_safe` is never used
[INFO] [stdout]   --> src/backtracking.rs:33:4
[INFO] [stdout]    |
[INFO] [stdout] 33 | fn is_safe(board: & Vec<i32>, row: i32, col: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/binarysearch.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(arr: &[i32], tar: i32) -> Option<usize>{
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rsa_min_value` is never used
[INFO] [stdout]   --> src/binarysearch.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub fn rsa_min_value(arr: &[i32]) -> i32{
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/binarysearch.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub struct TreeNode {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binarysearch.rs:53:12
[INFO] [stdout]    |
[INFO] [stdout] 52 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 53 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert_bst` is never used
[INFO] [stdout]   --> src/binarysearch.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub fn insert_bst(root: &mut Option<Box<TreeNode>>, val: i32) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/mergesort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(mut arr: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/mergesort.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn merge(left: Vec<i32>, right: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]   --> src/insertionsort.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn insertion_sort(arr:&mut [i32]) -> &[i32]{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/linkedlist.rs:82:12
[INFO] [stdout]    |
[INFO] [stdout] 82 | pub struct Node {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Linkedlist` is never constructed
[INFO] [stdout]   --> src/linkedlist.rs:87:12
[INFO] [stdout]    |
[INFO] [stdout] 87 | pub struct Linkedlist {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `push_front` are never used
[INFO] [stdout]   --> src/linkedlist.rs:94:12
[INFO] [stdout]    |
[INFO] [stdout] 92 | impl Linkedlist {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 93 |
[INFO] [stdout] 94 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 98 |     pub fn push_front(&mut self, data: i32) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_linked_list` is never used
[INFO] [stdout]    --> src/linkedlist.rs:109:8
[INFO] [stdout]     |
[INFO] [stdout] 109 | pub fn reverse_linked_list(mut list: Linkedlist) -> Linkedlist {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `stacked` is never used
[INFO] [stdout]  --> src/stack.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn stacked() {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/binarytree.rs:94:12
[INFO] [stdout]    |
[INFO] [stdout] 94 | pub struct TreeNode {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/binarytree.rs:101:11
[INFO] [stdout]     |
[INFO] [stdout] 100 | impl TreeNode {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 101 |    pub fn new(val: i32) -> Self {
[INFO] [stdout]     |           ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `size` is never used
[INFO] [stdout]    --> src/binarytree.rs:106:8
[INFO] [stdout]     |
[INFO] [stdout] 106 | pub fn size(root: &Option<Box<TreeNode>>) -> usize {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min_max` is never used
[INFO] [stdout]    --> src/binarytree.rs:113:8
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn find_min_max(root: &Option<Box<TreeNode>>) -> Option<(i32, i32)>{
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_path` is never used
[INFO] [stdout]    --> src/binarytree.rs:136:8
[INFO] [stdout]     |
[INFO] [stdout] 136 | pub fn find_path(root: &Option<Box<TreeNode>>, target:i32, path: &mut Vec<i32>) -> bool{
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_zero_sum_subarray` is never used
[INFO] [stdout]   --> src/hashmap.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub fn longest_zero_sum_subarray(arr: &[i32]) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_zero_subarray` is never used
[INFO] [stdout]    --> src/hashmap.rs:120:8
[INFO] [stdout]     |
[INFO] [stdout] 120 | pub fn has_zero_subarray(arr: &[i32]) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sums` is never used
[INFO] [stdout]    --> src/hashmap.rs:220:8
[INFO] [stdout]     |
[INFO] [stdout] 220 | pub fn two_sums(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `first_unique_char` is never used
[INFO] [stdout]    --> src/hashmap.rs:311:8
[INFO] [stdout]     |
[INFO] [stdout] 311 | pub fn first_unique_char(s: String) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent` is never used
[INFO] [stdout]    --> src/hashmap.rs:332:8
[INFO] [stdout]     |
[INFO] [stdout] 332 | pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_of_island` is never used
[INFO] [stdout]  --> src/graph.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn num_of_island(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `oranges_rotting` is never used
[INFO] [stdout]   --> src/graph.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn oranges_rotting(mut grid:Vec<Vec<i32>>) -> i32{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NewsArticle` is never constructed
[INFO] [stdout]   --> src/graph.rs:99:12
[INFO] [stdout]    |
[INFO] [stdout] 99 | pub struct NewsArticle {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `Summary` is never used
[INFO] [stdout]    --> src/graph.rs:106:11
[INFO] [stdout]     |
[INFO] [stdout] 106 | pub trait Summary {
[INFO] [stdout]     |           ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SocialPost` is never constructed
[INFO] [stdout]    --> src/graph.rs:118:12
[INFO] [stdout]     |
[INFO] [stdout] 118 | pub struct SocialPost {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pipe_line` is never used
[INFO] [stdout]   --> src/pipeline.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub fn pipe_line(){
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]   --> src/bubblesort.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn bubble_sort(arr: &mut [i32]) -> & [i32] {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/twosumsorted.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn two_sum(arr: &[i32], tar: i32) -> (usize,usize){
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursion` is never used
[INFO] [stdout]  --> src/recursion.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn recursion(num:i32) -> i32{
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursion_power_logn` is never used
[INFO] [stdout]   --> src/recursion.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn recursion_power_logn(a:i32, n:i32) -> i32{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `n_queen` is never used
[INFO] [stdout]  --> src/backtracking.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn n_queen(n:i32)-> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve_n_queens` is never used
[INFO] [stdout]   --> src/backtracking.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn solve_n_queens(board: &mut Vec<i32>, row: i32, n: i32, solutions: &mut Vec<Vec<String>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_safe` is never used
[INFO] [stdout]   --> src/backtracking.rs:33:4
[INFO] [stdout]    |
[INFO] [stdout] 33 | fn is_safe(board: & Vec<i32>, row: i32, col: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/binarysearch.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(arr: &[i32], tar: i32) -> Option<usize>{
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rsa_min_value` is never used
[INFO] [stdout]   --> src/binarysearch.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub fn rsa_min_value(arr: &[i32]) -> i32{
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/binarysearch.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub struct TreeNode {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binarysearch.rs:53:12
[INFO] [stdout]    |
[INFO] [stdout] 52 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 53 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert_bst` is never used
[INFO] [stdout]   --> src/binarysearch.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub fn insert_bst(root: &mut Option<Box<TreeNode>>, val: i32) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/mergesort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(mut arr: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/mergesort.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn merge(left: Vec<i32>, right: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]   --> src/insertionsort.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn insertion_sort(arr:&mut [i32]) -> &[i32]{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/linkedlist.rs:82:12
[INFO] [stdout]    |
[INFO] [stdout] 82 | pub struct Node {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Linkedlist` is never constructed
[INFO] [stdout]   --> src/linkedlist.rs:87:12
[INFO] [stdout]    |
[INFO] [stdout] 87 | pub struct Linkedlist {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `push_front` are never used
[INFO] [stdout]   --> src/linkedlist.rs:94:12
[INFO] [stdout]    |
[INFO] [stdout] 92 | impl Linkedlist {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 93 |
[INFO] [stdout] 94 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 98 |     pub fn push_front(&mut self, data: i32) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_linked_list` is never used
[INFO] [stdout]    --> src/linkedlist.rs:109:8
[INFO] [stdout]     |
[INFO] [stdout] 109 | pub fn reverse_linked_list(mut list: Linkedlist) -> Linkedlist {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `stacked` is never used
[INFO] [stdout]  --> src/stack.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn stacked() {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/binarytree.rs:94:12
[INFO] [stdout]    |
[INFO] [stdout] 94 | pub struct TreeNode {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/binarytree.rs:101:11
[INFO] [stdout]     |
[INFO] [stdout] 100 | impl TreeNode {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 101 |    pub fn new(val: i32) -> Self {
[INFO] [stdout]     |           ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `size` is never used
[INFO] [stdout]    --> src/binarytree.rs:106:8
[INFO] [stdout]     |
[INFO] [stdout] 106 | pub fn size(root: &Option<Box<TreeNode>>) -> usize {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min_max` is never used
[INFO] [stdout]    --> src/binarytree.rs:113:8
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn find_min_max(root: &Option<Box<TreeNode>>) -> Option<(i32, i32)>{
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_path` is never used
[INFO] [stdout]    --> src/binarytree.rs:136:8
[INFO] [stdout]     |
[INFO] [stdout] 136 | pub fn find_path(root: &Option<Box<TreeNode>>, target:i32, path: &mut Vec<i32>) -> bool{
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_zero_sum_subarray` is never used
[INFO] [stdout]   --> src/hashmap.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub fn longest_zero_sum_subarray(arr: &[i32]) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_zero_subarray` is never used
[INFO] [stdout]    --> src/hashmap.rs:120:8
[INFO] [stdout]     |
[INFO] [stdout] 120 | pub fn has_zero_subarray(arr: &[i32]) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sums` is never used
[INFO] [stdout]    --> src/hashmap.rs:220:8
[INFO] [stdout]     |
[INFO] [stdout] 220 | pub fn two_sums(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `first_unique_char` is never used
[INFO] [stdout]    --> src/hashmap.rs:311:8
[INFO] [stdout]     |
[INFO] [stdout] 311 | pub fn first_unique_char(s: String) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent` is never used
[INFO] [stdout]    --> src/hashmap.rs:332:8
[INFO] [stdout]     |
[INFO] [stdout] 332 | pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_of_island` is never used
[INFO] [stdout]  --> src/graph.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn num_of_island(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `oranges_rotting` is never used
[INFO] [stdout]   --> src/graph.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn oranges_rotting(mut grid:Vec<Vec<i32>>) -> i32{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NewsArticle` is never constructed
[INFO] [stdout]   --> src/graph.rs:99:12
[INFO] [stdout]    |
[INFO] [stdout] 99 | pub struct NewsArticle {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `Summary` is never used
[INFO] [stdout]    --> src/graph.rs:106:11
[INFO] [stdout]     |
[INFO] [stdout] 106 | pub trait Summary {
[INFO] [stdout]     |           ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SocialPost` is never constructed
[INFO] [stdout]    --> src/graph.rs:118:12
[INFO] [stdout]     |
[INFO] [stdout] 118 | pub struct SocialPost {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pipe_line` is never used
[INFO] [stdout]   --> src/pipeline.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub fn pipe_line(){
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 24.33s
[INFO] running `Command { std: "docker" "inspect" "88c2289a0a483d70de5dd27e80e3c0841e1dd5e577285631407226ad86fa326e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "88c2289a0a483d70de5dd27e80e3c0841e1dd5e577285631407226ad86fa326e", kill_on_drop: false }`
[INFO] [stdout] 88c2289a0a483d70de5dd27e80e3c0841e1dd5e577285631407226ad86fa326e