[INFO] cloning repository https://github.com/iLeepop/data_structures_algorithms
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/iLeepop/data_structures_algorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FiLeepop%2Fdata_structures_algorithms", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FiLeepop%2Fdata_structures_algorithms'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 27a41b6d795157a766ef38e518fab34a9c30767b
[INFO] checking iLeepop/data_structures_algorithms against master#cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3 for pr-135841
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FiLeepop%2Fdata_structures_algorithms" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/iLeepop/data_structures_algorithms on toolchain cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/iLeepop/data_structures_algorithms
[INFO] finished tweaking git repo https://github.com/iLeepop/data_structures_algorithms
[INFO] tweaked toml for git repo https://github.com/iLeepop/data_structures_algorithms written to /workspace/builds/worker-7-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/iLeepop/data_structures_algorithms 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" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[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:c80049f3b88b82089a44e0f06d0d6029d44b96b7257e55a1cd63dbc9f4c33334" "/opt/rustwide/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] b2391b3fe564d13d1dfc217856b02cc285dc1077c6f8d7567f7c66ee25b8b5fd
[INFO] running `Command { std: "docker" "start" "-a" "b2391b3fe564d13d1dfc217856b02cc285dc1077c6f8d7567f7c66ee25b8b5fd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "b2391b3fe564d13d1dfc217856b02cc285dc1077c6f8d7567f7c66ee25b8b5fd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b2391b3fe564d13d1dfc217856b02cc285dc1077c6f8d7567f7c66ee25b8b5fd", kill_on_drop: false }`
[INFO] [stdout] b2391b3fe564d13d1dfc217856b02cc285dc1077c6f8d7567f7c66ee25b8b5fd
[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:c80049f3b88b82089a44e0f06d0d6029d44b96b7257e55a1cd63dbc9f4c33334" "/opt/rustwide/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 464c43cd7208edf9b6854bd61489a13fe8b1b856b089b739ebf8e9a2c59d2449
[INFO] running `Command { std: "docker" "start" "-a" "464c43cd7208edf9b6854bd61489a13fe8b1b856b089b739ebf8e9a2c59d2449", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.87
[INFO] [stderr]    Compiling unicode-ident v1.0.13
[INFO] [stderr]    Compiling libc v0.2.159
[INFO] [stderr]     Checking byteorder v1.5.0
[INFO] [stderr]     Checking cfg-if v1.0.0
[INFO] [stderr]    Compiling quote v1.0.37
[INFO] [stderr]     Checking getrandom v0.2.15
[INFO] [stderr]    Compiling syn v2.0.79
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]    Compiling zerocopy-derive v0.7.35
[INFO] [stderr]     Checking zerocopy v0.7.35
[INFO] [stderr]     Checking ppv-lite86 v0.2.20
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking data_structures_algorithms v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `linked_list::*`
[INFO] [stdout]  --> src/data/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use linked_list::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `list_stack::Stack as ListStack`
[INFO] [stdout]   --> src/data/mod.rs:10:9
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub use list_stack::Stack as ListStack;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `lvec::*`
[INFO] [stdout]   --> src/data/mod.rs:11:9
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub use lvec::*;
[INFO] [stdout]    |         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `divide_by_two::*`
[INFO] [stdout]  --> src/utils/mod.rs:8:9
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub use divide_by_two::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `hot_potato::*`
[INFO] [stdout]  --> src/utils/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use hot_potato::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `infix_to_postfix::*`
[INFO] [stdout]   --> src/utils/mod.rs:10:9
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub use infix_to_postfix::*;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `pal_checker::*`
[INFO] [stdout]   --> src/utils/mod.rs:11:9
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub use pal_checker::*;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `random_vec::*`
[INFO] [stdout]   --> src/utils/mod.rs:13:9
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub use random_vec::*;
[INFO] [stdout]    |         ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/way/quick_sort.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `binary_search::*`
[INFO] [stdout]  --> src/way/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use binary_search::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rand::seq::index`
[INFO] [stdout]  --> src/sort/radix_sort.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use rand::seq::index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `f32::MIN`
[INFO] [stdout]  --> src/sort/tim_sort_without_gallop.rs:3:11
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::{f32::MIN, isize};
[INFO] [stdout]   |           ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `bubble_sort::*`
[INFO] [stdout]   --> src/sort/mod.rs:17:9
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub use bubble_sort::*;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `quick_sort::*`
[INFO] [stdout]   --> src/sort/mod.rs:18:9
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub use quick_sort::*;
[INFO] [stdout]    |         ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `way::*`
[INFO] [stdout]  --> src/main.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use way::*;
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `sort::*`
[INFO] [stdout]  --> src/main.rs:9:5
[INFO] [stdout]   |
[INFO] [stdout] 9 | use sort::*;
[INFO] [stdout]   |     ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `linked_list::*`
[INFO] [stdout]  --> src/data/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use linked_list::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `list_stack::Stack as ListStack`
[INFO] [stdout]   --> src/data/mod.rs:10:9
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub use list_stack::Stack as ListStack;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `lvec::*`
[INFO] [stdout]   --> src/data/mod.rs:11:9
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub use lvec::*;
[INFO] [stdout]    |         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `divide_by_two::*`
[INFO] [stdout]  --> src/utils/mod.rs:8:9
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub use divide_by_two::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `hot_potato::*`
[INFO] [stdout]  --> src/utils/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use hot_potato::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `infix_to_postfix::*`
[INFO] [stdout]   --> src/utils/mod.rs:10:9
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub use infix_to_postfix::*;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `pal_checker::*`
[INFO] [stdout]   --> src/utils/mod.rs:11:9
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub use pal_checker::*;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/way/quick_sort.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]    --> src/way/recursion.rs:171:9
[INFO] [stdout]     |
[INFO] [stdout] 171 |     use core::num;
[INFO] [stdout]     |         ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `binary_search::*`
[INFO] [stdout]  --> src/way/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use binary_search::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::random_vec`
[INFO] [stdout]   --> src/sort/counting_sort.rs:26:9
[INFO] [stdout]    |
[INFO] [stdout] 26 |     use crate::random_vec;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rand::seq::index`
[INFO] [stdout]  --> src/sort/radix_sort.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use rand::seq::index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `f32::MIN`
[INFO] [stdout]  --> src/sort/tim_sort_without_gallop.rs:3:11
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::{f32::MIN, isize};
[INFO] [stdout]   |           ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `way::*`
[INFO] [stdout]  --> src/main.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use way::*;
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Deque` is never constructed
[INFO] [stdout]  --> src/data/deque.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct Deque<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Deque` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/data/deque.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl<T> Deque<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 11 |     pub fn new(cap: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn add_front(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn add_rear(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn remove_front(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     pub fn remove_rear(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/data/linked_list.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl<T> List<T> {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 18 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn push(&mut self, elem: T) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn peek(&self) -> Option<&T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     pub fn peek_mut(&mut self) -> Option<&mut T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     pub fn into_iter(self) -> IntoIter<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data/list_stack.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct Node<T> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]   --> src/data/list_stack.rs:10:10
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub type Link<T> = Option<Box<Node<T>>>;
[INFO] [stdout]    |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data/list_stack.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn new(data: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Stack` is never constructed
[INFO] [stdout]   --> src/data/list_stack.rs:22:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub struct Stack<T> {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Stack` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, `is_empty`, and `size` are never used
[INFO] [stdout]   --> src/data/list_stack.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl<T: Clone> Stack<T> {
[INFO] [stdout]    | ----------------------- associated items in this implementation
[INFO] [stdout] 28 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn push(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn peek(&self) -> Option<&T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data/lvec.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Node<T> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]   --> src/data/lvec.rs:12:10
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub type Link<T> = Option<Box<Node<T>>>;
[INFO] [stdout]    |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data/lvec.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn new(elem: T) -> Node<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LVec` is never constructed
[INFO] [stdout]   --> src/data/lvec.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub struct LVec<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `LVec` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/data/lvec.rs:27:12
[INFO] [stdout]     |
[INFO] [stdout] 26  | impl<T: Copy + Debug> LVec<T> {
[INFO] [stdout]     | ----------------------------- associated items in this implementation
[INFO] [stdout] 27  |     pub fn new() -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |     pub fn clear(&mut self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39  |     pub fn len(&self) -> usize {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43  |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47  |     pub fn push(&mut self, elem: T) {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65  |     pub fn append(&mut self, other: &mut Self) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73  |     pub fn insert(&mut self, mut index: usize, elem: T) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95  |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 99  |     pub fn remove(&mut self, index: usize) -> Option<T> {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 121 |     pub fn print_lvec(&self) {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/data/queue.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct Queue<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Queue` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `size` are never used
[INFO] [stdout]   --> src/data/queue.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 11 |     pub fn new(size: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn enqueue(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Stack` is never constructed
[INFO] [stdout]  --> src/data/stack.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct Stack<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Stack` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, `is_empty`, and `size` are never used
[INFO] [stdout]   --> src/data/stack.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl<T> Stack<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 11 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn push(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn peek(&self) -> Option<&T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `divide_by_two` is never used
[INFO] [stdout]  --> src/utils/divide_by_two.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn divide_by_two(mut dec_num: u32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `base_convert` is never used
[INFO] [stdout]   --> src/utils/divide_by_two.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn base_convert(mut dec_num: u32, base: u32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hot_potato` is never used
[INFO] [stdout]  --> src/utils/hot_potato.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn hot_potato(names: Vec<&str>, num: usize) -> &str {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `infix_to_postfix` is never used
[INFO] [stdout]  --> src/utils/infix_to_postfix.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn infix_to_postfix(infix: &str) -> Option<String> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postfix_eval` is never used
[INFO] [stdout]   --> src/utils/infix_to_postfix.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | pub fn postfix_eval(postfix: &str) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pal_checker` is never used
[INFO] [stdout]  --> src/utils/pal_checker.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn pal_checker(pal: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_match` is never used
[INFO] [stdout]  --> src/utils/par_checker.rs:6:4
[INFO] [stdout]   |
[INFO] [stdout] 6 | fn par_match(open: char, close: char) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker` is never used
[INFO] [stdout]   --> src/utils/par_checker.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn par_checker(par: &str) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `random_vec` is never used
[INFO] [stdout]  --> src/utils/random_vec.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn random_vec(len: usize, max: i32, min: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search1` is never used
[INFO] [stdout]  --> src/way/binary_search.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn binary_search1(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search2` is never used
[INFO] [stdout]   --> src/way/binary_search.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn binary_search2(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exponential_search` is never used
[INFO] [stdout]  --> src/way/exponential_search.rs:6:4
[INFO] [stdout]   |
[INFO] [stdout] 6 | fn exponential_search(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hash1` is never used
[INFO] [stdout]  --> src/way/hash.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn hash1(astr: &str, size: usize) -> usize {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `HashMap` is never constructed
[INFO] [stdout]   --> src/way/hash.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct HashMap<T> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/way/hash.rs:17:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl<T: Clone + PartialEq + Default> HashMap<T> {
[INFO] [stdout]     | ----------------------------------------------- associated items in this implementation
[INFO] [stdout] 17  |     fn new(size: usize) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |     fn hash(&self, key: usize) -> usize {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31  |     fn rehash(&self, pos: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     fn insert(&mut self, key: usize, value: T) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62  |     fn remove(&mut self, key: usize) -> Option<T> {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 98  |     fn get(&self, key: usize) -> Option<&T> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 123 |     fn contains(&self, key: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 130 |     fn len(&self) -> usize {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `interpolation_search` is never used
[INFO] [stdout]  --> src/way/interpolation_search.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn interpolation_search(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]  --> src/way/quick_sort.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn quick_sort(a: &mut [i32], low: usize, high: usize) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort_rec` is never used
[INFO] [stdout]   --> src/way/quick_sort.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn quick_sort_rec(nums: &mut [i32], low: usize, high: usize) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maopao` is never used
[INFO] [stdout]   --> src/way/quick_sort.rs:37:4
[INFO] [stdout]    |
[INFO] [stdout] 37 | fn maopao(a: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `nums_sum1` is never used
[INFO] [stdout]  --> src/way/recursion.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn nums_sum1(nums: &[i32]) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `nums_sum2` is never used
[INFO] [stdout]   --> src/way/recursion.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn nums_sum2(nums: &[i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `nums_sum1_t` is never used
[INFO] [stdout]   --> src/way/recursion.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn nums_sum1_t(num: i32, nums: &[i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `BASESTR` is never used
[INFO] [stdout]   --> src/way/recursion.rs:35:7
[INFO] [stdout]    |
[INFO] [stdout] 35 | const BASESTR: [&str; 16] = [
[INFO] [stdout]    |       ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num2str_rec` is never used
[INFO] [stdout]   --> src/way/recursion.rs:39:4
[INFO] [stdout]    |
[INFO] [stdout] 39 | fn num2str_rec(num: i32, base: i32) -> String {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hanoi` is never used
[INFO] [stdout]   --> src/way/recursion.rs:48:4
[INFO] [stdout]    |
[INFO] [stdout] 48 | fn hanoi(height: usize, from: &str, to: &str, other: &str) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rec_mc1` is never used
[INFO] [stdout]   --> src/way/recursion.rs:57:4
[INFO] [stdout]    |
[INFO] [stdout] 57 | fn rec_mc1(cashes: &[u32], amount: u32) -> u32 {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rec_mc2` is never used
[INFO] [stdout]   --> src/way/recursion.rs:78:4
[INFO] [stdout]    |
[INFO] [stdout] 78 | fn rec_mc2(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dp_rec_mc` is never used
[INFO] [stdout]    --> src/way/recursion.rs:103:4
[INFO] [stdout]     |
[INFO] [stdout] 103 | fn dp_rec_mc(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 {
[INFO] [stdout]     |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dp_rec_mc_show` is never used
[INFO] [stdout]    --> src/way/recursion.rs:118:4
[INFO] [stdout]     |
[INFO] [stdout] 118 | fn dp_rec_mc_show(
[INFO] [stdout]     |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_cashes` is never used
[INFO] [stdout]    --> src/way/recursion.rs:141:4
[INFO] [stdout]     |
[INFO] [stdout] 141 | fn print_cashes(cashes_used: &[u32], mut amount: u32) {
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fibnacci_rec` is never used
[INFO] [stdout]    --> src/way/recursion.rs:149:4
[INFO] [stdout]     |
[INFO] [stdout] 149 | fn fibnacci_rec(n: u32) -> u32 {
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fibnacci_dp` is never used
[INFO] [stdout]    --> src/way/recursion.rs:157:4
[INFO] [stdout]     |
[INFO] [stdout] 157 | fn fibnacci_dp(n: u32) -> u32 {
[INFO] [stdout]     |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sequential_search` is never used
[INFO] [stdout]  --> src/way/sequential_search.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn sequential_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sequetial_search_pos` is never used
[INFO] [stdout]   --> src/way/sequential_search.rs:18:4
[INFO] [stdout]    |
[INFO] [stdout] 18 | fn sequetial_search_pos(nums: &[i32], num: i32) -> Option<usize> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ordered_sequential_search` is never used
[INFO] [stdout]   --> src/way/sequential_search.rs:35:4
[INFO] [stdout]    |
[INFO] [stdout] 35 | fn ordered_sequential_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort1` is never used
[INFO] [stdout]  --> src/sort/bubble_sort.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn bubble_sort1(nums: &mut  [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort2` is never used
[INFO] [stdout]   --> src/sort/bubble_sort.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn bubble_sort2(nums: &mut  [i32]) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort3` is never used
[INFO] [stdout]   --> src/sort/bubble_sort.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn bubble_sort3(nums: &mut  [i32]) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cocktail_sort` is never used
[INFO] [stdout]  --> src/sort/cocktail_sort.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn cocktail_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `comb_sort` is never used
[INFO] [stdout]  --> src/sort/comb_sort.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn comb_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cbic_sort` is never used
[INFO] [stdout]  --> src/sort/cantbelieveitcan_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn cbic_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cbic_sort2` is never used
[INFO] [stdout]   --> src/sort/cantbelieveitcan_sort.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn cbic_sort2(nums: &mut [i32]) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]  --> src/sort/quick_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn quick_sort(nums: &mut [i32], low: usize, high: usize) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]   --> src/sort/quick_sort.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn partition(nums: &mut [i32], low: usize, high: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]  --> src/sort/insertion_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn insertion_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bin_insertion_sort` is never used
[INFO] [stdout]  --> src/sort/bin_insertion_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn bin_insertion_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `shell_sort` is never used
[INFO] [stdout]  --> src/sort/shell_sort.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn shell_sort(nums: &mut [i32]) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/sort/merge_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn merge_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/sort/merge_sort.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn merge(nums: &mut [i32], mid: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `selection_sort` is never used
[INFO] [stdout]  --> src/sort/selection_sort.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn selection_sort(nums: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:21:5
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn  heap_sort(nums: &mut [i32]) {
[INFO] [stdout]    |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_down` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn move_down(nums: &mut [i32], mut parent: usize) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Bucket` is never constructed
[INFO] [stdout]  --> src/sort/bucket_sort.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Bucket<H, T> {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/sort/bucket_sort.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl<H, T> Bucket<H, T> {
[INFO] [stdout]    | ----------------------- associated function in this implementation
[INFO] [stdout] 11 |     fn new(hasher: H, value: T) -> Bucket<H, T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bucket_sort` is never used
[INFO] [stdout]   --> src/sort/bucket_sort.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn bucket_sort<H, T, F>(nums: &mut [T], hasher: F)
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `counting_sort` is never used
[INFO] [stdout]  --> src/sort/counting_sort.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn counting_sort(nums: &mut [usize]) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `radix_sort` is never used
[INFO] [stdout]  --> src/sort/radix_sort.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn radix_sort(nums: &mut [usize]) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MIN_MAERGE` is never used
[INFO] [stdout]  --> src/sort/tim_sort_without_gallop.rs:7:7
[INFO] [stdout]   |
[INFO] [stdout] 7 | const MIN_MAERGE: usize = 64;
[INFO] [stdout]   |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SortState` is never constructed
[INFO] [stdout]  --> src/sort/tim_sort_without_gallop.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct SortState<'a> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Run` is never constructed
[INFO] [stdout]   --> src/sort/tim_sort_without_gallop.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Run {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MergeLo` is never constructed
[INFO] [stdout]   --> src/sort/tim_sort_without_gallop.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct MergeLo<'a> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MergeHi` is never constructed
[INFO] [stdout]   --> src/sort/tim_sort_without_gallop.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct MergeHi<'a> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calc_minrun` is never used
[INFO] [stdout]   --> src/sort/tim_sort_without_gallop.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn calc_minrun(len: usize) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_run` is never used
[INFO] [stdout]   --> src/sort/tim_sort_without_gallop.rs:51:4
[INFO] [stdout]    |
[INFO] [stdout] 51 | fn count_run(list: &mut [i32]) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_run` is never used
[INFO] [stdout]   --> src/sort/tim_sort_without_gallop.rs:60:4
[INFO] [stdout]    |
[INFO] [stdout] 60 | fn find_run(list: &[i32]) -> (bool, usize) {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `sort`, `merge_collapse`, and `merge_force_collapse` are never used
[INFO] [stdout]    --> src/sort/tim_sort_without_gallop.rs:82:8
[INFO] [stdout]     |
[INFO] [stdout] 81  | impl<'a> SortState<'a> {
[INFO] [stdout]     | ---------------------- associated items in this implementation
[INFO] [stdout] 82  |     fn new(list: &'a mut [i32]) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 90  |     fn sort(&mut self) {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 127 |     fn merge_collapse(&mut self) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 159 |     fn merge_force_collapse(&mut self) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]    --> src/sort/tim_sort_without_gallop.rs:188:4
[INFO] [stdout]     |
[INFO] [stdout] 188 | fn merge_sort(
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_lo` is never used
[INFO] [stdout]    --> src/sort/tim_sort_without_gallop.rs:202:4
[INFO] [stdout]     |
[INFO] [stdout] 202 | fn merge_lo(
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `merge` are never used
[INFO] [stdout]    --> src/sort/tim_sort_without_gallop.rs:213:15
[INFO] [stdout]     |
[INFO] [stdout] 212 | impl <'a> MergeLo<'a> {
[INFO] [stdout]     | --------------------- associated items in this implementation
[INFO] [stdout] 213 |     unsafe fn new(list: &'a mut [i32], first_len: usize) -> Self {
[INFO] [stdout]     |               ^^^
[INFO] [stdout] ...
[INFO] [stdout] 235 |     fn merge(&mut self) {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_hi` is never used
[INFO] [stdout]    --> src/sort/tim_sort_without_gallop.rs:266:4
[INFO] [stdout]     |
[INFO] [stdout] 266 | fn merge_hi(
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `merge` are never used
[INFO] [stdout]    --> src/sort/tim_sort_without_gallop.rs:278:15
[INFO] [stdout]     |
[INFO] [stdout] 277 | impl<'a> MergeHi<'a> {
[INFO] [stdout]     | -------------------- associated items in this implementation
[INFO] [stdout] 278 |     unsafe fn new(
[INFO] [stdout]     |               ^^^
[INFO] [stdout] ...
[INFO] [stdout] 299 |     fn merge(&mut self) {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `tim_sort` is never used
[INFO] [stdout]    --> src/sort/tim_sort_without_gallop.rs:332:8
[INFO] [stdout]     |
[INFO] [stdout] 332 | pub fn tim_sort(list: &mut [i32]) {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/way/quick_sort.rs:135:17
[INFO] [stdout]     |
[INFO] [stdout] 135 |             let mut arr = vec![2, 4, 3];
[INFO] [stdout]     |                 ----^^^
[INFO] [stdout]     |                 |
[INFO] [stdout]     |                 help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `is_empty` and `size` are never used
[INFO] [stdout]   --> src/data/linked_list.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl<T> List<T> {
[INFO] [stdout]    | --------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `size` is never used
[INFO] [stdout]   --> src/data/stack.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl<T> Stack<T> {
[INFO] [stdout]    | ---------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lw1` is never used
[INFO] [stdout]    --> src/way/quick_sort.rs:111:12
[INFO] [stdout]     |
[INFO] [stdout] 111 |         fn lw1() {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lw2` is never used
[INFO] [stdout]    --> src/way/quick_sort.rs:125:12
[INFO] [stdout]     |
[INFO] [stdout] 125 |         fn lw2() {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort1` is never used
[INFO] [stdout]  --> src/sort/bubble_sort.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn bubble_sort1(nums: &mut  [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort2` is never used
[INFO] [stdout]   --> src/sort/bubble_sort.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn bubble_sort2(nums: &mut  [i32]) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cocktail_sort` is never used
[INFO] [stdout]  --> src/sort/cocktail_sort.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn cocktail_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cbic_sort` is never used
[INFO] [stdout]  --> src/sort/cantbelieveitcan_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn cbic_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cbic_sort2` is never used
[INFO] [stdout]   --> src/sort/cantbelieveitcan_sort.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn cbic_sort2(nums: &mut [i32]) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]  --> src/sort/insertion_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn insertion_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 7.62s
[INFO] running `Command { std: "docker" "inspect" "464c43cd7208edf9b6854bd61489a13fe8b1b856b089b739ebf8e9a2c59d2449", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "464c43cd7208edf9b6854bd61489a13fe8b1b856b089b739ebf8e9a2c59d2449", kill_on_drop: false }`
[INFO] [stdout] 464c43cd7208edf9b6854bd61489a13fe8b1b856b089b739ebf8e9a2c59d2449