[INFO] cloning repository https://github.com/JiMarchel/belajar-dsa
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/JiMarchel/belajar-dsa" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FJiMarchel%2Fbelajar-dsa", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FJiMarchel%2Fbelajar-dsa'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 66b4d07843dc51feaf858acdcd5e98506651b06b
[INFO] checking JiMarchel/belajar-dsa against try#987a165cfab916796a8315782b83ac460a651ce2 for pr-145262
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FJiMarchel%2Fbelajar-dsa" "/workspace/builds/worker-3-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/JiMarchel/belajar-dsa
[INFO] finished tweaking git repo https://github.com/JiMarchel/belajar-dsa
[INFO] tweaked toml for git repo https://github.com/JiMarchel/belajar-dsa written to /workspace/builds/worker-3-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/JiMarchel/belajar-dsa on toolchain 987a165cfab916796a8315782b83ac460a651ce2
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+987a165cfab916796a8315782b83ac460a651ce2" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/JiMarchel/belajar-dsa 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" "+987a165cfab916796a8315782b83ac460a651ce2" "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-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+987a165cfab916796a8315782b83ac460a651ce2" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] a605cf06242088bc67b0aed13f8dd1aaaff507441d97f8ec34584f4af12d39db
[INFO] running `Command { std: "docker" "start" "-a" "a605cf06242088bc67b0aed13f8dd1aaaff507441d97f8ec34584f4af12d39db", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "a605cf06242088bc67b0aed13f8dd1aaaff507441d97f8ec34584f4af12d39db", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a605cf06242088bc67b0aed13f8dd1aaaff507441d97f8ec34584f4af12d39db", kill_on_drop: false }`
[INFO] [stdout] a605cf06242088bc67b0aed13f8dd1aaaff507441d97f8ec34584f4af12d39db
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+987a165cfab916796a8315782b83ac460a651ce2" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 81a59e2a263f3181ada3d0be8a4e6a3a907fa95532237994cdfc98eeddb166f9
[INFO] running `Command { std: "docker" "start" "-a" "81a59e2a263f3181ada3d0be8a4e6a3a907fa95532237994cdfc98eeddb166f9", kill_on_drop: false }`
[INFO] [stderr]     Checking learn-dsa v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: struct `Deque` is never constructed
[INFO] [stdout]  --> src/basic_data_structure/dequeue/dequeue.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct Deque<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout]   |
[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/basic_data_structure/dequeue/dequeue.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl<T> Deque<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout]  8 |     pub fn new(cap: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     pub fn is_full(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn len(&self) -> usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn clear(&mut self) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn add_front(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn add_rear(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn remove_front(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     pub fn remove_rear(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 68 |     pub fn into_iter(self) -> IntoIter<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IntoIter` is never constructed
[INFO] [stdout]   --> src/basic_data_structure/dequeue/dequeue.rs:91:12
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub struct IntoIter<T>(Deque<T>);
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Iter` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/dequeue/dequeue.rs:104:12
[INFO] [stdout]     |
[INFO] [stdout] 104 | pub struct Iter<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/dequeue/dequeue.rs:118:12
[INFO] [stdout]     |
[INFO] [stdout] 118 | pub struct IterMut<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_checker` is never used
[INFO] [stdout]  --> src/basic_data_structure/dequeue/palindrome_checker.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn palindrome_checker(pal: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hot_potato` is never used
[INFO] [stdout]  --> src/basic_data_structure/queue/hot_potato.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn hot_potato(names: Vec<&str>, num: usize) -> &str {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/basic_data_structure/queue/queue.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Queue<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/basic_data_structure/queue/queue.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 10 |     pub fn new(size: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     pub fn enqueue(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn len(&self) -> usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn clear(&mut self) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn is_full(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `base_converter` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/base_converter.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn base_converter(mut dec_num: i32, base: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Deque` is never constructed
[INFO] [stdout]  --> src/basic_data_structure/dequeue/dequeue.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct Deque<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `divide_by_two` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/divide_by_two.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn divide_by_two(mut dec_num: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `infix_to_postfix` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/infix_to_postfix.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn infix_to_postfix(infix: &str) -> Option<String> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker1` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/par_checker1.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn par_checker1(par: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_match` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/par_checker2.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn par_match(open: char, close: char) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker2` is never used
[INFO] [stdout]   --> src/basic_data_structure/stack/par_checker2.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn par_checker2(par: &str) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker3` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/par_checker3.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn par_checker3(par: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postfix_eval` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/postfix_eval.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn postfix_eval(postfix: &str) -> Option<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `do_calc` is never used
[INFO] [stdout]   --> src/basic_data_structure/stack/postfix_eval.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn do_calc(op: &str, op1: i32, op2: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Stack` is never constructed
[INFO] [stdout]  --> src/basic_data_structure/stack/stack.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct Stack<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/basic_data_structure/dequeue/dequeue.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl<T> Deque<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout]  8 |     pub fn new(cap: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     pub fn is_full(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn len(&self) -> usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn clear(&mut self) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn add_front(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn add_rear(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn remove_front(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     pub fn remove_rear(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 68 |     pub fn into_iter(self) -> IntoIter<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IntoIter` is never constructed
[INFO] [stdout]   --> src/basic_data_structure/dequeue/dequeue.rs:91:12
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub struct IntoIter<T>(Deque<T>);
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Iter` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/dequeue/dequeue.rs:104:12
[INFO] [stdout]     |
[INFO] [stdout] 104 | pub struct Iter<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/dequeue/dequeue.rs:118:12
[INFO] [stdout]     |
[INFO] [stdout] 118 | pub struct IterMut<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl<T> Stack<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout]  8 |     //init a stack
[INFO] [stdout]  9 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn len(&self) -> usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn clear(&mut self) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     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] 56 |     pub fn peek_mut(&mut self) -> Option<&mut T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 68 |     pub fn into_iter(self) -> IntoIter<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_checker` is never used
[INFO] [stdout]  --> src/basic_data_structure/dequeue/palindrome_checker.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn palindrome_checker(pal: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IntoIter` is never constructed
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:91:12
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub struct IntoIter<T>(Stack<T>);
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hot_potato` is never used
[INFO] [stdout]  --> src/basic_data_structure/queue/hot_potato.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn hot_potato(names: Vec<&str>, num: usize) -> &str {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Iter` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/stack/stack.rs:103:12
[INFO] [stdout]     |
[INFO] [stdout] 103 | pub struct Iter<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/basic_data_structure/queue/queue.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Queue<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/stack/stack.rs:113:12
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub struct IterMut<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/searching/binary_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exponential_search` is never used
[INFO] [stdout]  --> src/searching/exponential_search.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn exponential_search(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/basic_data_structure/queue/queue.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 10 |     pub fn new(size: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     pub fn enqueue(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn len(&self) -> usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn clear(&mut self) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn is_full(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `base_converter` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/base_converter.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn base_converter(mut dec_num: i32, base: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hash1` is never used
[INFO] [stdout]  --> src/searching/hash.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hash1(astr: &str, size: usize) -> usize {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hash2` is never used
[INFO] [stdout]  --> src/searching/hash2.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hash2(astr: &str, size: usize) -> usize {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `HashMap` is never constructed
[INFO] [stdout]  --> src/searching/hashmap.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct HashMap<T> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `divide_by_two` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/divide_by_two.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn divide_by_two(mut dec_num: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `infix_to_postfix` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/infix_to_postfix.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn infix_to_postfix(infix: &str) -> Option<String> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker1` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/par_checker1.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn par_checker1(par: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_match` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/par_checker2.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn par_match(open: char, close: char) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker2` is never used
[INFO] [stdout]   --> src/basic_data_structure/stack/par_checker2.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn par_checker2(par: &str) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker3` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/par_checker3.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn par_checker3(par: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/searching/hashmap.rs:10:12
[INFO] [stdout]     |
[INFO] [stdout]   9 | impl<T: Clone + PartialEq + Default> HashMap<T> {
[INFO] [stdout]     | ----------------------------------------------- associated items in this implementation
[INFO] [stdout]  10 |     pub fn new(cap: usize) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  22 |     pub fn len(&self) -> usize {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  34 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  46 |     pub fn clear(&mut self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  58 |     pub fn hash(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout]  62 |     pub fn rehash(&self, pos: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  66 |     pub fn insert(&mut self, key: usize, value: T) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  95 |     pub fn remove(&mut self, key: usize) -> Option<T> {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 131 |     pub fn get_pos(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 155 |     pub fn get(&self, key: usize) -> Option<&T> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 160 |     pub fn get_mut(&mut self, key: usize) -> Option<&mut T> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 165 |     pub fn contains(&self, key: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 172 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postfix_eval` is never used
[INFO] [stdout]  --> src/basic_data_structure/stack/postfix_eval.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn postfix_eval(postfix: &str) -> Option<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `do_calc` is never used
[INFO] [stdout]   --> src/basic_data_structure/stack/postfix_eval.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn do_calc(op: &str, op1: i32, op2: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Iter` is never constructed
[INFO] [stdout]    --> src/searching/hashmap.rs:189:12
[INFO] [stdout]     |
[INFO] [stdout] 189 | pub struct Iter<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Stack` is never constructed
[INFO] [stdout]  --> src/basic_data_structure/stack/stack.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct Stack<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/searching/hashmap.rs:199:12
[INFO] [stdout]     |
[INFO] [stdout] 199 | pub struct IterMut<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `interpolation_search` is never used
[INFO] [stdout]  --> src/searching/interpolation_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn interpolation_search(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sequential_search` is never used
[INFO] [stdout]  --> src/searching/sequential_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn sequential_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn bubble_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]  --> src/sorting/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn insertion_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl<T> Stack<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout]  8 |     //init a stack
[INFO] [stdout]  9 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn len(&self) -> usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn clear(&mut self) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     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] 56 |     pub fn peek_mut(&mut self) -> Option<&mut T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 68 |     pub fn into_iter(self) -> IntoIter<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/sorting/merge_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IntoIter` is never constructed
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:91:12
[INFO] [stdout]    |
[INFO] [stdout] 91 | pub struct IntoIter<T>(Stack<T>);
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/sorting/merge_sort.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn merge(nums: &mut [i32], mid: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Iter` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/stack/stack.rs:103:12
[INFO] [stdout]     |
[INFO] [stdout] 103 | pub struct Iter<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/basic_data_structure/stack/stack.rs:113:12
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub struct IterMut<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]  --> src/sorting/quick_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn quick_sort(nums: &mut [i32], low: usize, high: usize) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/searching/binary_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `selection_sort` is never used
[INFO] [stdout]  --> src/sorting/selection_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn selection_sort(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `shell_sort` is never used
[INFO] [stdout]  --> src/sorting/shell_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn shell_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exponential_search` is never used
[INFO] [stdout]  --> src/searching/exponential_search.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub 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/searching/hash.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hash1(astr: &str, size: usize) -> usize {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hash2` is never used
[INFO] [stdout]  --> src/searching/hash2.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hash2(astr: &str, size: usize) -> usize {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/dequeue/dequeue.rs:72:17
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |                 ^^^^^     ------- the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]    = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<'_, T> {
[INFO] [stdout]    |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `HashMap` is never constructed
[INFO] [stdout]  --> src/searching/hashmap.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct HashMap<T> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/dequeue/dequeue.rs:81:21
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |                     ^^^^^^^^^     ---------- the same lifetime is hidden here
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<'_, T> {
[INFO] [stdout]    |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:72:17
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |                 ^^^^^     ------- the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<'_, T> {
[INFO] [stdout]    |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/searching/hashmap.rs:10:12
[INFO] [stdout]     |
[INFO] [stdout]   9 | impl<T: Clone + PartialEq + Default> HashMap<T> {
[INFO] [stdout]     | ----------------------------------------------- associated items in this implementation
[INFO] [stdout]  10 |     pub fn new(cap: usize) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  22 |     pub fn len(&self) -> usize {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  34 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  46 |     pub fn clear(&mut self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  58 |     pub fn hash(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout]  62 |     pub fn rehash(&self, pos: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  66 |     pub fn insert(&mut self, key: usize, value: T) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  95 |     pub fn remove(&mut self, key: usize) -> Option<T> {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 131 |     pub fn get_pos(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 155 |     pub fn get(&self, key: usize) -> Option<&T> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 160 |     pub fn get_mut(&mut self, key: usize) -> Option<&mut T> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 165 |     pub fn contains(&self, key: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 172 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Iter` is never constructed
[INFO] [stdout]    --> src/searching/hashmap.rs:189:12
[INFO] [stdout]     |
[INFO] [stdout] 189 | pub struct Iter<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:81:21
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |                     ^^^^^^^^^     ---------- the same lifetime is hidden here
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<'_, T> {
[INFO] [stdout]    |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/searching/hashmap.rs:199:12
[INFO] [stdout]     |
[INFO] [stdout] 199 | pub struct IterMut<'a, T: 'a> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `interpolation_search` is never used
[INFO] [stdout]  --> src/searching/interpolation_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn interpolation_search(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sequential_search` is never used
[INFO] [stdout]  --> src/searching/sequential_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn sequential_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn bubble_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/searching/hashmap.rs:172:17
[INFO] [stdout]     |
[INFO] [stdout] 172 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |                 ^^^^^     ------- the same lifetime is hidden here
[INFO] [stdout]     |                 |
[INFO] [stdout]     |                 the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 172 |     pub fn iter(&self) -> Iter<'_, T> {
[INFO] [stdout]     |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]  --> src/sorting/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn insertion_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/sorting/merge_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/searching/hashmap.rs:180:21
[INFO] [stdout]     |
[INFO] [stdout] 180 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]     |                     ^^^^^^^^^     ---------- the same lifetime is hidden here
[INFO] [stdout]     |                     |
[INFO] [stdout]     |                     the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 180 |     pub fn iter_mut(&mut self) -> IterMut<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/sorting/merge_sort.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn merge(nums: &mut [i32], mid: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]  --> src/sorting/quick_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn quick_sort(nums: &mut [i32], low: usize, high: usize) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `selection_sort` is never used
[INFO] [stdout]  --> src/sorting/selection_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn selection_sort(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `shell_sort` is never used
[INFO] [stdout]  --> src/sorting/shell_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn shell_sort(nums: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/dequeue/dequeue.rs:72:17
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |                 ^^^^^     ------- the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]    = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<'_, T> {
[INFO] [stdout]    |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/dequeue/dequeue.rs:81:21
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |                     ^^^^^^^^^     ---------- the same lifetime is hidden here
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<'_, T> {
[INFO] [stdout]    |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:72:17
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]    |                 ^^^^^     ------- the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn iter(&self) -> Iter<'_, T> {
[INFO] [stdout]    |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/basic_data_structure/stack/stack.rs:81:21
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]    |                     ^^^^^^^^^     ---------- the same lifetime is hidden here
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 81 |     pub fn iter_mut(&mut self) -> IterMut<'_, T> {
[INFO] [stdout]    |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/searching/hashmap.rs:172:17
[INFO] [stdout]     |
[INFO] [stdout] 172 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |                 ^^^^^     ------- the same lifetime is hidden here
[INFO] [stdout]     |                 |
[INFO] [stdout]     |                 the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 172 |     pub fn iter(&self) -> Iter<'_, T> {
[INFO] [stdout]     |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/searching/hashmap.rs:180:21
[INFO] [stdout]     |
[INFO] [stdout] 180 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]     |                     ^^^^^^^^^     ---------- the same lifetime is hidden here
[INFO] [stdout]     |                     |
[INFO] [stdout]     |                     the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 180 |     pub fn iter_mut(&mut self) -> IterMut<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.14s
[INFO] running `Command { std: "docker" "inspect" "81a59e2a263f3181ada3d0be8a4e6a3a907fa95532237994cdfc98eeddb166f9", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "81a59e2a263f3181ada3d0be8a4e6a3a907fa95532237994cdfc98eeddb166f9", kill_on_drop: false }`
[INFO] [stdout] 81a59e2a263f3181ada3d0be8a4e6a3a907fa95532237994cdfc98eeddb166f9