[INFO] cloning repository https://github.com/HorseXInsectCoder/rust_datastruct
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/HorseXInsectCoder/rust_datastruct" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FHorseXInsectCoder%2Frust_datastruct", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FHorseXInsectCoder%2Frust_datastruct'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] e076a2e06c9fcf375764a74d31ae4c78e6e5b1a3
[INFO] testing HorseXInsectCoder/rust_datastruct against master#1871252fc8bb672d40787e67404e6eaae7059369 for pr-125151
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FHorseXInsectCoder%2Frust_datastruct" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/HorseXInsectCoder/rust_datastruct on toolchain 1871252fc8bb672d40787e67404e6eaae7059369
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/HorseXInsectCoder/rust_datastruct
[INFO] finished tweaking git repo https://github.com/HorseXInsectCoder/rust_datastruct
[INFO] tweaked toml for git repo https://github.com/HorseXInsectCoder/rust_datastruct written to /workspace/builds/worker-0-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/HorseXInsectCoder/rust_datastruct 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" "+1871252fc8bb672d40787e67404e6eaae7059369" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] aae247f3ecb09dd0faf728e4e6b36fc9a8e168f912d91340fb2434d30d59fecd
[INFO] running `Command { std: "docker" "start" "-a" "aae247f3ecb09dd0faf728e4e6b36fc9a8e168f912d91340fb2434d30d59fecd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "aae247f3ecb09dd0faf728e4e6b36fc9a8e168f912d91340fb2434d30d59fecd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "aae247f3ecb09dd0faf728e4e6b36fc9a8e168f912d91340fb2434d30d59fecd", kill_on_drop: false }`
[INFO] [stdout] aae247f3ecb09dd0faf728e4e6b36fc9a8e168f912d91340fb2434d30d59fecd
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 99423720a58c1c8aa675b741da30e52f5132ebbf285b10b2fcdfdcb592802438
[INFO] running `Command { std: "docker" "start" "-a" "99423720a58c1c8aa675b741da30e52f5132ebbf285b10b2fcdfdcb592802438", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.66
[INFO] [stderr]    Compiling unicode-ident v1.0.11
[INFO] [stderr]    Compiling thiserror v1.0.43
[INFO] [stderr]    Compiling quote v1.0.31
[INFO] [stderr]    Compiling syn v2.0.26
[INFO] [stderr]    Compiling thiserror-impl v1.0.43
[INFO] [stderr]    Compiling rust_datastruct v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::ops::Index`
[INFO] [stdout]  --> src/stack/suffix/infix_to_suffix.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::ops::Index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Sub`
[INFO] [stdout]  --> src/bin_search/binary_search.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Sub;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BorrowMut`, `Borrow`
[INFO] [stdout]  --> src/sort/quick_sort.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:6:43
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `fmt`, `io`
[INFO] [stdout]  --> src/graph/error.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{fmt, io, result};
[INFO] [stdout]   |           ^^^  ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_list.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_list.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_list.rs:7:43
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_set.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_set.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_set.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_set.rs:7:43
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `MatrixError::*`, `MatrixError`
[INFO] [stdout]    --> src/graph/adj_iterable.rs:200:27
[INFO] [stdout]     |
[INFO] [stdout] 200 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]     |                           ^^^^^^^^^^^^^^  ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/graph_dfs.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/cc.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/single_source_path.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/path.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/cycle_detection.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:2:17
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/graph_bfs.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:3:15
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_list.rs:4:15
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_set.rs:4:15
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Borrow`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BorrowMut`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:1:27
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/graph_bfs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `i` is assigned to, but never used
[INFO] [stdout]    --> src/stack/suffix/infix_to_suffix.rs:126:13
[INFO] [stdout]     |
[INFO] [stdout] 126 |     let mut i = 0;
[INFO] [stdout]     |             ^
[INFO] [stdout]     |
[INFO] [stdout]     = note: consider using `_i` instead
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/deque/deque.rs:82:13
[INFO] [stdout]    |
[INFO] [stdout] 82 |         let mut iterator = Iter {
[INFO] [stdout]    |             ----^^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `index` is never read
[INFO] [stdout]    --> src/vec/vec_impl.rs:163:13
[INFO] [stdout]     |
[INFO] [stdout] 163 |             index += 1;
[INFO] [stdout]     |             ^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `times`
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut times = 0;
[INFO] [stdout]   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_times`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut times = 0;
[INFO] [stdout]   |         ----^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/hash_search/hash.rs:121:17
[INFO] [stdout]     |
[INFO] [stdout] 121 |             let mut curr = pos;
[INFO] [stdout]     |                 ----^^^^
[INFO] [stdout]     |                 |
[INFO] [stdout]     |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `len` is never read
[INFO] [stdout]   --> src/sort/bubble_sort.rs:29:5
[INFO] [stdout]    |
[INFO] [stdout] 29 |     len -= 1;
[INFO] [stdout]    |     ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `key`
[INFO] [stdout]    --> src/tree/bst.rs:196:26
[INFO] [stdout]     |
[INFO] [stdout] 196 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stdout]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `key`
[INFO] [stdout]    --> src/tree/avl.rs:211:26
[INFO] [stdout]     |
[INFO] [stdout] 211 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stdout]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/pra/bst_prac.rs:245:13
[INFO] [stdout]     |
[INFO] [stdout] 245 |         let mut size = self.size();
[INFO] [stdout]     |             ----^^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_matrix.rs:39:27
[INFO] [stdout]    |
[INFO] [stdout] 39 |                 .map(|(v, e)| self.read_second2end(&content, vec![vec![0; v]; v]).unwrap_or_default())
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_matrix.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_matrix.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/graph/adj_matrix.rs:74:18
[INFO] [stdout]    |
[INFO] [stdout] 74 |             let (v, _) = AdjMatrix::read_v_e(&content).unwrap();
[INFO] [stdout]    |                  ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_list.rs:38:27
[INFO] [stdout]    |
[INFO] [stdout] 38 |                 .map(|(v, e)| {
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_list.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_list.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/adj_list.rs:124:25
[INFO] [stdout]     |
[INFO] [stdout] 124 |     fn print_adj(&self, mut adj: Vec<LinkedList<usize>>) -> Result<()> {
[INFO] [stdout]     |                         ----^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_set.rs:38:27
[INFO] [stdout]    |
[INFO] [stdout] 38 |                 .map(|(v, e)| {
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_set.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_set.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/adj_set.rs:123:25
[INFO] [stdout]     |
[INFO] [stdout] 123 |     fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                         ----^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/graph.rs:74:17
[INFO] [stdout]    |
[INFO] [stdout] 74 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/graph.rs:75:17
[INFO] [stdout]    |
[INFO] [stdout] 75 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/graph.rs:105:29
[INFO] [stdout]     |
[INFO] [stdout] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/graph_test.rs:75:17
[INFO] [stdout]    |
[INFO] [stdout] 75 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/graph_test.rs:76:17
[INFO] [stdout]    |
[INFO] [stdout] 76 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/graph_test.rs:106:29
[INFO] [stdout]     |
[INFO] [stdout] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_search::hash::Iter<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter`
[INFO] [stdout]    --> src/hash_search/hash.rs:185:5
[INFO] [stdout]     |
[INFO] [stdout] 185 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter` is reachable at visibility `pub(hash_search)`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `hash_search::hash::Iter<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stdout]    --> src/hash_search/hash.rs:202:1
[INFO] [stdout]     |
[INFO] [stdout] 202 | struct Iter<'a, T> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_search::hash::IterMut<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter_mut`
[INFO] [stdout]    --> src/hash_search/hash.rs:193:5
[INFO] [stdout]     |
[INFO] [stdout] 193 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter_mut` is reachable at visibility `pub(hash_search)`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `hash_search::hash::IterMut<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stdout]    --> src/hash_search/hash.rs:213:1
[INFO] [stdout]     |
[INFO] [stdout] 213 | struct IterMut<'a, T> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker1` is never used
[INFO] [stdout]  --> src/stack/parentheses_matching/parentheses_matching.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn par_checker1(par: &str) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `infix_to_suffix` is never used
[INFO] [stdout]  --> src/stack/suffix/infix_to_suffix.rs:6:4
[INFO] [stdout]   |
[INFO] [stdout] 6 | fn infix_to_suffix(infix: &str) -> Option<String> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `suffix_eval` is never used
[INFO] [stdout]   --> src/stack/suffix/infix_to_suffix.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn suffix_eval(suffix: &str) -> Option<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `do_calc` is never used
[INFO] [stdout]   --> src/stack/suffix/infix_to_suffix.rs:89:4
[INFO] [stdout]    |
[INFO] [stdout] 89 | fn do_calc(op: &str, op1: i32, op2: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `infix_to_prefix` is never used
[INFO] [stdout]    --> src/stack/suffix/infix_to_suffix.rs:107:4
[INFO] [stdout]     |
[INFO] [stdout] 107 | fn infix_to_prefix(infix: &str) -> Option<String> {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `divide_by_two` is never used
[INFO] [stdout]  --> src/stack/nsc/number_system_conv.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn divide_by_two(mut dec_num: u32) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `base_converter` is never used
[INFO] [stdout]   --> src/stack/nsc/number_system_conv.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn base_converter(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/queue/hot_potato/potato.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn hot_potato(names: Vec<&str>, num: usize) -> &str {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `nums_sum` is never used
[INFO] [stdout]  --> src/recursion/recursion.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn nums_sum(nums: &[i32]) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hanoi` is never used
[INFO] [stdout]  --> src/recursion/hanoi.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn hanoi(height: u32, src_p: &str, des_p: &str, mid_p: &str) {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `BASE_STR` is never used
[INFO] [stdout]  --> src/recursion/num2str_rec.rs:2:7
[INFO] [stdout]   |
[INFO] [stdout] 2 | const BASE_STR: [&str; 16] = ["0", "1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"];
[INFO] [stdout]   |       ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num2str_rec` is never used
[INFO] [stdout]  --> src/recursion/num2str_rec.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn num2str_rec(num: i32, base: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rec_mc1` is never used
[INFO] [stdout]  --> src/dp/rec_cm1.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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/dp/rec_cm2.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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/dp/dp_rec_mc.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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/dp/dp_rec_mc_show.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn dp_rec_mc_show(cashes: &[u32], amount: u32, min_cashes: &mut [u32], cashes_used: &mut [u32]) -> u32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_cashes` is never used
[INFO] [stdout]   --> src/dp/dp_rec_mc_show.rs:28:4
[INFO] [stdout]    |
[INFO] [stdout] 28 | fn print_cashes(cashes_used: &[u32], mut amount: u32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_str_v1` is never used
[INFO] [stdout]  --> src/dp/longest_substr.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn longest_str_v1(nums: &[i32], i: u32) -> u32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_str_v2` is never used
[INFO] [stdout]   --> src/dp/longest_substr.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn longest_str_v2(nums: &[i32], i: u32, memo: &mut HashMap<u32, u32>) -> u32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sequential_search` is never used
[INFO] [stdout]  --> src/bin_search/sequential_search.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn sequential_search(nums: &[i32], num: i32) -> Option<usize> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `order_sequential_search` is never used
[INFO] [stdout]  --> src/bin_search/order_sequential_search.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn order_sequential_search(nums: &[i32], num: i32) -> Option<usize> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/bin_search/binary_search.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn binary_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `interpolation_search` is never used
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn interpolation_search(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exponential_search` is never used
[INFO] [stdout]  --> src/bin_search/exponential_search.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | 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/hash_search/hash.rs:9:12
[INFO] [stdout]     |
[INFO] [stdout] 8   | impl<T: Clone + PartialEq + Default> HashMap<T> {
[INFO] [stdout]     | ----------------------------------------------- associated items in this implementation
[INFO] [stdout] 9   |     pub fn new(cap: usize) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23  |     pub fn len(&self) -> usize {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |     pub fn clear(&mut self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |     pub fn hash(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |     pub fn rehash(&self, pos: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65  |     pub fn insert(&mut self, key: usize, value: T) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 101 |     pub fn remove(&mut self, key: usize) -> Option<T> {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 143 |     pub fn get_pos(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 168 |     pub fn get(&self, key: usize) -> Option<&T> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 173 |     pub fn get_mut(&mut self, key: usize) -> Option<&mut T> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 178 |     pub fn contains(&self, key: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 185 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 193 |     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/hash_search/hash.rs:202:8
[INFO] [stdout]     |
[INFO] [stdout] 202 | struct Iter<'a, T> {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/hash_search/hash.rs:213:8
[INFO] [stdout]     |
[INFO] [stdout] 213 | struct IterMut<'a, T> {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> src/sort/bubble_sort.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn bubble_sort(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:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn bubble_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:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn quick_sort<T: Ord>(arr: &mut [T]) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition2` is never used
[INFO] [stdout]   --> src/sort/quick_sort.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn partition2<T: Ord>(arr: &mut [T], low: usize, high: usize) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/sort/merge_sort.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn merge<T: Ord + Copy>(nums: &mut [T], mid: usize) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `parent` is never used
[INFO] [stdout]  --> src/sort/heap_sort.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn parent(idx: usize) -> usize {
[INFO] [stdout]   |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `left_child` is never used
[INFO] [stdout]  --> src/sort/heap_sort.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn left_child(idx: usize) -> usize {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `right_child` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn right_child(idx: usize) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn heap_sort<T: Ord>(arr: &mut [T]) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:53:4
[INFO] [stdout]    |
[INFO] [stdout] 53 | fn heapify<T: Ord>(arr: &mut [T], n: usize, i: usize) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/tree/binary_tree.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T> = Option<Box<BinaryTree<T>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]  --> src/tree/binary_tree.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BinaryTree<T> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout] 14  | impl<T: Clone + Ord + ToString + Debug> BinaryTree<T> {
[INFO] [stdout]     | ----------------------------------------------------- associated items in this implementation
[INFO] [stdout] 15  |     pub fn new(key: T) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24  |     fn insert_left_tree(&mut self, key: T) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     fn insert_right_tree(&mut self, key: T) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47  |     fn size(&self) -> usize {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51  |     fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn depth(&self) -> usize {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78  |     fn get_left(&self) -> Link<T> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82  |     fn get_right(&self) -> Link<T> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86  |     fn get_key(&self) -> T {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 90  |     fn set_key(&mut self, key: T) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |     fn min(&self) -> Option<&T> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn max(&self) -> Option<&T> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 111 |     fn leaf_size(&self) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 131 |     fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 135 |     fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 153 |     fn preorder(&self) {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 165 |     fn inorder(&self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 177 |     fn postorder(&self) {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 189 |     fn levelorder(&self) {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:218:4
[INFO] [stdout]     |
[INFO] [stdout] 218 | fn preorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:226:4
[INFO] [stdout]     |
[INFO] [stdout] 226 | fn inorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:234:4
[INFO] [stdout]     |
[INFO] [stdout] 234 | fn postorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryHeap` is never constructed
[INFO] [stdout]  --> src/tree/binary_heap.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct BinaryHeap<T> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/tree/binary_heap.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl<T: Ord + Clone> BinaryHeap<T> {
[INFO] [stdout]    | ---------------------------------- associated items in this implementation
[INFO] [stdout] 9  |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn size(&self) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn min(&self) -> Option<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn push(&mut self, val: T) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn heapify(&mut self, n: usize, curr: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     fn h_sort(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/tree/bst.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T, U> = Option<Box<BST<T, U>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]  --> src/tree/bst.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BST<T, U> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/bst.rs:19:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | / impl<T, U> BST<T, U>
[INFO] [stdout] 16  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 17  | |           U: Copy + Debug,
[INFO] [stdout]     | |__________________________- associated items in this implementation
[INFO] [stdout] 18  |   {
[INFO] [stdout] 19  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 89  |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 111 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 154 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 177 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 190 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 203 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 207 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 212 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 235 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 247 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 259 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 272 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/tree/avl.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T, U> = Option<Box<AVLTree<T, U>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AVLTree` is never constructed
[INFO] [stdout]  --> src/tree/avl.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct AVLTree<T, U> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/avl.rs:20:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | / impl<T, U> AVLTree<T, U>
[INFO] [stdout] 17  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 18  | |           U: Copy + Debug,
[INFO] [stdout]     | |__________________________- associated items in this implementation
[INFO] [stdout] 19  |   {
[INFO] [stdout] 20  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31  |       fn get_height(&self) -> isize {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |       fn get_balance_factor(&self) -> isize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 99  |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 116 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 169 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 192 |       fn min_val(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 205 |       fn max_val(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 218 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 222 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 250 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 262 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 274 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 287 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/tree/bst_ori.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Queue<T> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `len` are never used
[INFO] [stdout]   --> src/tree/bst_ori.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 14 |     fn new(size: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn enqueue(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn len(&self) -> usize {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]   --> src/tree/bst_ori.rs:48:6
[INFO] [stdout]    |
[INFO] [stdout] 48 | type Link<T,U> = Option<Box<BST<T,U>>>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]   --> src/tree/bst_ori.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | struct BST<T,U> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:63:8
[INFO] [stdout]     |
[INFO] [stdout] 59  | / impl<T,U> BST<T,U>
[INFO] [stdout] 60  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 61  | |           U: Copy + Debug
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] 62  |   {
[INFO] [stdout] 63  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 76  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 81  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 99  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 121 |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 126 |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 204 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 215 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |       fn get_left(&self) -> Link<T,U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 231 |       fn get_right(&self) -> Link<T,U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 236 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 260 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 272 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 284 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 296 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:319:4
[INFO] [stdout]     |
[INFO] [stdout] 319 | fn preorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:330:4
[INFO] [stdout]     |
[INFO] [stdout] 330 | fn inorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:341:4
[INFO] [stdout]     |
[INFO] [stdout] 341 | fn postorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `levelorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:352:4
[INFO] [stdout]     |
[INFO] [stdout] 352 | fn levelorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/pra/bst_prac.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T, U> = Option<Box<BST<T, U>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]  --> src/pra/bst_prac.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BST<T, U> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/pra/bst_prac.rs:19:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | / impl<T, U> BST<T, U>
[INFO] [stdout] 16  | |     where T: Copy + Debug + Ord,
[INFO] [stdout] 17  | |           U: Copy + Debug
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] 18  |   {
[INFO] [stdout] 19  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74  |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78  |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 93  |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 127 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 150 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 162 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 172 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 176 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 203 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 216 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 230 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 244 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AdjMatrix` is never constructed
[INFO] [stdout]  --> src/graph/adj_matrix.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct AdjMatrix {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `AdjMatrix` 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/graph/adj_matrix.rs:17:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | impl AdjMatrix {
[INFO] [stdout]     | -------------- associated items in this implementation
[INFO] [stdout] 16  |     // 读取文件
[INFO] [stdout] 17  |     fn new(file_path: &str) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |     fn init_matrix(&mut self) -> Option<Vec<Vec<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<Vec<usize>>) -> Result<Vec<Vec<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 133 |     fn print_adj(&self, adj: Vec<Vec<usize>>) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 160 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 168 |     fn adj(&self, v: usize) -> Vec<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 183 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Result` is never used
[INFO] [stdout]  --> src/graph/error.rs:4:10
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub type Result<T> = result::Result<T, MatrixError>;
[INFO] [stdout]   |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variants `ReadFileError`, `PrintMatrixError`, `VertexError`, `InvalidVertexEdge`, `SelfLoop`, and `ParallelEdge` are never constructed
[INFO] [stdout]   --> src/graph/error.rs:9:5
[INFO] [stdout]    |
[INFO] [stdout] 7  | pub enum MatrixError {
[INFO] [stdout]    |          ----------- variants in this enum
[INFO] [stdout] 8  |     #[error("failed to read file")]
[INFO] [stdout] 9  |     ReadFileError,
[INFO] [stdout]    |     ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 12 |     PrintMatrixError,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     VertexError,
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     InvalidVertexEdge(usize, usize),
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     SelfLoop,
[INFO] [stdout]    |     ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     ParallelEdge
[INFO] [stdout]    |     ^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `MatrixError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AdjList` is never constructed
[INFO] [stdout]   --> src/graph/adj_list.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct AdjList {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AdjList` 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/graph/adj_list.rs:18:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl AdjList {
[INFO] [stdout]     | ------------ associated items in this implementation
[INFO] [stdout] 17  |     // 读取文件
[INFO] [stdout] 18  |     fn new(file_path: &str) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     fn init_matrix(&mut self) -> Option<Vec<LinkedList<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<LinkedList<usize>>) -> Result<Vec<LinkedList<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     fn print_adj(&self, mut adj: Vec<LinkedList<usize>>) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 142 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 151 |     fn adj(&self, v: usize) -> &LinkedList<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 160 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AdjSet` is never constructed
[INFO] [stdout]   --> src/graph/adj_set.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct AdjSet {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AdjSet` 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/graph/adj_set.rs:18:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl AdjSet {
[INFO] [stdout]     | ----------- associated items in this implementation
[INFO] [stdout] 17  |     // 读取文件
[INFO] [stdout] 18  |     fn new(file_path: &str) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     fn init_matrix(&mut self) -> Option<Vec<BTreeSet<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<BTreeSet<usize>>) -> Result<Vec<BTreeSet<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 105 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 123 |     fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 141 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 150 |     fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 159 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `AdjIterable` is never used
[INFO] [stdout]    --> src/graph/adj_iterable.rs:202:11
[INFO] [stdout]     |
[INFO] [stdout] 202 | pub trait AdjIterable {
[INFO] [stdout]     |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]   --> src/graph/graph.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct Graph {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Graph` 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: multiple associated items are never used
[INFO] [stdout]    --> src/graph/graph.rs:18:12
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl Graph {
[INFO] [stdout]     | ---------- associated items in this implementation
[INFO] [stdout] 17  |     // 读取文件
[INFO] [stdout] 18  |     pub fn new() -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26  |     pub fn init_matrix(&mut self, file_path: &str)  {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     pub fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44  |     pub fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53  |     pub fn read_data<S: AsRef<str>>(&mut self, s: S) -> Result<(usize, usize, Vec<BTreeSet<usize>>)> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 123 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 132 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 141 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `GraphDFS` is never constructed
[INFO] [stdout]  --> src/graph/graph_dfs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct GraphDFS {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, and `dfs` are never used
[INFO] [stdout]   --> src/graph/graph_dfs.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl GraphDFS {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 16 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn dfs(&self, v: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CC` is never constructed
[INFO] [stdout]  --> src/graph/cc.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct CC {
[INFO] [stdout]   |        ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/graph/cc.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl CC {
[INFO] [stdout]    | ------- associated items in this implementation
[INFO] [stdout] 15 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn count_cc(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn order(&self) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn dfs(&self, v: i32, ccid: RefCell<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 69 |     fn is_connected(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 76 |     fn components(&self) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SingleSourcePath` is never constructed
[INFO] [stdout]  --> src/graph/single_source_path.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct SingleSourcePath {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used
[INFO] [stdout]   --> src/graph/single_source_path.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl SingleSourcePath {
[INFO] [stdout]    | --------------------- associated items in this implementation
[INFO] [stdout] 18 |     // 传入单源的顶点
[INFO] [stdout] 19 |     fn new(s: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     fn dfs(&self, v: usize, parent: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     fn is_connected(&self, t: usize) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |     fn path(&self, t: usize) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Path` is never constructed
[INFO] [stdout]  --> src/graph/path.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Path {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used
[INFO] [stdout]    --> src/graph/path.rs:23:8
[INFO] [stdout]     |
[INFO] [stdout] 21  | impl Path {
[INFO] [stdout]     | --------- associated items in this implementation
[INFO] [stdout] 22  |     // 传入单源的顶点
[INFO] [stdout] 23  |     fn new(s: usize, t: usize) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43  |     fn process(&mut self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65  |     fn dfs(&self, v: usize, parent: usize) -> bool {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 96  |     fn is_connected(&self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn path(&self) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CycleDetection` is never constructed
[INFO] [stdout]  --> src/graph/cycle_detection.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct CycleDetection {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, and `has_cycle` are never used
[INFO] [stdout]   --> src/graph/cycle_detection.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl CycleDetection {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new(file_path: &str) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(&self, v: usize, parent: usize) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn has_cycle(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `GraphTest` is never constructed
[INFO] [stdout]   --> src/graph/graph_test.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct GraphTest {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `GraphTest` 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: multiple associated items are never used
[INFO] [stdout]    --> src/graph/graph_test.rs:19:12
[INFO] [stdout]     |
[INFO] [stdout] 17  | impl GraphTest {
[INFO] [stdout]     | -------------- associated items in this implementation
[INFO] [stdout] 18  |     // 读取文件
[INFO] [stdout] 19  |     pub fn new() -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |     pub fn init_matrix(&mut self, file_path: &str)  {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |     pub fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |     pub fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54  |     pub fn read_data<S: AsRef<str>>(&mut self, s: S) -> Result<(usize, usize, Vec<BTreeSet<usize>>)> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 133 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 142 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BiPartitionDetection` is never constructed
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct BiPartitionDetection {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `dfs`, and `is_bipartite` are never used
[INFO] [stdout]   --> src/graph/bi_partition_detection.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl BiPartitionDetection {
[INFO] [stdout]    | ------------------------- associated items in this implementation
[INFO] [stdout] 15 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(&self, v: usize, color: i32) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn is_bipartite(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `GraphBFS` is never constructed
[INFO] [stdout]  --> src/graph/graph_bfs.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct GraphBFS {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `bfs`, and `order` are never used
[INFO] [stdout]   --> src/graph/graph_bfs.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl GraphBFS {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 14 |     fn new(file_path: &str) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn process(&self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn bfs(&self, s: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 60 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SinglePathGraphBFS` is never constructed
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct SinglePathGraphBFS {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `bfs`, `order`, `is_connected_to`, and `path` are never used
[INFO] [stdout]   --> src/graph/single_path_bfs.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl SinglePathGraphBFS {
[INFO] [stdout]    | ----------------------- associated items in this implementation
[INFO] [stdout] 16 |     fn new(file_path: &str, source: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn process(&self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn bfs(&self, source: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn is_connected_to(&self, t: usize) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn path(&self, target: usize) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `USSSPath` is never constructed
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct USSSPath {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/graph/u_s_s_s_path.rs:18:8
[INFO] [stdout]     |
[INFO] [stdout] 17  | impl USSSPath {
[INFO] [stdout]     | ------------- associated items in this implementation
[INFO] [stdout] 18  |     fn new(file_path: &str, source: usize) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33  |     fn process(&self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42  |     fn bfs(&self, s: usize) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 75  |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79  |     fn is_connected_to(&self, t: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 84  |     fn path(&self, target: usize) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 101 |     fn dis(&self, target: usize) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `std::result::Result` that must be used
[INFO] [stdout]  --> src/deque/palindrome/palindrome.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |         d.add_rear(c);
[INFO] [stdout]   |         ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout]   = note: `#[warn(unused_must_use)]` on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let _ = d.add_rear(c);
[INFO] [stdout]   |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_matrix.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_list.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_set.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/graph.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 37 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/graph_test.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 165 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 2.62s
[INFO] running `Command { std: "docker" "inspect" "99423720a58c1c8aa675b741da30e52f5132ebbf285b10b2fcdfdcb592802438", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "99423720a58c1c8aa675b741da30e52f5132ebbf285b10b2fcdfdcb592802438", kill_on_drop: false }`
[INFO] [stdout] 99423720a58c1c8aa675b741da30e52f5132ebbf285b10b2fcdfdcb592802438
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 32cdaff60d25f9fc2aa9b5151c3ceabb483ff8dffd6871f1d5e7a9310acf1547
[INFO] running `Command { std: "docker" "start" "-a" "32cdaff60d25f9fc2aa9b5151c3ceabb483ff8dffd6871f1d5e7a9310acf1547", kill_on_drop: false }`
[INFO] [stdout] warning: unused import: `std::ops::Index`
[INFO] [stdout]  --> src/stack/suffix/infix_to_suffix.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::ops::Index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Sub`
[INFO] [stdout]  --> src/bin_search/binary_search.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Sub;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BorrowMut`, `Borrow`
[INFO] [stdout]  --> src/sort/quick_sort.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:6:43
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `fmt`, `io`
[INFO] [stdout]  --> src/graph/error.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{fmt, io, result};
[INFO] [stdout]   |           ^^^  ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_list.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_list.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_list.rs:7:43
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_set.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_set.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_set.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_set.rs:7:43
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `MatrixError::*`, `MatrixError`
[INFO] [stdout]    --> src/graph/adj_iterable.rs:200:27
[INFO] [stdout]     |
[INFO] [stdout] 200 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]     |                           ^^^^^^^^^^^^^^  ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/graph_dfs.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/cc.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/single_source_path.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/path.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/cycle_detection.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:2:17
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/graph_bfs.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:3:15
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_list.rs:4:15
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_set.rs:4:15
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Borrow`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BorrowMut`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:1:27
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/graph_bfs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `i` is assigned to, but never used
[INFO] [stdout]    --> src/stack/suffix/infix_to_suffix.rs:126:13
[INFO] [stdout]     |
[INFO] [stdout] 126 |     let mut i = 0;
[INFO] [stdout]     |             ^
[INFO] [stdout]     |
[INFO] [stdout]     = note: consider using `_i` instead
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/deque/deque.rs:82:13
[INFO] [stdout]    |
[INFO] [stdout] 82 |         let mut iterator = Iter {
[INFO] [stdout]    |             ----^^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `index` is never read
[INFO] [stdout]    --> src/vec/vec_impl.rs:163:13
[INFO] [stdout]     |
[INFO] [stdout] 163 |             index += 1;
[INFO] [stdout]     |             ^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `times`
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut times = 0;
[INFO] [stdout]   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_times`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut times = 0;
[INFO] [stdout]   |         ----^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/hash_search/hash.rs:121:17
[INFO] [stdout]     |
[INFO] [stdout] 121 |             let mut curr = pos;
[INFO] [stdout]     |                 ----^^^^
[INFO] [stdout]     |                 |
[INFO] [stdout]     |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `len` is never read
[INFO] [stdout]   --> src/sort/bubble_sort.rs:29:5
[INFO] [stdout]    |
[INFO] [stdout] 29 |     len -= 1;
[INFO] [stdout]    |     ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `key`
[INFO] [stdout]    --> src/tree/bst.rs:196:26
[INFO] [stdout]     |
[INFO] [stdout] 196 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stdout]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `key`
[INFO] [stdout]    --> src/tree/avl.rs:211:26
[INFO] [stdout]     |
[INFO] [stdout] 211 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stdout]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/pra/bst_prac.rs:245:13
[INFO] [stdout]     |
[INFO] [stdout] 245 |         let mut size = self.size();
[INFO] [stdout]     |             ----^^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_matrix.rs:39:27
[INFO] [stdout]    |
[INFO] [stdout] 39 |                 .map(|(v, e)| self.read_second2end(&content, vec![vec![0; v]; v]).unwrap_or_default())
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_matrix.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_matrix.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/graph/adj_matrix.rs:74:18
[INFO] [stdout]    |
[INFO] [stdout] 74 |             let (v, _) = AdjMatrix::read_v_e(&content).unwrap();
[INFO] [stdout]    |                  ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_list.rs:38:27
[INFO] [stdout]    |
[INFO] [stdout] 38 |                 .map(|(v, e)| {
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_list.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_list.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/adj_list.rs:124:25
[INFO] [stdout]     |
[INFO] [stdout] 124 |     fn print_adj(&self, mut adj: Vec<LinkedList<usize>>) -> Result<()> {
[INFO] [stdout]     |                         ----^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_set.rs:38:27
[INFO] [stdout]    |
[INFO] [stdout] 38 |                 .map(|(v, e)| {
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_set.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_set.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/adj_set.rs:123:25
[INFO] [stdout]     |
[INFO] [stdout] 123 |     fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                         ----^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/graph.rs:74:17
[INFO] [stdout]    |
[INFO] [stdout] 74 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/graph.rs:75:17
[INFO] [stdout]    |
[INFO] [stdout] 75 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/graph.rs:105:29
[INFO] [stdout]     |
[INFO] [stdout] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/graph_test.rs:75:17
[INFO] [stdout]    |
[INFO] [stdout] 75 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/graph_test.rs:76:17
[INFO] [stdout]    |
[INFO] [stdout] 76 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/graph_test.rs:106:29
[INFO] [stdout]     |
[INFO] [stdout] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_search::hash::Iter<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter`
[INFO] [stdout]    --> src/hash_search/hash.rs:185:5
[INFO] [stdout]     |
[INFO] [stdout] 185 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter` is reachable at visibility `pub(hash_search)`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `hash_search::hash::Iter<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stdout]    --> src/hash_search/hash.rs:202:1
[INFO] [stdout]     |
[INFO] [stdout] 202 | struct Iter<'a, T> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_search::hash::IterMut<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter_mut`
[INFO] [stdout]    --> src/hash_search/hash.rs:193:5
[INFO] [stdout]     |
[INFO] [stdout] 193 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter_mut` is reachable at visibility `pub(hash_search)`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `hash_search::hash::IterMut<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stdout]    --> src/hash_search/hash.rs:213:1
[INFO] [stdout]     |
[INFO] [stdout] 213 | struct IterMut<'a, T> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `par_checker1` is never used
[INFO] [stdout]  --> src/stack/parentheses_matching/parentheses_matching.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn par_checker1(par: &str) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `infix_to_suffix` is never used
[INFO] [stdout]  --> src/stack/suffix/infix_to_suffix.rs:6:4
[INFO] [stdout]   |
[INFO] [stdout] 6 | fn infix_to_suffix(infix: &str) -> Option<String> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `suffix_eval` is never used
[INFO] [stdout]   --> src/stack/suffix/infix_to_suffix.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn suffix_eval(suffix: &str) -> Option<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `do_calc` is never used
[INFO] [stdout]   --> src/stack/suffix/infix_to_suffix.rs:89:4
[INFO] [stdout]    |
[INFO] [stdout] 89 | fn do_calc(op: &str, op1: i32, op2: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `infix_to_prefix` is never used
[INFO] [stdout]    --> src/stack/suffix/infix_to_suffix.rs:107:4
[INFO] [stdout]     |
[INFO] [stdout] 107 | fn infix_to_prefix(infix: &str) -> Option<String> {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `divide_by_two` is never used
[INFO] [stdout]  --> src/stack/nsc/number_system_conv.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn divide_by_two(mut dec_num: u32) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `base_converter` is never used
[INFO] [stdout]   --> src/stack/nsc/number_system_conv.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn base_converter(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/queue/hot_potato/potato.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn hot_potato(names: Vec<&str>, num: usize) -> &str {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `nums_sum` is never used
[INFO] [stdout]  --> src/recursion/recursion.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn nums_sum(nums: &[i32]) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hanoi` is never used
[INFO] [stdout]  --> src/recursion/hanoi.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn hanoi(height: u32, src_p: &str, des_p: &str, mid_p: &str) {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `BASE_STR` is never used
[INFO] [stdout]  --> src/recursion/num2str_rec.rs:2:7
[INFO] [stdout]   |
[INFO] [stdout] 2 | const BASE_STR: [&str; 16] = ["0", "1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"];
[INFO] [stdout]   |       ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num2str_rec` is never used
[INFO] [stdout]  --> src/recursion/num2str_rec.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn num2str_rec(num: i32, base: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rec_mc1` is never used
[INFO] [stdout]  --> src/dp/rec_cm1.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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/dp/rec_cm2.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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/dp/dp_rec_mc.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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/dp/dp_rec_mc_show.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn dp_rec_mc_show(cashes: &[u32], amount: u32, min_cashes: &mut [u32], cashes_used: &mut [u32]) -> u32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_cashes` is never used
[INFO] [stdout]   --> src/dp/dp_rec_mc_show.rs:28:4
[INFO] [stdout]    |
[INFO] [stdout] 28 | fn print_cashes(cashes_used: &[u32], mut amount: u32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_str_v1` is never used
[INFO] [stdout]  --> src/dp/longest_substr.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn longest_str_v1(nums: &[i32], i: u32) -> u32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_str_v2` is never used
[INFO] [stdout]   --> src/dp/longest_substr.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn longest_str_v2(nums: &[i32], i: u32, memo: &mut HashMap<u32, u32>) -> u32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sequential_search` is never used
[INFO] [stdout]  --> src/bin_search/sequential_search.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn sequential_search(nums: &[i32], num: i32) -> Option<usize> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `order_sequential_search` is never used
[INFO] [stdout]  --> src/bin_search/order_sequential_search.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn order_sequential_search(nums: &[i32], num: i32) -> Option<usize> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/bin_search/binary_search.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn binary_search(nums: &[i32], num: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `interpolation_search` is never used
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn interpolation_search(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exponential_search` is never used
[INFO] [stdout]  --> src/bin_search/exponential_search.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | 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/hash_search/hash.rs:9:12
[INFO] [stdout]     |
[INFO] [stdout] 8   | impl<T: Clone + PartialEq + Default> HashMap<T> {
[INFO] [stdout]     | ----------------------------------------------- associated items in this implementation
[INFO] [stdout] 9   |     pub fn new(cap: usize) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23  |     pub fn len(&self) -> usize {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |     pub fn clear(&mut self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |     pub fn hash(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |     pub fn rehash(&self, pos: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65  |     pub fn insert(&mut self, key: usize, value: T) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 101 |     pub fn remove(&mut self, key: usize) -> Option<T> {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 143 |     pub fn get_pos(&self, key: usize) -> usize {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 168 |     pub fn get(&self, key: usize) -> Option<&T> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 173 |     pub fn get_mut(&mut self, key: usize) -> Option<&mut T> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 178 |     pub fn contains(&self, key: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 185 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 193 |     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/hash_search/hash.rs:202:8
[INFO] [stdout]     |
[INFO] [stdout] 202 | struct Iter<'a, T> {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterMut` is never constructed
[INFO] [stdout]    --> src/hash_search/hash.rs:213:8
[INFO] [stdout]     |
[INFO] [stdout] 213 | struct IterMut<'a, T> {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> src/sort/bubble_sort.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn bubble_sort(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:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn bubble_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:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn quick_sort<T: Ord>(arr: &mut [T]) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition2` is never used
[INFO] [stdout]   --> src/sort/quick_sort.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn partition2<T: Ord>(arr: &mut [T], low: usize, high: usize) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/sort/merge_sort.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | 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:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn merge<T: Ord + Copy>(nums: &mut [T], mid: usize) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `parent` is never used
[INFO] [stdout]  --> src/sort/heap_sort.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn parent(idx: usize) -> usize {
[INFO] [stdout]   |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `left_child` is never used
[INFO] [stdout]  --> src/sort/heap_sort.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn left_child(idx: usize) -> usize {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `right_child` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn right_child(idx: usize) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn heap_sort<T: Ord>(arr: &mut [T]) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]   --> src/sort/heap_sort.rs:53:4
[INFO] [stdout]    |
[INFO] [stdout] 53 | fn heapify<T: Ord>(arr: &mut [T], n: usize, i: usize) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/tree/binary_tree.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T> = Option<Box<BinaryTree<T>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]  --> src/tree/binary_tree.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BinaryTree<T> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout] 14  | impl<T: Clone + Ord + ToString + Debug> BinaryTree<T> {
[INFO] [stdout]     | ----------------------------------------------------- associated items in this implementation
[INFO] [stdout] 15  |     pub fn new(key: T) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24  |     fn insert_left_tree(&mut self, key: T) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     fn insert_right_tree(&mut self, key: T) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47  |     fn size(&self) -> usize {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51  |     fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn depth(&self) -> usize {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78  |     fn get_left(&self) -> Link<T> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82  |     fn get_right(&self) -> Link<T> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86  |     fn get_key(&self) -> T {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 90  |     fn set_key(&mut self, key: T) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |     fn min(&self) -> Option<&T> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn max(&self) -> Option<&T> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 111 |     fn leaf_size(&self) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 131 |     fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 135 |     fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 153 |     fn preorder(&self) {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 165 |     fn inorder(&self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 177 |     fn postorder(&self) {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 189 |     fn levelorder(&self) {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:218:4
[INFO] [stdout]     |
[INFO] [stdout] 218 | fn preorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:226:4
[INFO] [stdout]     |
[INFO] [stdout] 226 | fn inorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:234:4
[INFO] [stdout]     |
[INFO] [stdout] 234 | fn postorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryHeap` is never constructed
[INFO] [stdout]  --> src/tree/binary_heap.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct BinaryHeap<T> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/tree/binary_heap.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl<T: Ord + Clone> BinaryHeap<T> {
[INFO] [stdout]    | ---------------------------------- associated items in this implementation
[INFO] [stdout] 9  |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn size(&self) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn min(&self) -> Option<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn push(&mut self, val: T) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn heapify(&mut self, n: usize, curr: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     fn h_sort(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/tree/bst.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T, U> = Option<Box<BST<T, U>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]  --> src/tree/bst.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BST<T, U> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/bst.rs:19:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | / impl<T, U> BST<T, U>
[INFO] [stdout] 16  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 17  | |           U: Copy + Debug,
[INFO] [stdout]     | |__________________________- associated items in this implementation
[INFO] [stdout] 18  |   {
[INFO] [stdout] 19  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 89  |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 111 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 154 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 177 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 190 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 203 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 207 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 212 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 235 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 247 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 259 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 272 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/tree/avl.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T, U> = Option<Box<AVLTree<T, U>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AVLTree` is never constructed
[INFO] [stdout]  --> src/tree/avl.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct AVLTree<T, U> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/avl.rs:20:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | / impl<T, U> AVLTree<T, U>
[INFO] [stdout] 17  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 18  | |           U: Copy + Debug,
[INFO] [stdout]     | |__________________________- associated items in this implementation
[INFO] [stdout] 19  |   {
[INFO] [stdout] 20  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31  |       fn get_height(&self) -> isize {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |       fn get_balance_factor(&self) -> isize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 99  |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 116 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 169 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 192 |       fn min_val(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 205 |       fn max_val(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 218 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 222 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 250 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 262 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 274 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 287 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/tree/bst_ori.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Queue<T> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `len` are never used
[INFO] [stdout]   --> src/tree/bst_ori.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 14 |     fn new(size: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn enqueue(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn len(&self) -> usize {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]   --> src/tree/bst_ori.rs:48:6
[INFO] [stdout]    |
[INFO] [stdout] 48 | type Link<T,U> = Option<Box<BST<T,U>>>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]   --> src/tree/bst_ori.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | struct BST<T,U> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:63:8
[INFO] [stdout]     |
[INFO] [stdout] 59  | / impl<T,U> BST<T,U>
[INFO] [stdout] 60  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 61  | |           U: Copy + Debug
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] 62  |   {
[INFO] [stdout] 63  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 76  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 81  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 99  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 121 |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 126 |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 204 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 215 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |       fn get_left(&self) -> Link<T,U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 231 |       fn get_right(&self) -> Link<T,U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 236 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 260 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 272 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 284 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 296 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:319:4
[INFO] [stdout]     |
[INFO] [stdout] 319 | fn preorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:330:4
[INFO] [stdout]     |
[INFO] [stdout] 330 | fn inorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:341:4
[INFO] [stdout]     |
[INFO] [stdout] 341 | fn postorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `levelorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:352:4
[INFO] [stdout]     |
[INFO] [stdout] 352 | fn levelorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/pra/bst_prac.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type Link<T, U> = Option<Box<BST<T, U>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]  --> src/pra/bst_prac.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BST<T, U> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/pra/bst_prac.rs:19:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | / impl<T, U> BST<T, U>
[INFO] [stdout] 16  | |     where T: Copy + Debug + Ord,
[INFO] [stdout] 17  | |           U: Copy + Debug
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] 18  |   {
[INFO] [stdout] 19  |       fn new() -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74  |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78  |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 93  |       fn insert(&mut self, key: T, val: U) {
[INFO] [stdout]     |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 127 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 150 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 162 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 172 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 176 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 203 |       fn preorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 216 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 230 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 244 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AdjMatrix` is never constructed
[INFO] [stdout]  --> src/graph/adj_matrix.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct AdjMatrix {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `AdjMatrix` 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/graph/adj_matrix.rs:17:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | impl AdjMatrix {
[INFO] [stdout]     | -------------- associated items in this implementation
[INFO] [stdout] 16  |     // 读取文件
[INFO] [stdout] 17  |     fn new(file_path: &str) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |     fn init_matrix(&mut self) -> Option<Vec<Vec<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<Vec<usize>>) -> Result<Vec<Vec<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 133 |     fn print_adj(&self, adj: Vec<Vec<usize>>) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 160 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 168 |     fn adj(&self, v: usize) -> Vec<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 183 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Result` is never used
[INFO] [stdout]  --> src/graph/error.rs:4:10
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub type Result<T> = result::Result<T, MatrixError>;
[INFO] [stdout]   |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variants `ReadFileError`, `PrintMatrixError`, `VertexError`, `InvalidVertexEdge`, `SelfLoop`, and `ParallelEdge` are never constructed
[INFO] [stdout]   --> src/graph/error.rs:9:5
[INFO] [stdout]    |
[INFO] [stdout] 7  | pub enum MatrixError {
[INFO] [stdout]    |          ----------- variants in this enum
[INFO] [stdout] 8  |     #[error("failed to read file")]
[INFO] [stdout] 9  |     ReadFileError,
[INFO] [stdout]    |     ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 12 |     PrintMatrixError,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     VertexError,
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     InvalidVertexEdge(usize, usize),
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     SelfLoop,
[INFO] [stdout]    |     ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     ParallelEdge
[INFO] [stdout]    |     ^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `MatrixError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AdjList` is never constructed
[INFO] [stdout]   --> src/graph/adj_list.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct AdjList {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AdjList` 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/graph/adj_list.rs:18:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl AdjList {
[INFO] [stdout]     | ------------ associated items in this implementation
[INFO] [stdout] 17  |     // 读取文件
[INFO] [stdout] 18  |     fn new(file_path: &str) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     fn init_matrix(&mut self) -> Option<Vec<LinkedList<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<LinkedList<usize>>) -> Result<Vec<LinkedList<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     fn print_adj(&self, mut adj: Vec<LinkedList<usize>>) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 142 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 151 |     fn adj(&self, v: usize) -> &LinkedList<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 160 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AdjSet` is never constructed
[INFO] [stdout]   --> src/graph/adj_set.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct AdjSet {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AdjSet` 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/graph/adj_set.rs:18:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl AdjSet {
[INFO] [stdout]     | ----------- associated items in this implementation
[INFO] [stdout] 17  |     // 读取文件
[INFO] [stdout] 18  |     fn new(file_path: &str) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     fn init_matrix(&mut self) -> Option<Vec<BTreeSet<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<BTreeSet<usize>>) -> Result<Vec<BTreeSet<usize>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 105 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 123 |     fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 141 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 150 |     fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 159 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `AdjIterable` is never used
[INFO] [stdout]    --> src/graph/adj_iterable.rs:202:11
[INFO] [stdout]     |
[INFO] [stdout] 202 | pub trait AdjIterable {
[INFO] [stdout]     |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]   --> src/graph/graph.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct Graph {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Graph` 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: multiple associated items are never used
[INFO] [stdout]    --> src/graph/graph.rs:18:12
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl Graph {
[INFO] [stdout]     | ---------- associated items in this implementation
[INFO] [stdout] 17  |     // 读取文件
[INFO] [stdout] 18  |     pub fn new() -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26  |     pub fn init_matrix(&mut self, file_path: &str)  {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35  |     pub fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44  |     pub fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53  |     pub fn read_data<S: AsRef<str>>(&mut self, s: S) -> Result<(usize, usize, Vec<BTreeSet<usize>>)> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 123 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 132 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 141 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `GraphDFS` is never constructed
[INFO] [stdout]  --> src/graph/graph_dfs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct GraphDFS {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, and `dfs` are never used
[INFO] [stdout]   --> src/graph/graph_dfs.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl GraphDFS {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 16 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn dfs(&self, v: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CC` is never constructed
[INFO] [stdout]  --> src/graph/cc.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct CC {
[INFO] [stdout]   |        ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/graph/cc.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl CC {
[INFO] [stdout]    | ------- associated items in this implementation
[INFO] [stdout] 15 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn count_cc(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn order(&self) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn dfs(&self, v: i32, ccid: RefCell<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 69 |     fn is_connected(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 76 |     fn components(&self) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SingleSourcePath` is never constructed
[INFO] [stdout]  --> src/graph/single_source_path.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct SingleSourcePath {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used
[INFO] [stdout]   --> src/graph/single_source_path.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl SingleSourcePath {
[INFO] [stdout]    | --------------------- associated items in this implementation
[INFO] [stdout] 18 |     // 传入单源的顶点
[INFO] [stdout] 19 |     fn new(s: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     fn dfs(&self, v: usize, parent: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     fn is_connected(&self, t: usize) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |     fn path(&self, t: usize) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Path` is never constructed
[INFO] [stdout]  --> src/graph/path.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Path {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used
[INFO] [stdout]    --> src/graph/path.rs:23:8
[INFO] [stdout]     |
[INFO] [stdout] 21  | impl Path {
[INFO] [stdout]     | --------- associated items in this implementation
[INFO] [stdout] 22  |     // 传入单源的顶点
[INFO] [stdout] 23  |     fn new(s: usize, t: usize) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43  |     fn process(&mut self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65  |     fn dfs(&self, v: usize, parent: usize) -> bool {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 96  |     fn is_connected(&self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn path(&self) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CycleDetection` is never constructed
[INFO] [stdout]  --> src/graph/cycle_detection.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct CycleDetection {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, and `has_cycle` are never used
[INFO] [stdout]   --> src/graph/cycle_detection.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl CycleDetection {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new(file_path: &str) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(&self, v: usize, parent: usize) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn has_cycle(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `GraphTest` is never constructed
[INFO] [stdout]   --> src/graph/graph_test.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct GraphTest {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `GraphTest` 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: multiple associated items are never used
[INFO] [stdout]    --> src/graph/graph_test.rs:19:12
[INFO] [stdout]     |
[INFO] [stdout] 17  | impl GraphTest {
[INFO] [stdout]     | -------------- associated items in this implementation
[INFO] [stdout] 18  |     // 读取文件
[INFO] [stdout] 19  |     pub fn new() -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |     pub fn init_matrix(&mut self, file_path: &str)  {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36  |     pub fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |     pub fn read_file(file_path: &str) -> Result<String> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54  |     pub fn read_data<S: AsRef<str>>(&mut self, s: S) -> Result<(usize, usize, Vec<BTreeSet<usize>>)> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 133 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 142 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BiPartitionDetection` is never constructed
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct BiPartitionDetection {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `dfs`, and `is_bipartite` are never used
[INFO] [stdout]   --> src/graph/bi_partition_detection.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl BiPartitionDetection {
[INFO] [stdout]    | ------------------------- associated items in this implementation
[INFO] [stdout] 15 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn process(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(&self, v: usize, color: i32) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn is_bipartite(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `GraphBFS` is never constructed
[INFO] [stdout]  --> src/graph/graph_bfs.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct GraphBFS {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `bfs`, and `order` are never used
[INFO] [stdout]   --> src/graph/graph_bfs.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl GraphBFS {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 14 |     fn new(file_path: &str) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn process(&self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn bfs(&self, s: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 60 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SinglePathGraphBFS` is never constructed
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct SinglePathGraphBFS {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `process`, `bfs`, `order`, `is_connected_to`, and `path` are never used
[INFO] [stdout]   --> src/graph/single_path_bfs.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl SinglePathGraphBFS {
[INFO] [stdout]    | ----------------------- associated items in this implementation
[INFO] [stdout] 16 |     fn new(file_path: &str, source: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn process(&self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn bfs(&self, source: usize) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn is_connected_to(&self, t: usize) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn path(&self, target: usize) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `USSSPath` is never constructed
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct USSSPath {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/graph/u_s_s_s_path.rs:18:8
[INFO] [stdout]     |
[INFO] [stdout] 17  | impl USSSPath {
[INFO] [stdout]     | ------------- associated items in this implementation
[INFO] [stdout] 18  |     fn new(file_path: &str, source: usize) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33  |     fn process(&self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42  |     fn bfs(&self, s: usize) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 75  |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79  |     fn is_connected_to(&self, t: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 84  |     fn path(&self, target: usize) -> Vec<usize> {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 101 |     fn dis(&self, target: usize) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `std::result::Result` that must be used
[INFO] [stdout]  --> src/deque/palindrome/palindrome.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |         d.add_rear(c);
[INFO] [stdout]   |         ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout]   = note: `#[warn(unused_must_use)]` on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let _ = d.add_rear(c);
[INFO] [stdout]   |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_matrix.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_list.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_set.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling rust_datastruct v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/graph.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 37 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/graph_test.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 165 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Index`
[INFO] [stdout]  --> src/stack/suffix/infix_to_suffix.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::ops::Index;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Sub`
[INFO] [stdout]  --> src/bin_search/binary_search.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Sub;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BorrowMut`, `Borrow`
[INFO] [stdout]  --> src/sort/quick_sort.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:6:43
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `fmt`, `io`
[INFO] [stdout]  --> src/graph/error.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{fmt, io, result};
[INFO] [stdout]   |           ^^^  ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_list.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_list.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_list.rs:7:43
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fs::File`
[INFO] [stdout]  --> src/graph/adj_set.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fs::File;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stdout]  --> src/graph/adj_set.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::path::Path`
[INFO] [stdout]  --> src/graph/adj_set.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use std::path::Path;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `MatrixError`
[INFO] [stdout]  --> src/graph/adj_set.rs:7:43
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]   |                                           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `MatrixError::*`, `MatrixError`
[INFO] [stdout]    --> src/graph/adj_iterable.rs:200:27
[INFO] [stdout]     |
[INFO] [stdout] 200 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stdout]     |                           ^^^^^^^^^^^^^^  ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/graph_dfs.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/cc.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/single_source_path.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/path.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/cycle_detection.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:2:17
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/graph_bfs.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_matrix.rs:3:15
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_list.rs:4:15
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BufRead`
[INFO] [stdout]  --> src/graph/adj_set.rs:4:15
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stdout]   |               ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Borrow`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:1:19
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BorrowMut`
[INFO] [stdout]  --> src/graph/bi_partition_detection.rs:1:27
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/graph_bfs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/single_path_bfs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/graph/u_s_s_s_path.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `i` is assigned to, but never used
[INFO] [stdout]    --> src/stack/suffix/infix_to_suffix.rs:126:13
[INFO] [stdout]     |
[INFO] [stdout] 126 |     let mut i = 0;
[INFO] [stdout]     |             ^
[INFO] [stdout]     |
[INFO] [stdout]     = note: consider using `_i` instead
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/deque/deque.rs:82:13
[INFO] [stdout]    |
[INFO] [stdout] 82 |         let mut iterator = Iter {
[INFO] [stdout]    |             ----^^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `index` is never read
[INFO] [stdout]    --> src/vec/vec_impl.rs:163:13
[INFO] [stdout]     |
[INFO] [stdout] 163 |             index += 1;
[INFO] [stdout]     |             ^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `times`
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut times = 0;
[INFO] [stdout]   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_times`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/bin_search/interpolation_search.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut times = 0;
[INFO] [stdout]   |         ----^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/hash_search/hash.rs:121:17
[INFO] [stdout]     |
[INFO] [stdout] 121 |             let mut curr = pos;
[INFO] [stdout]     |                 ----^^^^
[INFO] [stdout]     |                 |
[INFO] [stdout]     |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `len` is never read
[INFO] [stdout]   --> src/sort/bubble_sort.rs:29:5
[INFO] [stdout]    |
[INFO] [stdout] 29 |     len -= 1;
[INFO] [stdout]    |     ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `key`
[INFO] [stdout]    --> src/tree/bst.rs:196:26
[INFO] [stdout]     |
[INFO] [stdout] 196 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stdout]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `key`
[INFO] [stdout]    --> src/tree/avl.rs:211:26
[INFO] [stdout]     |
[INFO] [stdout] 211 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stdout]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/pra/bst_prac.rs:245:13
[INFO] [stdout]     |
[INFO] [stdout] 245 |         let mut size = self.size();
[INFO] [stdout]     |             ----^^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_matrix.rs:39:27
[INFO] [stdout]    |
[INFO] [stdout] 39 |                 .map(|(v, e)| self.read_second2end(&content, vec![vec![0; v]; v]).unwrap_or_default())
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_matrix.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_matrix.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/graph/adj_matrix.rs:74:18
[INFO] [stdout]    |
[INFO] [stdout] 74 |             let (v, _) = AdjMatrix::read_v_e(&content).unwrap();
[INFO] [stdout]    |                  ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_list.rs:38:27
[INFO] [stdout]    |
[INFO] [stdout] 38 |                 .map(|(v, e)| {
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_list.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_list.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/adj_list.rs:124:25
[INFO] [stdout]     |
[INFO] [stdout] 124 |     fn print_adj(&self, mut adj: Vec<LinkedList<usize>>) -> Result<()> {
[INFO] [stdout]     |                         ----^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `e`
[INFO] [stdout]   --> src/graph/adj_set.rs:38:27
[INFO] [stdout]    |
[INFO] [stdout] 38 |                 .map(|(v, e)| {
[INFO] [stdout]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/adj_set.rs:65:17
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/adj_set.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/adj_set.rs:123:25
[INFO] [stdout]     |
[INFO] [stdout] 123 |     fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                         ----^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/graph.rs:74:17
[INFO] [stdout]    |
[INFO] [stdout] 74 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/graph.rs:75:17
[INFO] [stdout]    |
[INFO] [stdout] 75 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/graph.rs:105:29
[INFO] [stdout]     |
[INFO] [stdout] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num1` is never read
[INFO] [stdout]   --> src/graph/graph_test.rs:75:17
[INFO] [stdout]    |
[INFO] [stdout] 75 |         let mut num1 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `num2` is never read
[INFO] [stdout]   --> src/graph/graph_test.rs:76:17
[INFO] [stdout]    |
[INFO] [stdout] 76 |         let mut num2 = 0;
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/graph/graph_test.rs:106:29
[INFO] [stdout]     |
[INFO] [stdout] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_search::hash::Iter<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter`
[INFO] [stdout]    --> src/hash_search/hash.rs:185:5
[INFO] [stdout]     |
[INFO] [stdout] 185 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter` is reachable at visibility `pub(hash_search)`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `hash_search::hash::Iter<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stdout]    --> src/hash_search/hash.rs:202:1
[INFO] [stdout]     |
[INFO] [stdout] 202 | struct Iter<'a, T> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_search::hash::IterMut<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter_mut`
[INFO] [stdout]    --> src/hash_search/hash.rs:193:5
[INFO] [stdout]     |
[INFO] [stdout] 193 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter_mut` is reachable at visibility `pub(hash_search)`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `hash_search::hash::IterMut<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stdout]    --> src/hash_search/hash.rs:213:1
[INFO] [stdout]     |
[INFO] [stdout] 213 | struct IterMut<'a, T> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:218:4
[INFO] [stdout]     |
[INFO] [stdout] 218 | fn preorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:226:4
[INFO] [stdout]     |
[INFO] [stdout] 226 | fn inorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postorder` is never used
[INFO] [stdout]    --> src/tree/binary_tree.rs:234:4
[INFO] [stdout]     |
[INFO] [stdout] 234 | fn postorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stdout]     |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `size`, `is_empty`, and `min` are never used
[INFO] [stdout]   --> src/tree/binary_heap.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl<T: Ord + Clone> BinaryHeap<T> {
[INFO] [stdout]    | ---------------------------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn size(&self) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn min(&self) -> Option<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used
[INFO] [stdout]    --> src/tree/bst.rs:203:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | / impl<T, U> BST<T, U>
[INFO] [stdout] 16  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 17  | |           U: Copy + Debug,
[INFO] [stdout]     | |__________________________- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 203 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 207 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 247 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 259 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 272 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used
[INFO] [stdout]    --> src/tree/avl.rs:218:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | / impl<T, U> AVLTree<T, U>
[INFO] [stdout] 17  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 18  | |           U: Copy + Debug,
[INFO] [stdout]     | |__________________________- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 218 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 222 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 262 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 274 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 287 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/tree/bst_ori.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Queue<T> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `len` are never used
[INFO] [stdout]   --> src/tree/bst_ori.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 14 |     fn new(size: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn enqueue(&mut self, val: T) -> Result<(), String> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn len(&self) -> usize {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple methods are never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:72:8
[INFO] [stdout]     |
[INFO] [stdout] 59  | / impl<T,U> BST<T,U>
[INFO] [stdout] 60  | |     where T: Copy + Ord + Debug,
[INFO] [stdout] 61  | |           U: Copy + Debug
[INFO] [stdout]     | |_________________________- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 72  |       fn is_empty(&self) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 76  |       fn size(&self) -> usize {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 81  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 99  |       fn leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 121 |       fn none_leaf_size(&self) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 126 |       fn depth(&self) -> usize {
[INFO] [stdout]     |          ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |       fn contains(&self, key: &T) -> bool {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 204 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 215 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |       fn get_left(&self) -> Link<T,U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 231 |       fn get_right(&self) -> Link<T,U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 236 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 272 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 284 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 296 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:319:4
[INFO] [stdout]     |
[INFO] [stdout] 319 | fn preorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:330:4
[INFO] [stdout]     |
[INFO] [stdout] 330 | fn inorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `postorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:341:4
[INFO] [stdout]     |
[INFO] [stdout] 341 | fn postorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `levelorder` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:352:4
[INFO] [stdout]     |
[INFO] [stdout] 352 | fn levelorder<T, U>(bst: Link<T,U>)
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `basic` is never used
[INFO] [stdout]    --> src/tree/bst_ori.rs:382:8
[INFO] [stdout]     |
[INFO] [stdout] 382 |     fn basic() {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used
[INFO] [stdout]    --> src/pra/bst_prac.rs:172:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | / impl<T, U> BST<T, U>
[INFO] [stdout] 16  | |     where T: Copy + Debug + Ord,
[INFO] [stdout] 17  | |           U: Copy + Debug
[INFO] [stdout]     | |_________________________- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 172 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 176 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 216 |       fn inorder(&self) {
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 230 |       fn postorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 244 |       fn levelorder(&self) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `has_edge`, `adj`, and `degree` are never used
[INFO] [stdout]    --> src/graph/adj_matrix.rs:160:8
[INFO] [stdout]     |
[INFO] [stdout] 15  | impl AdjMatrix {
[INFO] [stdout]     | -------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 160 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 168 |     fn adj(&self, v: usize) -> Vec<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 183 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `e` is never read
[INFO] [stdout]   --> src/graph/adj_list.rs:12:9
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct AdjList {
[INFO] [stdout]    |            ------- field in this struct
[INFO] [stdout] 11 |     pub v: usize,
[INFO] [stdout] 12 |     pub e: usize,
[INFO] [stdout]    |         ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AdjList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `has_edge`, `adj`, and `degree` are never used
[INFO] [stdout]    --> src/graph/adj_list.rs:142:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl AdjList {
[INFO] [stdout]     | ------------ methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 142 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 151 |     fn adj(&self, v: usize) -> &LinkedList<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 160 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `e` is never read
[INFO] [stdout]   --> src/graph/adj_set.rs:12:9
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct AdjSet {
[INFO] [stdout]    |            ------ field in this struct
[INFO] [stdout] 11 |     pub v: usize,
[INFO] [stdout] 12 |     pub e: usize,
[INFO] [stdout]    |         ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AdjSet` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `has_edge`, `adj`, and `degree` are never used
[INFO] [stdout]    --> src/graph/adj_set.rs:141:8
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl AdjSet {
[INFO] [stdout]     | ----------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 141 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 150 |     fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 159 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `AdjIterable` is never used
[INFO] [stdout]    --> src/graph/adj_iterable.rs:202:11
[INFO] [stdout]     |
[INFO] [stdout] 202 | pub trait AdjIterable {
[INFO] [stdout]     |           ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `print_adj`, `has_edge`, and `degree` are never used
[INFO] [stdout]    --> src/graph/graph.rs:105:12
[INFO] [stdout]     |
[INFO] [stdout] 16  | impl Graph {
[INFO] [stdout]     | ---------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 123 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 141 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `order` is never used
[INFO] [stdout]   --> src/graph/single_source_path.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl SingleSourcePath {
[INFO] [stdout]    | --------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `order` is never used
[INFO] [stdout]   --> src/graph/path.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl Path {
[INFO] [stdout]    | --------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 61 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `order` is never used
[INFO] [stdout]   --> src/graph/cycle_detection.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl CycleDetection {
[INFO] [stdout]    | ------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `print_adj`, `has_edge`, `adj`, and `degree` are never used
[INFO] [stdout]    --> src/graph/graph_test.rs:106:12
[INFO] [stdout]     |
[INFO] [stdout] 17  | impl GraphTest {
[INFO] [stdout]     | -------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 133 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 142 |     fn degree(&self, v: usize) -> usize {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `order` is never used
[INFO] [stdout]   --> src/graph/single_path_bfs.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl SinglePathGraphBFS {
[INFO] [stdout]    | ----------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `order` is never used
[INFO] [stdout]   --> src/graph/u_s_s_s_path.rs:75:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl USSSPath {
[INFO] [stdout]    | ------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 75 |     fn order(&self) -> Vec<usize> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `std::result::Result` that must be used
[INFO] [stdout]  --> src/deque/palindrome/palindrome.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |         d.add_rear(c);
[INFO] [stdout]   |         ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout]   = note: `#[warn(unused_must_use)]` on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let _ = d.add_rear(c);
[INFO] [stdout]   |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_matrix.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_list.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/adj_set.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 58 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/graph.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 37 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/graph_test.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 |         if v < 0 || v >= self.v {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 98 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.97s
[INFO] running `Command { std: "docker" "inspect" "32cdaff60d25f9fc2aa9b5151c3ceabb483ff8dffd6871f1d5e7a9310acf1547", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "32cdaff60d25f9fc2aa9b5151c3ceabb483ff8dffd6871f1d5e7a9310acf1547", kill_on_drop: false }`
[INFO] [stdout] 32cdaff60d25f9fc2aa9b5151c3ceabb483ff8dffd6871f1d5e7a9310acf1547
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 169eb0b0a7059a52988180aeb1e453d2ab41b1ef83e991aba3b5203257d5c924
[INFO] running `Command { std: "docker" "start" "-a" "169eb0b0a7059a52988180aeb1e453d2ab41b1ef83e991aba3b5203257d5c924", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `std::ops::Index`
[INFO] [stderr]  --> src/stack/suffix/infix_to_suffix.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::ops::Index;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::ops::Sub`
[INFO] [stderr]  --> src/bin_search/binary_search.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::ops::Sub;
[INFO] [stderr]   |     ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `BorrowMut`, `Borrow`
[INFO] [stderr]  --> src/sort/quick_sort.rs:1:19
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stderr]   |                   ^^^^^^  ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::fs::File`
[INFO] [stderr]  --> src/graph/adj_matrix.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::fs::File;
[INFO] [stderr]   |     ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stderr]  --> src/graph/adj_matrix.rs:3:24
[INFO] [stderr]   |
[INFO] [stderr] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stderr]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::path::Path`
[INFO] [stderr]  --> src/graph/adj_matrix.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::path::Path;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `MatrixError`
[INFO] [stderr]  --> src/graph/adj_matrix.rs:6:43
[INFO] [stderr]   |
[INFO] [stderr] 6 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stderr]   |                                           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `fmt`, `io`
[INFO] [stderr]  --> src/graph/error.rs:1:11
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{fmt, io, result};
[INFO] [stderr]   |           ^^^  ^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::fs::File`
[INFO] [stderr]  --> src/graph/adj_list.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::fs::File;
[INFO] [stderr]   |     ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stderr]  --> src/graph/adj_list.rs:4:24
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stderr]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::path::Path`
[INFO] [stderr]  --> src/graph/adj_list.rs:5:5
[INFO] [stderr]   |
[INFO] [stderr] 5 | use std::path::Path;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `MatrixError`
[INFO] [stderr]  --> src/graph/adj_list.rs:7:43
[INFO] [stderr]   |
[INFO] [stderr] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stderr]   |                                           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::fs::File`
[INFO] [stderr]  --> src/graph/adj_set.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::fs::File;
[INFO] [stderr]   |     ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `BufReader`, `ErrorKind`, `Read`
[INFO] [stderr]  --> src/graph/adj_set.rs:4:24
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stderr]   |                        ^^^^^^^^^  ^^^^^^^^^  ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::path::Path`
[INFO] [stderr]  --> src/graph/adj_set.rs:5:5
[INFO] [stderr]   |
[INFO] [stderr] 5 | use std::path::Path;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `MatrixError`
[INFO] [stderr]  --> src/graph/adj_set.rs:7:43
[INFO] [stderr]   |
[INFO] [stderr] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stderr]   |                                           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `MatrixError::*`, `MatrixError`
[INFO] [stderr]    --> src/graph/adj_iterable.rs:200:27
[INFO] [stderr]     |
[INFO] [stderr] 200 | use crate::graph::error::{MatrixError::*, MatrixError, Result};
[INFO] [stderr]     |                           ^^^^^^^^^^^^^^  ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Ref`
[INFO] [stderr]  --> src/graph/graph_dfs.rs:1:17
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::cell::{Ref, RefCell};
[INFO] [stderr]   |                 ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Ref`
[INFO] [stderr]  --> src/graph/cc.rs:1:17
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::cell::{Ref, RefCell};
[INFO] [stderr]   |                 ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Ref`
[INFO] [stderr]  --> src/graph/single_source_path.rs:1:17
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::cell::{Ref, RefCell};
[INFO] [stderr]   |                 ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Ref`
[INFO] [stderr]  --> src/graph/path.rs:1:17
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::cell::{Ref, RefCell};
[INFO] [stderr]   |                 ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Ref`
[INFO] [stderr]  --> src/graph/cycle_detection.rs:1:17
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::cell::{Ref, RefCell};
[INFO] [stderr]   |                 ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Ref`
[INFO] [stderr]  --> src/graph/bi_partition_detection.rs:2:17
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::cell::{Ref, RefCell};
[INFO] [stderr]   |                 ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::ops::Deref`
[INFO] [stderr]  --> src/graph/graph_bfs.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::ops::Deref;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::ops::Deref`
[INFO] [stderr]  --> src/graph/single_path_bfs.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::ops::Deref;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::ops::Deref`
[INFO] [stderr]  --> src/graph/u_s_s_s_path.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::ops::Deref;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `BufRead`
[INFO] [stderr]  --> src/graph/adj_matrix.rs:3:15
[INFO] [stderr]   |
[INFO] [stderr] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stderr]   |               ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `BufRead`
[INFO] [stderr]  --> src/graph/adj_list.rs:4:15
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stderr]   |               ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `BufRead`
[INFO] [stderr]  --> src/graph/adj_set.rs:4:15
[INFO] [stderr]   |
[INFO] [stderr] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write};
[INFO] [stderr]   |               ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Borrow`
[INFO] [stderr]  --> src/graph/bi_partition_detection.rs:1:19
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stderr]   |                   ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `BorrowMut`
[INFO] [stderr]  --> src/graph/bi_partition_detection.rs:1:27
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stderr]   |                           ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::borrow::Borrow`
[INFO] [stderr]  --> src/graph/graph_bfs.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::Borrow;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::borrow::Borrow`
[INFO] [stderr]  --> src/graph/single_path_bfs.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::Borrow;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::borrow::Borrow`
[INFO] [stderr]  --> src/graph/u_s_s_s_path.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::Borrow;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable `i` is assigned to, but never used
[INFO] [stderr]    --> src/stack/suffix/infix_to_suffix.rs:126:13
[INFO] [stderr]     |
[INFO] [stderr] 126 |     let mut i = 0;
[INFO] [stderr]     |             ^
[INFO] [stderr]     |
[INFO] [stderr]     = note: consider using `_i` instead
[INFO] [stderr]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/deque/deque.rs:82:13
[INFO] [stderr]    |
[INFO] [stderr] 82 |         let mut iterator = Iter {
[INFO] [stderr]    |             ----^^^^^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `index` is never read
[INFO] [stderr]    --> src/vec/vec_impl.rs:163:13
[INFO] [stderr]     |
[INFO] [stderr] 163 |             index += 1;
[INFO] [stderr]     |             ^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = help: maybe it is overwritten before being read?
[INFO] [stderr]     = note: `#[warn(unused_assignments)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `times`
[INFO] [stderr]  --> src/bin_search/interpolation_search.rs:9:13
[INFO] [stderr]   |
[INFO] [stderr] 9 |     let mut times = 0;
[INFO] [stderr]   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_times`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]  --> src/bin_search/interpolation_search.rs:9:9
[INFO] [stderr]   |
[INFO] [stderr] 9 |     let mut times = 0;
[INFO] [stderr]   |         ----^^^^^
[INFO] [stderr]   |         |
[INFO] [stderr]   |         help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/hash_search/hash.rs:121:17
[INFO] [stderr]     |
[INFO] [stderr] 121 |             let mut curr = pos;
[INFO] [stderr]     |                 ----^^^^
[INFO] [stderr]     |                 |
[INFO] [stderr]     |                 help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `len` is never read
[INFO] [stderr]   --> src/sort/bubble_sort.rs:29:5
[INFO] [stderr]    |
[INFO] [stderr] 29 |     len -= 1;
[INFO] [stderr]    |     ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `key`
[INFO] [stderr]    --> src/tree/bst.rs:196:26
[INFO] [stderr]     |
[INFO] [stderr] 196 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stderr]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `key`
[INFO] [stderr]    --> src/tree/avl.rs:211:26
[INFO] [stderr]     |
[INFO] [stderr] 211 |                     Some(key) => (self.key.as_ref(), self.val.as_ref()),
[INFO] [stderr]     |                          ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/pra/bst_prac.rs:245:13
[INFO] [stderr]     |
[INFO] [stderr] 245 |         let mut size = self.size();
[INFO] [stderr]     |             ----^^^^
[INFO] [stderr]     |             |
[INFO] [stderr]     |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `e`
[INFO] [stderr]   --> src/graph/adj_matrix.rs:39:27
[INFO] [stderr]    |
[INFO] [stderr] 39 |                 .map(|(v, e)| self.read_second2end(&content, vec![vec![0; v]; v]).unwrap_or_default())
[INFO] [stderr]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num1` is never read
[INFO] [stderr]   --> src/graph/adj_matrix.rs:65:17
[INFO] [stderr]    |
[INFO] [stderr] 65 |         let mut num1 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num2` is never read
[INFO] [stderr]   --> src/graph/adj_matrix.rs:66:17
[INFO] [stderr]    |
[INFO] [stderr] 66 |         let mut num2 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `v`
[INFO] [stderr]   --> src/graph/adj_matrix.rs:74:18
[INFO] [stderr]    |
[INFO] [stderr] 74 |             let (v, _) = AdjMatrix::read_v_e(&content).unwrap();
[INFO] [stderr]    |                  ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `e`
[INFO] [stderr]   --> src/graph/adj_list.rs:38:27
[INFO] [stderr]    |
[INFO] [stderr] 38 |                 .map(|(v, e)| {
[INFO] [stderr]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num1` is never read
[INFO] [stderr]   --> src/graph/adj_list.rs:65:17
[INFO] [stderr]    |
[INFO] [stderr] 65 |         let mut num1 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num2` is never read
[INFO] [stderr]   --> src/graph/adj_list.rs:66:17
[INFO] [stderr]    |
[INFO] [stderr] 66 |         let mut num2 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/graph/adj_list.rs:124:25
[INFO] [stderr]     |
[INFO] [stderr] 124 |     fn print_adj(&self, mut adj: Vec<LinkedList<usize>>) -> Result<()> {
[INFO] [stderr]     |                         ----^^^
[INFO] [stderr]     |                         |
[INFO] [stderr]     |                         help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `e`
[INFO] [stderr]   --> src/graph/adj_set.rs:38:27
[INFO] [stderr]    |
[INFO] [stderr] 38 |                 .map(|(v, e)| {
[INFO] [stderr]    |                           ^ help: if this is intentional, prefix it with an underscore: `_e`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num1` is never read
[INFO] [stderr]   --> src/graph/adj_set.rs:65:17
[INFO] [stderr]    |
[INFO] [stderr] 65 |         let mut num1 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num2` is never read
[INFO] [stderr]   --> src/graph/adj_set.rs:66:17
[INFO] [stderr]    |
[INFO] [stderr] 66 |         let mut num2 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/graph/adj_set.rs:123:25
[INFO] [stderr]     |
[INFO] [stderr] 123 |     fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |                         ----^^^
[INFO] [stderr]     |                         |
[INFO] [stderr]     |                         help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num1` is never read
[INFO] [stderr]   --> src/graph/graph.rs:74:17
[INFO] [stderr]    |
[INFO] [stderr] 74 |         let mut num1 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num2` is never read
[INFO] [stderr]   --> src/graph/graph.rs:75:17
[INFO] [stderr]    |
[INFO] [stderr] 75 |         let mut num2 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/graph/graph.rs:105:29
[INFO] [stderr]     |
[INFO] [stderr] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |                             ----^^^
[INFO] [stderr]     |                             |
[INFO] [stderr]     |                             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num1` is never read
[INFO] [stderr]   --> src/graph/graph_test.rs:75:17
[INFO] [stderr]    |
[INFO] [stderr] 75 |         let mut num1 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `num2` is never read
[INFO] [stderr]   --> src/graph/graph_test.rs:76:17
[INFO] [stderr]    |
[INFO] [stderr] 76 |         let mut num2 = 0;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/graph/graph_test.rs:106:29
[INFO] [stderr]     |
[INFO] [stderr] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |                             ----^^^
[INFO] [stderr]     |                             |
[INFO] [stderr]     |                             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: type `hash_search::hash::Iter<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter`
[INFO] [stderr]    --> src/hash_search/hash.rs:185:5
[INFO] [stderr]     |
[INFO] [stderr] 185 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stderr]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter` is reachable at visibility `pub(hash_search)`
[INFO] [stderr]     |
[INFO] [stderr] note: but type `hash_search::hash::Iter<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stderr]    --> src/hash_search/hash.rs:202:1
[INFO] [stderr]     |
[INFO] [stderr] 202 | struct Iter<'a, T> {
[INFO] [stderr]     | ^^^^^^^^^^^^^^^^^^
[INFO] [stderr]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: type `hash_search::hash::IterMut<'_, T>` is more private than the item `hash_search::hash::HashMap::<T>::iter_mut`
[INFO] [stderr]    --> src/hash_search/hash.rs:193:5
[INFO] [stderr]     |
[INFO] [stderr] 193 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stderr]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::<T>::iter_mut` is reachable at visibility `pub(hash_search)`
[INFO] [stderr]     |
[INFO] [stderr] note: but type `hash_search::hash::IterMut<'_, T>` is only usable at visibility `pub(self)`
[INFO] [stderr]    --> src/hash_search/hash.rs:213:1
[INFO] [stderr]     |
[INFO] [stderr] 213 | struct IterMut<'a, T> {
[INFO] [stderr]     | ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `par_checker1` is never used
[INFO] [stderr]  --> src/stack/parentheses_matching/parentheses_matching.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn par_checker1(par: &str) -> bool {
[INFO] [stderr]   |    ^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `infix_to_suffix` is never used
[INFO] [stderr]  --> src/stack/suffix/infix_to_suffix.rs:6:4
[INFO] [stderr]   |
[INFO] [stderr] 6 | fn infix_to_suffix(infix: &str) -> Option<String> {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `suffix_eval` is never used
[INFO] [stderr]   --> src/stack/suffix/infix_to_suffix.rs:66:4
[INFO] [stderr]    |
[INFO] [stderr] 66 | fn suffix_eval(suffix: &str) -> Option<i32> {
[INFO] [stderr]    |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `do_calc` is never used
[INFO] [stderr]   --> src/stack/suffix/infix_to_suffix.rs:89:4
[INFO] [stderr]    |
[INFO] [stderr] 89 | fn do_calc(op: &str, op1: i32, op2: i32) -> i32 {
[INFO] [stderr]    |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `infix_to_prefix` is never used
[INFO] [stderr]    --> src/stack/suffix/infix_to_suffix.rs:107:4
[INFO] [stderr]     |
[INFO] [stderr] 107 | fn infix_to_prefix(infix: &str) -> Option<String> {
[INFO] [stderr]     |    ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `divide_by_two` is never used
[INFO] [stderr]  --> src/stack/nsc/number_system_conv.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn divide_by_two(mut dec_num: u32) -> String {
[INFO] [stderr]   |    ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `base_converter` is never used
[INFO] [stderr]   --> src/stack/nsc/number_system_conv.rs:20:4
[INFO] [stderr]    |
[INFO] [stderr] 20 | fn base_converter(mut dec_num: u32, base: u32) -> String {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `hot_potato` is never used
[INFO] [stderr]  --> src/queue/hot_potato/potato.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn hot_potato(names: Vec<&str>, num: usize) -> &str {
[INFO] [stderr]   |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `nums_sum` is never used
[INFO] [stderr]  --> src/recursion/recursion.rs:2:4
[INFO] [stderr]   |
[INFO] [stderr] 2 | fn nums_sum(nums: &[i32]) -> i32 {
[INFO] [stderr]   |    ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `hanoi` is never used
[INFO] [stderr]  --> src/recursion/hanoi.rs:2:4
[INFO] [stderr]   |
[INFO] [stderr] 2 | fn hanoi(height: u32, src_p: &str, des_p: &str, mid_p: &str) {
[INFO] [stderr]   |    ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: constant `BASE_STR` is never used
[INFO] [stderr]  --> src/recursion/num2str_rec.rs:2:7
[INFO] [stderr]   |
[INFO] [stderr] 2 | const BASE_STR: [&str; 16] = ["0", "1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"];
[INFO] [stderr]   |       ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `num2str_rec` is never used
[INFO] [stderr]  --> src/recursion/num2str_rec.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub fn num2str_rec(num: i32, base: i32) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `rec_mc1` is never used
[INFO] [stderr]  --> src/dp/rec_cm1.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn rec_mc1(cashes: &[u32], amount: u32) -> u32 {
[INFO] [stderr]   |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `rec_mc2` is never used
[INFO] [stderr]  --> src/dp/rec_cm2.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn rec_mc2(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 {
[INFO] [stderr]   |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `dp_rec_mc` is never used
[INFO] [stderr]  --> src/dp/dp_rec_mc.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn dp_rec_mc(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 {
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `dp_rec_mc_show` is never used
[INFO] [stderr]  --> src/dp/dp_rec_mc_show.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn dp_rec_mc_show(cashes: &[u32], amount: u32, min_cashes: &mut [u32], cashes_used: &mut [u32]) -> u32 {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `print_cashes` is never used
[INFO] [stderr]   --> src/dp/dp_rec_mc_show.rs:28:4
[INFO] [stderr]    |
[INFO] [stderr] 28 | fn print_cashes(cashes_used: &[u32], mut amount: u32) {
[INFO] [stderr]    |    ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `longest_str_v1` is never used
[INFO] [stderr]  --> src/dp/longest_substr.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn longest_str_v1(nums: &[i32], i: u32) -> u32 {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `longest_str_v2` is never used
[INFO] [stderr]   --> src/dp/longest_substr.rs:21:4
[INFO] [stderr]    |
[INFO] [stderr] 21 | fn longest_str_v2(nums: &[i32], i: u32, memo: &mut HashMap<u32, u32>) -> u32 {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `sequential_search` is never used
[INFO] [stderr]  --> src/bin_search/sequential_search.rs:2:4
[INFO] [stderr]   |
[INFO] [stderr] 2 | fn sequential_search(nums: &[i32], num: i32) -> Option<usize> {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `order_sequential_search` is never used
[INFO] [stderr]  --> src/bin_search/order_sequential_search.rs:2:4
[INFO] [stderr]   |
[INFO] [stderr] 2 | fn order_sequential_search(nums: &[i32], num: i32) -> Option<usize> {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_search` is never used
[INFO] [stderr]  --> src/bin_search/binary_search.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn binary_search(nums: &[i32], num: i32) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `interpolation_search` is never used
[INFO] [stderr]  --> src/bin_search/interpolation_search.rs:2:4
[INFO] [stderr]   |
[INFO] [stderr] 2 | fn interpolation_search(nums: &[i32], target: i32) -> bool {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `exponential_search` is never used
[INFO] [stderr]  --> src/bin_search/exponential_search.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn exponential_search(nums: &[i32], target: i32) -> bool {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/hash_search/hash.rs:9:12
[INFO] [stderr]     |
[INFO] [stderr] 8   | impl<T: Clone + PartialEq + Default> HashMap<T> {
[INFO] [stderr]     | ----------------------------------------------- associated items in this implementation
[INFO] [stderr] 9   |     pub fn new(cap: usize) -> Self {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 23  |     pub fn len(&self) -> usize {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 34  |     pub fn is_empty(&self) -> bool {
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45  |     pub fn clear(&mut self) {
[INFO] [stderr]     |            ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 57  |     pub fn hash(&self, key: usize) -> usize {
[INFO] [stderr]     |            ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 61  |     pub fn rehash(&self, pos: usize) -> usize {
[INFO] [stderr]     |            ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 65  |     pub fn insert(&mut self, key: usize, value: T) {
[INFO] [stderr]     |            ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 101 |     pub fn remove(&mut self, key: usize) -> Option<T> {
[INFO] [stderr]     |            ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 143 |     pub fn get_pos(&self, key: usize) -> usize {
[INFO] [stderr]     |            ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 168 |     pub fn get(&self, key: usize) -> Option<&T> {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 173 |     pub fn get_mut(&mut self, key: usize) -> Option<&mut T> {
[INFO] [stderr]     |            ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 178 |     pub fn contains(&self, key: usize) -> bool {
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 185 |     pub fn iter(&self) -> Iter<T> {
[INFO] [stderr]     |            ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 193 |     pub fn iter_mut(&mut self) -> IterMut<T> {
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Iter` is never constructed
[INFO] [stderr]    --> src/hash_search/hash.rs:202:8
[INFO] [stderr]     |
[INFO] [stderr] 202 | struct Iter<'a, T> {
[INFO] [stderr]     |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `IterMut` is never constructed
[INFO] [stderr]    --> src/hash_search/hash.rs:213:8
[INFO] [stderr]     |
[INFO] [stderr] 213 | struct IterMut<'a, T> {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `bubble_sort` is never used
[INFO] [stderr]  --> src/sort/bubble_sort.rs:2:4
[INFO] [stderr]   |
[INFO] [stderr] 2 | fn bubble_sort(nums: &mut [i32]) {
[INFO] [stderr]   |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `bubble_sort2` is never used
[INFO] [stderr]   --> src/sort/bubble_sort.rs:16:4
[INFO] [stderr]    |
[INFO] [stderr] 16 | fn bubble_sort2(nums: &mut [i32]) {
[INFO] [stderr]    |    ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `quick_sort` is never used
[INFO] [stderr]  --> src/sort/quick_sort.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn quick_sort<T: Ord>(arr: &mut [T]) {
[INFO] [stderr]   |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `partition2` is never used
[INFO] [stderr]   --> src/sort/quick_sort.rs:24:4
[INFO] [stderr]    |
[INFO] [stderr] 24 | fn partition2<T: Ord>(arr: &mut [T], low: usize, high: usize) -> usize {
[INFO] [stderr]    |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `merge_sort` is never used
[INFO] [stderr]  --> src/sort/merge_sort.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn merge_sort(nums: &mut [i32])  {
[INFO] [stderr]   |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `merge` is never used
[INFO] [stderr]   --> src/sort/merge_sort.rs:14:4
[INFO] [stderr]    |
[INFO] [stderr] 14 | fn merge<T: Ord + Copy>(nums: &mut [T], mid: usize) {
[INFO] [stderr]    |    ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `parent` is never used
[INFO] [stderr]  --> src/sort/heap_sort.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn parent(idx: usize) -> usize {
[INFO] [stderr]   |    ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `left_child` is never used
[INFO] [stderr]  --> src/sort/heap_sort.rs:9:4
[INFO] [stderr]   |
[INFO] [stderr] 9 | fn left_child(idx: usize) -> usize {
[INFO] [stderr]   |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `right_child` is never used
[INFO] [stderr]   --> src/sort/heap_sort.rs:14:4
[INFO] [stderr]    |
[INFO] [stderr] 14 | fn right_child(idx: usize) -> usize {
[INFO] [stderr]    |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `heap_sort` is never used
[INFO] [stderr]   --> src/sort/heap_sort.rs:20:4
[INFO] [stderr]    |
[INFO] [stderr] 20 | fn heap_sort<T: Ord>(arr: &mut [T]) {
[INFO] [stderr]    |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `heapify` is never used
[INFO] [stderr]   --> src/sort/heap_sort.rs:53:4
[INFO] [stderr]    |
[INFO] [stderr] 53 | fn heapify<T: Ord>(arr: &mut [T], n: usize, i: usize) {
[INFO] [stderr]    |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Link` is never used
[INFO] [stderr]  --> src/tree/binary_tree.rs:5:6
[INFO] [stderr]   |
[INFO] [stderr] 5 | type Link<T> = Option<Box<BinaryTree<T>>>;
[INFO] [stderr]   |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BinaryTree` is never constructed
[INFO] [stderr]  --> src/tree/binary_tree.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | struct BinaryTree<T> {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/tree/binary_tree.rs:15:12
[INFO] [stderr]     |
[INFO] [stderr] 14  | impl<T: Clone + Ord + ToString + Debug> BinaryTree<T> {
[INFO] [stderr]     | ----------------------------------------------------- associated items in this implementation
[INFO] [stderr] 15  |     pub fn new(key: T) -> Self {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 24  |     fn insert_left_tree(&mut self, key: T) {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 35  |     fn insert_right_tree(&mut self, key: T) {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 47  |     fn size(&self) -> usize {
[INFO] [stderr]     |        ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 51  |     fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 64  |     fn depth(&self) -> usize {
[INFO] [stderr]     |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 78  |     fn get_left(&self) -> Link<T> {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 82  |     fn get_right(&self) -> Link<T> {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 86  |     fn get_key(&self) -> T {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 90  |     fn set_key(&mut self, key: T) {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 94  |     fn min(&self) -> Option<&T> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 102 |     fn max(&self) -> Option<&T> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 111 |     fn leaf_size(&self) -> usize {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 131 |     fn none_leaf_size(&self) -> usize {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 135 |     fn contains(&self, key: &T) -> bool {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 153 |     fn preorder(&self) {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 165 |     fn inorder(&self) {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 177 |     fn postorder(&self) {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 189 |     fn levelorder(&self) {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `preorder` is never used
[INFO] [stderr]    --> src/tree/binary_tree.rs:218:4
[INFO] [stderr]     |
[INFO] [stderr] 218 | fn preorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stderr]     |    ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `inorder` is never used
[INFO] [stderr]    --> src/tree/binary_tree.rs:226:4
[INFO] [stderr]     |
[INFO] [stderr] 226 | fn inorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stderr]     |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `postorder` is never used
[INFO] [stderr]    --> src/tree/binary_tree.rs:234:4
[INFO] [stderr]     |
[INFO] [stderr] 234 | fn postorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stderr]     |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BinaryHeap` is never constructed
[INFO] [stderr]  --> src/tree/binary_heap.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct BinaryHeap<T> {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]   --> src/tree/binary_heap.rs:9:8
[INFO] [stderr]    |
[INFO] [stderr] 8  | impl<T: Ord + Clone> BinaryHeap<T> {
[INFO] [stderr]    | ---------------------------------- associated items in this implementation
[INFO] [stderr] 9  |     fn new() -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 16 |     fn size(&self) -> usize {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |     fn is_empty(&self) -> bool {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 25 |     fn min(&self) -> Option<T> {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 33 |     fn push(&mut self, val: T) {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 40 |     fn pop(&mut self) -> Option<T> {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 54 |     fn heapify(&mut self, n: usize, curr: usize) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 72 |     fn h_sort(&mut self) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Link` is never used
[INFO] [stderr]  --> src/tree/bst.rs:5:6
[INFO] [stderr]   |
[INFO] [stderr] 5 | type Link<T, U> = Option<Box<BST<T, U>>>;
[INFO] [stderr]   |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BST` is never constructed
[INFO] [stderr]  --> src/tree/bst.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | struct BST<T, U> {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/tree/bst.rs:19:8
[INFO] [stderr]     |
[INFO] [stderr] 15  | / impl<T, U> BST<T, U>
[INFO] [stderr] 16  | |     where T: Copy + Ord + Debug,
[INFO] [stderr] 17  | |           U: Copy + Debug,
[INFO] [stderr]     | |__________________________- associated items in this implementation
[INFO] [stderr] 18  |   {
[INFO] [stderr] 19  |       fn new() -> Self {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 28  |       fn is_empty(&self) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 32  |       fn size(&self) -> usize {
[INFO] [stderr]     |          ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 36  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 57  |       fn leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 89  |       fn none_leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 94  |       fn depth(&self) -> usize {
[INFO] [stderr]     |          ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 111 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stderr]     |          ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 154 |       fn contains(&self, key: &T) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 177 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 190 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 203 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 207 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 212 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 235 |       fn preorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 247 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 259 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 272 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Link` is never used
[INFO] [stderr]  --> src/tree/avl.rs:5:6
[INFO] [stderr]   |
[INFO] [stderr] 5 | type Link<T, U> = Option<Box<AVLTree<T, U>>>;
[INFO] [stderr]   |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `AVLTree` is never constructed
[INFO] [stderr]  --> src/tree/avl.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | struct AVLTree<T, U> {
[INFO] [stderr]   |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/tree/avl.rs:20:8
[INFO] [stderr]     |
[INFO] [stderr] 16  | / impl<T, U> AVLTree<T, U>
[INFO] [stderr] 17  | |     where T: Copy + Ord + Debug,
[INFO] [stderr] 18  | |           U: Copy + Debug,
[INFO] [stderr]     | |__________________________- associated items in this implementation
[INFO] [stderr] 19  |   {
[INFO] [stderr] 20  |       fn new() -> Self {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 31  |       fn get_height(&self) -> isize {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 36  |       fn get_balance_factor(&self) -> isize {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 44  |       fn is_empty(&self) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 48  |       fn size(&self) -> usize {
[INFO] [stderr]     |          ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 52  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 73  |       fn leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 94  |       fn none_leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 99  |       fn depth(&self) -> usize {
[INFO] [stderr]     |          ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 116 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stderr]     |          ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 169 |       fn contains(&self, key: &T) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 192 |       fn min_val(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 205 |       fn max_val(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 218 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 222 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 227 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 250 |       fn preorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 262 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 274 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 287 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Queue` is never constructed
[INFO] [stderr]  --> src/tree/bst_ori.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | struct Queue<T> {
[INFO] [stderr]   |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `len` are never used
[INFO] [stderr]   --> src/tree/bst_ori.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl<T> Queue<T> {
[INFO] [stderr]    | ---------------- associated items in this implementation
[INFO] [stderr] 14 |     fn new(size: usize) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 21 |     fn enqueue(&mut self, val: T) -> Result<(), String> {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 30 |     fn dequeue(&mut self) -> Option<T> {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 38 |     fn is_empty(&self) -> bool {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 42 |     fn len(&self) -> usize {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Link` is never used
[INFO] [stderr]   --> src/tree/bst_ori.rs:48:6
[INFO] [stderr]    |
[INFO] [stderr] 48 | type Link<T,U> = Option<Box<BST<T,U>>>;
[INFO] [stderr]    |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BST` is never constructed
[INFO] [stderr]   --> src/tree/bst_ori.rs:52:8
[INFO] [stderr]    |
[INFO] [stderr] 52 | struct BST<T,U> {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/tree/bst_ori.rs:63:8
[INFO] [stderr]     |
[INFO] [stderr] 59  | / impl<T,U> BST<T,U>
[INFO] [stderr] 60  | |     where T: Copy + Ord + Debug,
[INFO] [stderr] 61  | |           U: Copy + Debug
[INFO] [stderr]     | |_________________________- associated items in this implementation
[INFO] [stderr] 62  |   {
[INFO] [stderr] 63  |       fn new() -> Self {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 72  |       fn is_empty(&self) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 76  |       fn size(&self) -> usize {
[INFO] [stderr]     |          ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 81  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 99  |       fn leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 121 |       fn none_leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 126 |       fn depth(&self) -> usize {
[INFO] [stderr]     |          ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 140 |       fn insert(&mut self, key: T, val: U) {
[INFO] [stderr]     |          ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 180 |       fn contains(&self, key: &T) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 204 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 215 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 227 |       fn get_left(&self) -> Link<T,U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 231 |       fn get_right(&self) -> Link<T,U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 236 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 260 |       fn preorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 272 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 284 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 296 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `preorder` is never used
[INFO] [stderr]    --> src/tree/bst_ori.rs:319:4
[INFO] [stderr]     |
[INFO] [stderr] 319 | fn preorder<T, U>(bst: Link<T,U>)
[INFO] [stderr]     |    ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `inorder` is never used
[INFO] [stderr]    --> src/tree/bst_ori.rs:330:4
[INFO] [stderr]     |
[INFO] [stderr] 330 | fn inorder<T, U>(bst: Link<T,U>)
[INFO] [stderr]     |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `postorder` is never used
[INFO] [stderr]    --> src/tree/bst_ori.rs:341:4
[INFO] [stderr]     |
[INFO] [stderr] 341 | fn postorder<T, U>(bst: Link<T,U>)
[INFO] [stderr]     |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `levelorder` is never used
[INFO] [stderr]    --> src/tree/bst_ori.rs:352:4
[INFO] [stderr]     |
[INFO] [stderr] 352 | fn levelorder<T, U>(bst: Link<T,U>)
[INFO] [stderr]     |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Link` is never used
[INFO] [stderr]  --> src/pra/bst_prac.rs:5:6
[INFO] [stderr]   |
[INFO] [stderr] 5 | type Link<T, U> = Option<Box<BST<T, U>>>;
[INFO] [stderr]   |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BST` is never constructed
[INFO] [stderr]  --> src/pra/bst_prac.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | struct BST<T, U> {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/pra/bst_prac.rs:19:8
[INFO] [stderr]     |
[INFO] [stderr] 15  | / impl<T, U> BST<T, U>
[INFO] [stderr] 16  | |     where T: Copy + Debug + Ord,
[INFO] [stderr] 17  | |           U: Copy + Debug
[INFO] [stderr]     | |_________________________- associated items in this implementation
[INFO] [stderr] 18  |   {
[INFO] [stderr] 19  |       fn new() -> Self {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 28  |       fn is_empty(&self) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 32  |       fn size(&self) -> usize {
[INFO] [stderr]     |          ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 36  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 57  |       fn leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 74  |       fn none_leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 78  |       fn depth(&self) -> usize {
[INFO] [stderr]     |          ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 93  |       fn insert(&mut self, key: T, val: U) {
[INFO] [stderr]     |          ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 127 |       fn contains(&self, key: &T) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 150 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 162 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 172 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 176 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 180 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 203 |       fn preorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 216 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 230 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 244 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `AdjMatrix` is never constructed
[INFO] [stderr]  --> src/graph/adj_matrix.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub struct AdjMatrix {
[INFO] [stderr]   |            ^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `AdjMatrix` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/graph/adj_matrix.rs:17:8
[INFO] [stderr]     |
[INFO] [stderr] 15  | impl AdjMatrix {
[INFO] [stderr]     | -------------- associated items in this implementation
[INFO] [stderr] 16  |     // 读取文件
[INFO] [stderr] 17  |     fn new(file_path: &str) -> Self {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 34  |     fn init_matrix(&mut self) -> Option<Vec<Vec<usize>>> {
[INFO] [stderr]     |        ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<Vec<usize>>) -> Result<Vec<Vec<usize>>> {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 95  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 115 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 133 |     fn print_adj(&self, adj: Vec<Vec<usize>>) -> Result<()> {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 160 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 168 |     fn adj(&self, v: usize) -> Vec<usize> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 183 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Result` is never used
[INFO] [stderr]  --> src/graph/error.rs:4:10
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub type Result<T> = result::Result<T, MatrixError>;
[INFO] [stderr]   |          ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variants `ReadFileError`, `PrintMatrixError`, `VertexError`, `InvalidVertexEdge`, `SelfLoop`, and `ParallelEdge` are never constructed
[INFO] [stderr]   --> src/graph/error.rs:9:5
[INFO] [stderr]    |
[INFO] [stderr] 7  | pub enum MatrixError {
[INFO] [stderr]    |          ----------- variants in this enum
[INFO] [stderr] 8  |     #[error("failed to read file")]
[INFO] [stderr] 9  |     ReadFileError,
[INFO] [stderr]    |     ^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 12 |     PrintMatrixError,
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 17 |     VertexError,
[INFO] [stderr]    |     ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |     InvalidVertexEdge(usize, usize),
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 24 |     SelfLoop,
[INFO] [stderr]    |     ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 27 |     ParallelEdge
[INFO] [stderr]    |     ^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `MatrixError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: struct `AdjList` is never constructed
[INFO] [stderr]   --> src/graph/adj_list.rs:10:12
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub struct AdjList {
[INFO] [stderr]    |            ^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `AdjList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/graph/adj_list.rs:18:8
[INFO] [stderr]     |
[INFO] [stderr] 16  | impl AdjList {
[INFO] [stderr]     | ------------ associated items in this implementation
[INFO] [stderr] 17  |     // 读取文件
[INFO] [stderr] 18  |     fn new(file_path: &str) -> Self {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 35  |     fn init_matrix(&mut self) -> Option<Vec<LinkedList<usize>>> {
[INFO] [stderr]     |        ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<LinkedList<usize>>) -> Result<Vec<LinkedList<usize>>> {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 95  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 106 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 124 |     fn print_adj(&self, mut adj: Vec<LinkedList<usize>>) -> Result<()> {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 142 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 151 |     fn adj(&self, v: usize) -> &LinkedList<usize> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 160 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `AdjSet` is never constructed
[INFO] [stderr]   --> src/graph/adj_set.rs:10:12
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub struct AdjSet {
[INFO] [stderr]    |            ^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `AdjSet` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/graph/adj_set.rs:18:8
[INFO] [stderr]     |
[INFO] [stderr] 16  | impl AdjSet {
[INFO] [stderr]     | ----------- associated items in this implementation
[INFO] [stderr] 17  |     // 读取文件
[INFO] [stderr] 18  |     fn new(file_path: &str) -> Self {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 35  |     fn init_matrix(&mut self) -> Option<Vec<BTreeSet<usize>>> {
[INFO] [stderr]     |        ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 56  |     fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 64  |     fn read_second2end(&self, content: &String, mut adj: Vec<BTreeSet<usize>>) -> Result<Vec<BTreeSet<usize>>> {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 94  |     fn read_file(file_path: &str) -> Result<String> {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 105 |     fn read_v_e<S: AsRef<str>>(s: S) -> Result<(usize, usize)> {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 123 |     fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |        ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 141 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 150 |     fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 159 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `AdjIterable` is never used
[INFO] [stderr]    --> src/graph/adj_iterable.rs:202:11
[INFO] [stderr]     |
[INFO] [stderr] 202 | pub trait AdjIterable {
[INFO] [stderr]     |           ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Graph` is never constructed
[INFO] [stderr]   --> src/graph/graph.rs:10:12
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub struct Graph {
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `Graph` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/graph/graph.rs:18:12
[INFO] [stderr]     |
[INFO] [stderr] 16  | impl Graph {
[INFO] [stderr]     | ---------- associated items in this implementation
[INFO] [stderr] 17  |     // 读取文件
[INFO] [stderr] 18  |     pub fn new() -> Self {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 26  |     pub fn init_matrix(&mut self, file_path: &str)  {
[INFO] [stderr]     |            ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 35  |     pub fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stderr]     |            ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 44  |     pub fn read_file(file_path: &str) -> Result<String> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 53  |     pub fn read_data<S: AsRef<str>>(&mut self, s: S) -> Result<(usize, usize, Vec<BTreeSet<usize>>)> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 123 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 132 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 141 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `GraphDFS` is never constructed
[INFO] [stderr]  --> src/graph/graph_dfs.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | struct GraphDFS {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `process`, `order`, and `dfs` are never used
[INFO] [stderr]   --> src/graph/graph_dfs.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 15 | impl GraphDFS {
[INFO] [stderr]    | ------------- associated items in this implementation
[INFO] [stderr] 16 |     fn new() -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 35 |     fn process(&mut self) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 50 |     fn dfs(&self, v: usize) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `CC` is never constructed
[INFO] [stderr]  --> src/graph/cc.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct CC {
[INFO] [stderr]   |        ^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]   --> src/graph/cc.rs:15:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | impl CC {
[INFO] [stderr]    | ------- associated items in this implementation
[INFO] [stderr] 15 |     fn new() -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 31 |     fn process(&mut self) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 41 |     fn count_cc(&self) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 50 |     fn order(&self) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 55 |     fn dfs(&self, v: i32, ccid: RefCell<i32>) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 69 |     fn is_connected(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 76 |     fn components(&self) -> Vec<Vec<i32>> {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `SingleSourcePath` is never constructed
[INFO] [stderr]  --> src/graph/single_source_path.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | struct SingleSourcePath {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used
[INFO] [stderr]   --> src/graph/single_source_path.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | impl SingleSourcePath {
[INFO] [stderr]    | --------------------- associated items in this implementation
[INFO] [stderr] 18 |     // 传入单源的顶点
[INFO] [stderr] 19 |     fn new(s: usize) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 36 |     fn process(&mut self) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 42 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 59 |     fn dfs(&self, v: usize, parent: usize) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 74 |     fn is_connected(&self, t: usize) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 82 |     fn path(&self, t: usize) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Path` is never constructed
[INFO] [stderr]  --> src/graph/path.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | struct Path {
[INFO] [stderr]   |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used
[INFO] [stderr]    --> src/graph/path.rs:23:8
[INFO] [stderr]     |
[INFO] [stderr] 21  | impl Path {
[INFO] [stderr]     | --------- associated items in this implementation
[INFO] [stderr] 22  |     // 传入单源的顶点
[INFO] [stderr] 23  |     fn new(s: usize, t: usize) -> Self {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 43  |     fn process(&mut self) {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 61  |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]     |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 65  |     fn dfs(&self, v: usize, parent: usize) -> bool {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 96  |     fn is_connected(&self) -> bool {
[INFO] [stderr]     |        ^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 102 |     fn path(&self) -> Vec<usize> {
[INFO] [stderr]     |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `CycleDetection` is never constructed
[INFO] [stderr]  --> src/graph/cycle_detection.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | struct CycleDetection {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `process`, `order`, `dfs`, and `has_cycle` are never used
[INFO] [stderr]   --> src/graph/cycle_detection.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | impl CycleDetection {
[INFO] [stderr]    | ------------------- associated items in this implementation
[INFO] [stderr] 13 |     fn new(file_path: &str) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 28 |     fn process(&mut self) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 39 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 44 |     fn dfs(&self, v: usize, parent: usize) -> bool {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 62 |     fn has_cycle(&self) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `GraphTest` is never constructed
[INFO] [stderr]   --> src/graph/graph_test.rs:11:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | pub struct GraphTest {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `GraphTest` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/graph/graph_test.rs:19:12
[INFO] [stderr]     |
[INFO] [stderr] 17  | impl GraphTest {
[INFO] [stderr]     | -------------- associated items in this implementation
[INFO] [stderr] 18  |     // 读取文件
[INFO] [stderr] 19  |     pub fn new() -> Self {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 27  |     pub fn init_matrix(&mut self, file_path: &str)  {
[INFO] [stderr]     |            ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 36  |     pub fn validate_vertex(&self, v: usize) -> Result<()> {
[INFO] [stderr]     |            ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45  |     pub fn read_file(file_path: &str) -> Result<String> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 54  |     pub fn read_data<S: AsRef<str>>(&mut self, s: S) -> Result<(usize, usize, Vec<BTreeSet<usize>>)> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 124 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 133 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 142 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BiPartitionDetection` is never constructed
[INFO] [stderr]  --> src/graph/bi_partition_detection.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct BiPartitionDetection {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `process`, `dfs`, and `is_bipartite` are never used
[INFO] [stderr]   --> src/graph/bi_partition_detection.rs:15:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | impl BiPartitionDetection {
[INFO] [stderr]    | ------------------------- associated items in this implementation
[INFO] [stderr] 15 |     fn new() -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 32 |     fn process(&mut self) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 44 |     fn dfs(&self, v: usize, color: i32) -> bool {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 65 |     fn is_bipartite(&self) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `GraphBFS` is never constructed
[INFO] [stderr]  --> src/graph/graph_bfs.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | struct GraphBFS {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `process`, `bfs`, and `order` are never used
[INFO] [stderr]   --> src/graph/graph_bfs.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl GraphBFS {
[INFO] [stderr]    | ------------- associated items in this implementation
[INFO] [stderr] 14 |     fn new(file_path: &str) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 26 |     fn process(&self) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 34 |     fn bfs(&self, s: usize) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 60 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `SinglePathGraphBFS` is never constructed
[INFO] [stderr]  --> src/graph/single_path_bfs.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | struct SinglePathGraphBFS {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `process`, `bfs`, `order`, `is_connected_to`, and `path` are never used
[INFO] [stderr]   --> src/graph/single_path_bfs.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 15 | impl SinglePathGraphBFS {
[INFO] [stderr]    | ----------------------- associated items in this implementation
[INFO] [stderr] 16 |     fn new(file_path: &str, source: usize) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 30 |     fn process(&self) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 34 |     fn bfs(&self, source: usize) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 62 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 66 |     fn is_connected_to(&self, t: usize) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 71 |     fn path(&self, target: usize) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `USSSPath` is never constructed
[INFO] [stderr]  --> src/graph/u_s_s_s_path.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | struct USSSPath {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/graph/u_s_s_s_path.rs:18:8
[INFO] [stderr]     |
[INFO] [stderr] 17  | impl USSSPath {
[INFO] [stderr]     | ------------- associated items in this implementation
[INFO] [stderr] 18  |     fn new(file_path: &str, source: usize) -> Self {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 33  |     fn process(&self) {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 42  |     fn bfs(&self, s: usize) {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 75  |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]     |        ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 79  |     fn is_connected_to(&self, t: usize) -> bool {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 84  |     fn path(&self, target: usize) -> Vec<usize> {
[INFO] [stderr]     |        ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 101 |     fn dis(&self, target: usize) -> i32 {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused `std::result::Result` that must be used
[INFO] [stderr]  --> src/deque/palindrome/palindrome.rs:6:9
[INFO] [stderr]   |
[INFO] [stderr] 6 |         d.add_rear(c);
[INFO] [stderr]   |         ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stderr]   = note: `#[warn(unused_must_use)]` on by default
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]   |
[INFO] [stderr] 6 |         let _ = d.add_rear(c);
[INFO] [stderr]   |         +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: comparison is useless due to type limits
[INFO] [stderr]   --> src/graph/adj_matrix.rs:58:12
[INFO] [stderr]    |
[INFO] [stderr] 58 |         if v < 0 || v >= self.v {
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: comparison is useless due to type limits
[INFO] [stderr]   --> src/graph/adj_list.rs:58:12
[INFO] [stderr]    |
[INFO] [stderr] 58 |         if v < 0 || v >= self.v {
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: comparison is useless due to type limits
[INFO] [stderr]   --> src/graph/adj_set.rs:58:12
[INFO] [stderr]    |
[INFO] [stderr] 58 |         if v < 0 || v >= self.v {
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: comparison is useless due to type limits
[INFO] [stderr]   --> src/graph/graph.rs:37:12
[INFO] [stderr]    |
[INFO] [stderr] 37 |         if v < 0 || v >= self.v {
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: comparison is useless due to type limits
[INFO] [stderr]   --> src/graph/graph_test.rs:38:12
[INFO] [stderr]    |
[INFO] [stderr] 38 |         if v < 0 || v >= self.v {
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `preorder` is never used
[INFO] [stderr]    --> src/tree/binary_tree.rs:218:4
[INFO] [stderr]     |
[INFO] [stderr] 218 | fn preorder<T: Clone + Ord + ToString + Debug>(bt: Link<T>) {
[INFO] [stderr]     |    ^^^^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: methods `size`, `is_empty`, and `min` are never used
[INFO] [stderr]   --> src/tree/binary_heap.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 8  | impl<T: Ord + Clone> BinaryHeap<T> {
[INFO] [stderr]    | ---------------------------------- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 16 |     fn size(&self) -> usize {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |     fn is_empty(&self) -> bool {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 25 |     fn min(&self) -> Option<T> {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used
[INFO] [stderr]    --> src/tree/bst.rs:203:8
[INFO] [stderr]     |
[INFO] [stderr] 15  | / impl<T, U> BST<T, U>
[INFO] [stderr] 16  | |     where T: Copy + Ord + Debug,
[INFO] [stderr] 17  | |           U: Copy + Debug,
[INFO] [stderr]     | |__________________________- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 203 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 207 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 247 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 259 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 272 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used
[INFO] [stderr]    --> src/tree/avl.rs:218:8
[INFO] [stderr]     |
[INFO] [stderr] 16  | / impl<T, U> AVLTree<T, U>
[INFO] [stderr] 17  | |     where T: Copy + Ord + Debug,
[INFO] [stderr] 18  | |           U: Copy + Debug,
[INFO] [stderr]     | |__________________________- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 218 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 222 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 262 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 274 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 287 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple methods are never used
[INFO] [stderr]    --> src/tree/bst_ori.rs:72:8
[INFO] [stderr]     |
[INFO] [stderr] 59  | / impl<T,U> BST<T,U>
[INFO] [stderr] 60  | |     where T: Copy + Ord + Debug,
[INFO] [stderr] 61  | |           U: Copy + Debug
[INFO] [stderr]     | |_________________________- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 72  |       fn is_empty(&self) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 76  |       fn size(&self) -> usize {
[INFO] [stderr]     |          ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 81  |       fn calc_size(&self, mut size: usize) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 99  |       fn leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 121 |       fn none_leaf_size(&self) -> usize {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 126 |       fn depth(&self) -> usize {
[INFO] [stderr]     |          ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 180 |       fn contains(&self, key: &T) -> bool {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 204 |       fn min(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 215 |       fn max(&self) -> (Option<&T>, Option<&U>) {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 227 |       fn get_left(&self) -> Link<T,U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 231 |       fn get_right(&self) -> Link<T,U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 236 |       fn get(&self, key: &T) -> Option<&U> {
[INFO] [stderr]     |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 272 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 284 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 296 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `basic` is never used
[INFO] [stderr]    --> src/tree/bst_ori.rs:382:8
[INFO] [stderr]     |
[INFO] [stderr] 382 |     fn basic() {
[INFO] [stderr]     |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used
[INFO] [stderr]    --> src/pra/bst_prac.rs:172:8
[INFO] [stderr]     |
[INFO] [stderr] 15  | / impl<T, U> BST<T, U>
[INFO] [stderr] 16  | |     where T: Copy + Debug + Ord,
[INFO] [stderr] 17  | |           U: Copy + Debug
[INFO] [stderr]     | |_________________________- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 172 |       fn get_left(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 176 |       fn get_right(&self) -> Link<T, U> {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 216 |       fn inorder(&self) {
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 230 |       fn postorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 244 |       fn levelorder(&self) {
[INFO] [stderr]     |          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: methods `has_edge`, `adj`, and `degree` are never used
[INFO] [stderr]    --> src/graph/adj_matrix.rs:160:8
[INFO] [stderr]     |
[INFO] [stderr] 15  | impl AdjMatrix {
[INFO] [stderr]     | -------------- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 160 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 168 |     fn adj(&self, v: usize) -> Vec<usize> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 183 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: field `e` is never read
[INFO] [stderr]   --> src/graph/adj_list.rs:12:9
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub struct AdjList {
[INFO] [stderr]    |            ------- field in this struct
[INFO] [stderr] 11 |     pub v: usize,
[INFO] [stderr] 12 |     pub e: usize,
[INFO] [stderr]    |         ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `AdjList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: methods `has_edge`, `adj`, and `degree` are never used
[INFO] [stderr]    --> src/graph/adj_list.rs:142:8
[INFO] [stderr]     |
[INFO] [stderr] 16  | impl AdjList {
[INFO] [stderr]     | ------------ methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 142 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 151 |     fn adj(&self, v: usize) -> &LinkedList<usize> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 160 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: field `e` is never read
[INFO] [stderr]   --> src/graph/adj_set.rs:12:9
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub struct AdjSet {
[INFO] [stderr]    |            ------ field in this struct
[INFO] [stderr] 11 |     pub v: usize,
[INFO] [stderr] 12 |     pub e: usize,
[INFO] [stderr]    |         ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `AdjSet` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: methods `has_edge`, `adj`, and `degree` are never used
[INFO] [stderr]    --> src/graph/adj_set.rs:141:8
[INFO] [stderr]     |
[INFO] [stderr] 16  | impl AdjSet {
[INFO] [stderr]     | ----------- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 141 |     fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |        ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 150 |     fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stderr]     |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 159 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: methods `print_adj`, `has_edge`, and `degree` are never used
[INFO] [stderr]    --> src/graph/graph.rs:105:12
[INFO] [stderr]     |
[INFO] [stderr] 16  | impl Graph {
[INFO] [stderr]     | ---------- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 105 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 123 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 141 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `order` is never used
[INFO] [stderr]   --> src/graph/single_source_path.rs:42:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | impl SingleSourcePath {
[INFO] [stderr]    | --------------------- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 42 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `order` is never used
[INFO] [stderr]   --> src/graph/path.rs:61:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | impl Path {
[INFO] [stderr]    | --------- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 61 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `order` is never used
[INFO] [stderr]   --> src/graph/cycle_detection.rs:39:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | impl CycleDetection {
[INFO] [stderr]    | ------------------- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 39 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: methods `print_adj`, `has_edge`, `adj`, and `degree` are never used
[INFO] [stderr]    --> src/graph/graph_test.rs:106:12
[INFO] [stderr]     |
[INFO] [stderr] 17  | impl GraphTest {
[INFO] [stderr]     | -------------- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 106 |     pub fn print_adj(&self, mut adj: Vec<BTreeSet<usize>>) -> Result<()> {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 124 |     pub fn has_edge(&self, v: usize, w: usize) -> bool {
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 133 |     pub fn adj(&self, v: usize) -> &BTreeSet<usize> {
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 142 |     fn degree(&self, v: usize) -> usize {
[INFO] [stderr]     |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `order` is never used
[INFO] [stderr]   --> src/graph/single_path_bfs.rs:62:8
[INFO] [stderr]    |
[INFO] [stderr] 15 | impl SinglePathGraphBFS {
[INFO] [stderr]    | ----------------------- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 62 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `order` is never used
[INFO] [stderr]   --> src/graph/u_s_s_s_path.rs:75:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | impl USSSPath {
[INFO] [stderr]    | ------------- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 75 |     fn order(&self) -> Vec<usize> {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `rust_datastruct` (lib) generated 165 warnings (run `cargo fix --lib -p rust_datastruct` to apply 34 suggestions)
[INFO] [stderr] warning: `rust_datastruct` (lib test) generated 98 warnings (79 duplicates)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.02s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/rust_datastruct-b9fd4de37fd98b9a)
[INFO] [stdout] 
[INFO] [stdout] running 69 tests
[INFO] [stdout] test bin_search::exponential_search::tests::exponential_search_test ... ok
[INFO] [stdout] test bin_search::binary_search::tests::binary_search_test ... ok
[INFO] [stdout] test bin_search::interpolation_search::tests::interpolation_search_test ... ok
[INFO] [stdout] test bin_search::sequential_search::tests::sequential_search_test ... ok
[INFO] [stdout] test bin_search::order_sequential_search::tests::order_sequential_search_test ... ok
[INFO] [stdout] test deque::deque::tests::deque_basic_test ... ok
[INFO] [stdout] test deque::deque::tests::deque_iter_test ... ok
[INFO] [stdout] test deque::palindrome::palindrome::tests::palindrome_test ... ok
[INFO] [stdout] test dp::dp_rec_mc_show::tests::dp_rec_mc_show_test ... ok
[INFO] [stdout] vertex:0 --> Map { iter: Iter([1, 2], 2) } 
[INFO] [stdout] vertex:1 --> Map { iter: Iter([0, 3, 4], 3) } 
[INFO] [stdout] vertex:2 --> Map { iter: Iter([0, 3, 6], 3) } 
[INFO] [stdout] vertex:3 --> Map { iter: Iter([1, 2], 2) } 
[INFO] [stdout] vertex:4 --> Map { iter: Iter([1], 1) } 
[INFO] [stdout] vertex:5 --> Map { iter: Iter([], 0) } 
[INFO] [stdout] vertex:6 --> Map { iter: Iter([2], 1) } 
[INFO] [stdout] 0 1 1 0 0 0 0 
[INFO] [stdout] 1 0 0 1 1 0 0 
[INFO] [stdout] 1 0 0 1 0 0 1 
[INFO] [stdout] 0 1 1 0 0 0 0 
[INFO] [stdout] 0 1 0 0 0 0 0 
[INFO] [stdout] 0 0 0 0 0 0 0 
[INFO] [stdout] 0 0 1 0 0 0 0 
[INFO] [stdout] test dp::dp_rec_mc::tests::dp_rec_mc_test ... ok
[INFO] [stdout] test dp::rec_cm2::tests::rec_mc2_test ... ok
[INFO] [stdout] vertex:0 --> Map { iter: Iter([1, 2]) } 
[INFO] [stdout] vertex:1 --> Map { iter: Iter([0, 3, 4]) } 
[INFO] [stdout] vertex:2 --> Map { iter: Iter([0, 3, 6]) } 
[INFO] [stdout] vertex:3 --> Map { iter: Iter([1, 2]) } 
[INFO] [stdout] vertex:4 --> Map { iter: Iter([1]) } 
[INFO] [stdout] vertex:5 --> Map { iter: Iter([]) } 
[INFO] [stdout] vertex:6 --> Map { iter: Iter([2]) } 
[INFO] [stdout] test graph::adj_list::tests::basic_test ... ok
[INFO] [stdout] test graph::adj_matrix::tests::basic_test ... ok
[INFO] [stdout] test graph::bi_partition_detection::tests::bp_test ... ok
[INFO] [stdout] test graph::adj_set::tests::basic_test ... ok
[INFO] [stdout] test dp::longest_substr::tests::longest_str_v2_test ... ok
[INFO] [stdout] test graph::cycle_detection::tests::dfs_test ... ok
[INFO] [stdout] test graph::graph::tests::basic_test ... ok
[INFO] [stdout] test graph::graph_bfs::tests::bfs_test ... ok
[INFO] [stdout] test graph::cc::tests::dfs_test ... ok
[INFO] [stdout] test graph::graph_test::tests::basic_test ... ok
[INFO] [stdout] test graph::single_source_path::tests::dfs_test ... ok
[INFO] [stdout] test hash_search::hash::tests::hash_search_basic_test ... ok
[INFO] [stdout] test graph::single_path_bfs::tests::bfs_test ... ok
[INFO] [stdout] test graph::path::tests::dfs_test ... ok
[INFO] [stdout] test dp::rec_cm1::tests::rec_mc1_test ... ok
[INFO] [stdout] test graph::graph_dfs::tests::dfs_test ... ok
[INFO] [stdout] test hash_search::hash::tests::hash_search_iter_test ... ok
[INFO] [stdout] test linklist::linklist::tests::basic_test ... ok
[INFO] [stdout] test linklist::linklist::tests::into_iter_test ... ok
[INFO] [stdout] test graph::u_s_s_s_path::tests::bfs_test ... ok
[INFO] [stdout] test linklist::linklist::tests::iter_mut_test ... ok
[INFO] [stdout] test linklist::linkliststack::linklist_stack::tests::basic ... ok
[INFO] [stdout] test pra::bst_prac::tests::basic_test ... ok
[INFO] [stdout] test queue::hot_potato::potato::tests::hot_potato_test ... ok
[INFO] [stdout] test linklist::linkliststack::linklist_stack::tests::iter ... ok
[INFO] [stdout] test pra::bst_prac::tests::order ... ok
[INFO] [stdout] test queue::queue::tests::queue_basic_test ... ok
[INFO] [stdout] test recursion::hanoi::tests::hanoi_test ... ok
[INFO] [stdout] test recursion::num2str_rec::tests::num2str_rec_test ... ok
[INFO] [stdout] test recursion::recursion::tests::nums_sum_test ... ok
[INFO] [stdout] test sort::heap_sort::tests::max_heap_test ... ok
[INFO] [stdout] test sort::merge_sort::tests::merge_sort_test ... ok
[INFO] [stdout] test sort::bubble_sort::tests::bubble_sort2_test ... ok
[INFO] [stdout] test queue::queue::tests::queue_iter_test ... ok
[INFO] [stdout] test sort::quick_sort::tests::quick_sort_test ... ok
[INFO] [stdout] test sort::bubble_sort::tests::bubble_sort_test ... ok
[INFO] [stdout] test stack::nsc::number_system_conv::tests::base_conv_test ... ok
[INFO] [stdout] test stack::nsc::number_system_conv::tests::conv_test ... ok
[INFO] [stdout] test stack::parentheses_matching::parentheses_matching::tests::parentheses1_test ... ok
[INFO] [stdout] test stack::parentheses_matching::parentheses_matching::tests::parentheses2_test ... ok
[INFO] [stdout] test stack::stack::tests::peek ... ok
[INFO] [stdout] test stack::suffix::infix_to_suffix::tests::prefix_test ... ok
[INFO] [stdout] test stack::stack::tests::basic ... ok
[INFO] [stdout] test stack::parentheses_matching::parentheses_matching::tests::parentheses3_test ... ok
[INFO] [stdout] test stack::stack::tests::iter ... ok
[INFO] [stdout] test stack::suffix::infix_to_suffix::tests::suffix_eval_test ... ok
[INFO] [stdout] test stack::suffix::infix_to_suffix::tests::suffix_test ... ok
[INFO] [stdout] test tree::binary_tree::tests::basic_test ... ok
[INFO] [stdout] test tree::binary_heap::tests::binary_heap_test ... ok
[INFO] [stdout] test tree::binary_tree::tests::order_test ... ok
[INFO] [stdout] test tree::bst::tests::order ... ok
[INFO] [stdout] test tree::bst::tests::basic_test ... ok
[INFO] [stdout] test tree::bst_ori::tests::order ... ok
[INFO] [stdout] test vec::vec_impl::tests::basic ... ok
[INFO] [stdout] test vec::vec_impl::tests::iter ... ok
[INFO] [stdout] test tree::avl::tests::basic_test ... FAILED
[INFO] [stdout] test tree::avl::tests::order ... FAILED
[INFO] [stdout] test dp::longest_substr::tests::longest_str_v1_test ... ok
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout] 
[INFO] [stdout] ---- tree::avl::tests::basic_test stdout ----
[INFO] [stdout] bst depth: 1
[INFO] [stdout] bst: AVLTree { key: None, val: None, left: None, right: None, height: 1 }
[INFO] [stdout] thread 'tree::avl::tests::basic_test' panicked at src/tree/avl.rs:38:9:
[INFO] [stdout] not yet implemented
[INFO] [stdout] stack backtrace:
[INFO] [stdout]    0:     0x555d8e394ae5 - std::backtrace_rs::backtrace::libunwind::trace::h59d96bdb08384354
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/../../backtrace/src/backtrace/libunwind.rs:105:5
[INFO] [stdout]    1:     0x555d8e394ae5 - std::backtrace_rs::backtrace::trace_unsynchronized::h9cf5becacfc93fba
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5
[INFO] [stdout]    2:     0x555d8e394ae5 - std::sys_common::backtrace::_print_fmt::h10b76d10405dbd48
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:68:5
[INFO] [stdout]    3:     0x555d8e394ae5 - <std::sys_common::backtrace::_print::DisplayBacktrace as core::fmt::Display>::fmt::h6ed9e62a156d84e4
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:44:22
[INFO] [stdout]    4:     0x555d8e3bb48b - core::fmt::rt::Argument::fmt::h645c680983f03c9f
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/fmt/rt.rs:165:63
[INFO] [stdout]    5:     0x555d8e3bb48b - core::fmt::write::h8bcd80919a02be29
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/fmt/mod.rs:1169:21
[INFO] [stdout]    6:     0x555d8e39231f - std::io::Write::write_fmt::h8d0c47c662cad79c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/io/mod.rs:1835:15
[INFO] [stdout]    7:     0x555d8e3948be - std::sys_common::backtrace::_print::h6306f131a28d62b0
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:47:5
[INFO] [stdout]    8:     0x555d8e3948be - std::sys_common::backtrace::print::h7079288e0a26dfcc
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:34:9
[INFO] [stdout]    9:     0x555d8e3962e9 - std::panicking::default_hook::{{closure}}::hb063ecec81a736ba
[INFO] [stdout]   10:     0x555d8e395fae - std::panicking::default_hook::hd56ee406bf547b5c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:295:9
[INFO] [stdout]   11:     0x555d8e366a3a - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::he5eacdef44c8728f
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2036:9
[INFO] [stdout]   12:     0x555d8e366a3a - test::test_main::{{closure}}::h0ec9aed229e79095
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:137:21
[INFO] [stdout]   13:     0x555d8e3968eb - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::hcbd0d80e1ad4e4f9
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2036:9
[INFO] [stdout]   14:     0x555d8e3968eb - std::panicking::rust_panic_with_hook::h624aa3ca42ebb8f2
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:799:13
[INFO] [stdout]   15:     0x555d8e39662b - std::panicking::begin_panic_handler::{{closure}}::hbc4e76194a5e287c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:656:13
[INFO] [stdout]   16:     0x555d8e394fa9 - std::sys_common::backtrace::__rust_end_short_backtrace::h847fedc9d1ff7b6d
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:171:18
[INFO] [stdout]   17:     0x555d8e396397 - rust_begin_unwind
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:652:5
[INFO] [stdout]   18:     0x555d8e2c2913 - core::panicking::panic_fmt::hec11a924b87ce965
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panicking.rs:72:14
[INFO] [stdout]   19:     0x555d8e2c29bc - core::panicking::panic::hb6a980c1ddfde273
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panicking.rs:146:5
[INFO] [stdout]   20:     0x555d8e2e7541 - rust_datastruct::tree::avl::AVLTree<T,U>::get_balance_factor::hfdb2ee6080b2e8e1
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:38:9
[INFO] [stdout]   21:     0x555d8e2e7c74 - rust_datastruct::tree::avl::AVLTree<T,U>::insert::he166a8e8ec355a7b
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:156:50
[INFO] [stdout]   22:     0x555d8e305e8f - rust_datastruct::tree::avl::tests::basic_test::hd43d473a2bc68de4
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:325:9
[INFO] [stdout]   23:     0x555d8e305c87 - rust_datastruct::tree::avl::tests::basic_test::{{closure}}::hfbcc5299e80cb608
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:319:20
[INFO] [stdout]   24:     0x555d8e3180b6 - core::ops::function::FnOnce::call_once::hbc0a6a0ff3d1c0ed
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   25:     0x555d8e36b41b - core::ops::function::FnOnce::call_once::h2e43a8f6f3d94b99
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   26:     0x555d8e36b41b - test::__rust_begin_short_backtrace::h214c9f2d2d3fee90
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:625:18
[INFO] [stdout]   27:     0x555d8e36ab21 - test::run_test_in_process::{{closure}}::h510b7ba7990692a5
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:648:60
[INFO] [stdout]   28:     0x555d8e36ab21 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h4157186197a93871
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   29:     0x555d8e36ab21 - std::panicking::try::do_call::h1bf2463bccd4b28c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:559:40
[INFO] [stdout]   30:     0x555d8e36ab21 - std::panicking::try::hd6d4808c9fab4fa5
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:523:19
[INFO] [stdout]   31:     0x555d8e36ab21 - std::panic::catch_unwind::hd5641d97d123f9f2
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panic.rs:149:14
[INFO] [stdout]   32:     0x555d8e36ab21 - test::run_test_in_process::hc273b71c8b878a4c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:648:27
[INFO] [stdout]   33:     0x555d8e36ab21 - test::run_test::{{closure}}::h6838df834eb8467e
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:569:43
[INFO] [stdout]   34:     0x555d8e3334e4 - test::run_test::{{closure}}::h608b98ecff5665fb
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:599:41
[INFO] [stdout]   35:     0x555d8e3334e4 - std::sys_common::backtrace::__rust_begin_short_backtrace::hdc4182b97d1042e9
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:155:18
[INFO] [stdout]   36:     0x555d8e337f12 - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::h571773fd21d674c8
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/thread/mod.rs:542:17
[INFO] [stdout]   37:     0x555d8e337f12 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::hdcd384cf2fa70ba3
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   38:     0x555d8e337f12 - std::panicking::try::do_call::h4f1a44bd81423be1
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:559:40
[INFO] [stdout]   39:     0x555d8e337f12 - std::panicking::try::h5e02afcb81dcd361
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:523:19
[INFO] [stdout]   40:     0x555d8e337f12 - std::panic::catch_unwind::h022f75775bfd8c45
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panic.rs:149:14
[INFO] [stdout]   41:     0x555d8e337f12 - std::thread::Builder::spawn_unchecked_::{{closure}}::hf5a62e9e4e6df1f8
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/thread/mod.rs:541:30
[INFO] [stdout]   42:     0x555d8e337f12 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h6d56360aeb9509a7
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   43:     0x555d8e39aacb - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h7a343dc551c06baa
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2022:9
[INFO] [stdout]   44:     0x555d8e39aacb - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h30b8111cbaa644f3
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2022:9
[INFO] [stdout]   45:     0x555d8e39aacb - std::sys::pal::unix::thread::Thread::new::thread_start::h7404e134e61e7a11
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys/pal/unix/thread.rs:108:17
[INFO] [stdout]   46:     0x7f68aad76ac3 - <unknown>
[INFO] [stdout]   47:     0x7f68aae07a04 - __clone
[INFO] [stdout]   48:                0x0 - <unknown>
[INFO] [stdout] 
[INFO] [stdout] ---- tree::avl::tests::order stdout ----
[INFO] [stdout] thread 'tree::avl::tests::order' panicked at src/tree/avl.rs:38:9:
[INFO] [stdout] not yet implemented
[INFO] [stdout] stack backtrace:
[INFO] [stdout]    0:     0x555d8e394ae5 - std::backtrace_rs::backtrace::libunwind::trace::h59d96bdb08384354
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/../../backtrace/src/backtrace/libunwind.rs:105:5
[INFO] [stdout]    1:     0x555d8e394ae5 - std::backtrace_rs::backtrace::trace_unsynchronized::h9cf5becacfc93fba
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5
[INFO] [stdout]    2:     0x555d8e394ae5 - std::sys_common::backtrace::_print_fmt::h10b76d10405dbd48
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:68:5
[INFO] [stdout]    3:     0x555d8e394ae5 - <std::sys_common::backtrace::_print::DisplayBacktrace as core::fmt::Display>::fmt::h6ed9e62a156d84e4
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:44:22
[INFO] [stdout]    4:     0x555d8e3bb48b - core::fmt::rt::Argument::fmt::h645c680983f03c9f
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/fmt/rt.rs:165:63
[INFO] [stdout]    5:     0x555d8e3bb48b - core::fmt::write::h8bcd80919a02be29
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/fmt/mod.rs:1169:21
[INFO] [stdout]    6:     0x555d8e39231f - std::io::Write::write_fmt::h8d0c47c662cad79c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/io/mod.rs:1835:15
[INFO] [stdout]    7:     0x555d8e3948be - std::sys_common::backtrace::_print::h6306f131a28d62b0
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:47:5
[INFO] [stdout]    8:     0x555d8e3948be - std::sys_common::backtrace::print::h7079288e0a26dfcc
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:34:9
[INFO] [stdout]    9:     0x555d8e3962e9 - std::panicking::default_hook::{{closure}}::hb063ecec81a736ba
[INFO] [stdout]   10:     0x555d8e395fae - std::panicking::default_hook::hd56ee406bf547b5c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:295:9
[INFO] [stdout]   11:     0x555d8e366a3a - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::he5eacdef44c8728f
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2036:9
[INFO] [stdout]   12:     0x555d8e366a3a - test::test_main::{{closure}}::h0ec9aed229e79095
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:137:21
[INFO] [stdout]   13:     0x555d8e3968eb - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::hcbd0d80e1ad4e4f9
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2036:9
[INFO] [stdout]   14:     0x555d8e3968eb - std::panicking::rust_panic_with_hook::h624aa3ca42ebb8f2
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:799:13
[INFO] [stdout]   15:     0x555d8e39662b - std::panicking::begin_panic_handler::{{closure}}::hbc4e76194a5e287c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:656:13
[INFO] [stdout]   16:     0x555d8e394fa9 - std::sys_common::backtrace::__rust_end_short_backtrace::h847fedc9d1ff7b6d
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:171:18
[INFO] [stdout]   17:     0x555d8e396397 - rust_begin_unwind
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:652:5
[INFO] [stdout]   18:     0x555d8e2c2913 - core::panicking::panic_fmt::hec11a924b87ce965
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panicking.rs:72:14
[INFO] [stdout]   19:     0x555d8e2c29bc - core::panicking::panic::hb6a980c1ddfde273
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panicking.rs:146:5
[INFO] [stdout]   20:     0x555d8e2e7541 - rust_datastruct::tree::avl::AVLTree<T,U>::get_balance_factor::hfdb2ee6080b2e8e1
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:38:9
[INFO] [stdout]   21:     0x555d8e2e7c74 - rust_datastruct::tree::avl::AVLTree<T,U>::insert::he166a8e8ec355a7b
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:156:50
[INFO] [stdout]   22:     0x555d8e306bf5 - rust_datastruct::tree::avl::tests::order::ha1173f9809df52a7
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:359:9
[INFO] [stdout]   23:     0x555d8e306b77 - rust_datastruct::tree::avl::tests::order::{{closure}}::h650bc021e4d2dfae
[INFO] [stdout]                                at /opt/rustwide/workdir/src/tree/avl.rs:356:15
[INFO] [stdout]   24:     0x555d8e317286 - core::ops::function::FnOnce::call_once::h1e9d1e88e151119e
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   25:     0x555d8e36b41b - core::ops::function::FnOnce::call_once::h2e43a8f6f3d94b99
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   26:     0x555d8e36b41b - test::__rust_begin_short_backtrace::h214c9f2d2d3fee90
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:625:18
[INFO] [stdout]   27:     0x555d8e36ab21 - test::run_test_in_process::{{closure}}::h510b7ba7990692a5
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:648:60
[INFO] [stdout]   28:     0x555d8e36ab21 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h4157186197a93871
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   29:     0x555d8e36ab21 - std::panicking::try::do_call::h1bf2463bccd4b28c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:559:40
[INFO] [stdout]   30:     0x555d8e36ab21 - std::panicking::try::hd6d4808c9fab4fa5
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:523:19
[INFO] [stdout]   31:     0x555d8e36ab21 - std::panic::catch_unwind::hd5641d97d123f9f2
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panic.rs:149:14
[INFO] [stdout]   32:     0x555d8e36ab21 - test::run_test_in_process::hc273b71c8b878a4c
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:648:27
[INFO] [stdout]   33:     0x555d8e36ab21 - test::run_test::{{closure}}::h6838df834eb8467e
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:569:43
[INFO] [stdout]   34:     0x555d8e3334e4 - test::run_test::{{closure}}::h608b98ecff5665fb
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/test/src/lib.rs:599:41
[INFO] [stdout]   35:     0x555d8e3334e4 - std::sys_common::backtrace::__rust_begin_short_backtrace::hdc4182b97d1042e9
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys_common/backtrace.rs:155:18
[INFO] [stdout]   36:     0x555d8e337f12 - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::h571773fd21d674c8
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/thread/mod.rs:542:17
[INFO] [stdout]   37:     0x555d8e337f12 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::hdcd384cf2fa70ba3
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   38:     0x555d8e337f12 - std::panicking::try::do_call::h4f1a44bd81423be1
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:559:40
[INFO] [stdout]   39:     0x555d8e337f12 - std::panicking::try::h5e02afcb81dcd361
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panicking.rs:523:19
[INFO] [stdout]   40:     0x555d8e337f12 - std::panic::catch_unwind::h022f75775bfd8c45
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/panic.rs:149:14
[INFO] [stdout]   41:     0x555d8e337f12 - std::thread::Builder::spawn_unchecked_::{{closure}}::hf5a62e9e4e6df1f8
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/thread/mod.rs:541:30
[INFO] [stdout]   42:     0x555d8e337f12 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h6d56360aeb9509a7
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   43:     0x555d8e39aacb - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h7a343dc551c06baa
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2022:9
[INFO] [stdout]   44:     0x555d8e39aacb - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h30b8111cbaa644f3
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/alloc/src/boxed.rs:2022:9
[INFO] [stdout]   45:     0x555d8e39aacb - std::sys::pal::unix::thread::Thread::new::thread_start::h7404e134e61e7a11
[INFO] [stdout]                                at /rustc/1871252fc8bb672d40787e67404e6eaae7059369/library/std/src/sys/pal/unix/thread.rs:108:17
[INFO] [stdout]   46:     0x7f68aad76ac3 - <unknown>
[INFO] [stdout]   47:     0x7f68aae07a04 - __clone
[INFO] [stdout]   48:                0x0 - <unknown>
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout]     tree::avl::tests::basic_test
[INFO] [stdout]     tree::avl::tests::order
[INFO] [stdout] 
[INFO] [stdout] test result: FAILED. 67 passed; 2 failed; 0 ignored; 0 measured; 0 filtered out; finished in 4.01s
[INFO] [stdout] 
[INFO] [stderr] error: test failed, to rerun pass `--lib`
[INFO] running `Command { std: "docker" "inspect" "169eb0b0a7059a52988180aeb1e453d2ab41b1ef83e991aba3b5203257d5c924", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "169eb0b0a7059a52988180aeb1e453d2ab41b1ef83e991aba3b5203257d5c924", kill_on_drop: false }`
[INFO] [stdout] 169eb0b0a7059a52988180aeb1e453d2ab41b1ef83e991aba3b5203257d5c924
