[INFO] cloning repository https://github.com/weixinZhang12/data_structure
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/weixinZhang12/data_structure" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FweixinZhang12%2Fdata_structure", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FweixinZhang12%2Fdata_structure'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] e814610674fc6773950597663c7f9e5d98ebcadb
[INFO] checking weixinZhang12/data_structure against master#779e19d8baa3e3625bd4fc5c85cbb2ad47b43155 for pr-147589-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FweixinZhang12%2Fdata_structure" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/weixinZhang12/data_structure
[INFO] finished tweaking git repo https://github.com/weixinZhang12/data_structure
[INFO] tweaked toml for git repo https://github.com/weixinZhang12/data_structure written to /workspace/builds/worker-0-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/weixinZhang12/data_structure on toolchain 779e19d8baa3e3625bd4fc5c85cbb2ad47b43155
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/weixinZhang12/data_structure already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded serde_json v1.0.129
[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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 711616d46a0f123eb695241ab8eeef1a82f17d6fa820b929d3a788622df55d88
[INFO] running `Command { std: "docker" "start" "-a" "711616d46a0f123eb695241ab8eeef1a82f17d6fa820b929d3a788622df55d88", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "711616d46a0f123eb695241ab8eeef1a82f17d6fa820b929d3a788622df55d88", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "711616d46a0f123eb695241ab8eeef1a82f17d6fa820b929d3a788622df55d88", kill_on_drop: false }`
[INFO] [stdout] 711616d46a0f123eb695241ab8eeef1a82f17d6fa820b929d3a788622df55d88
[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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+779e19d8baa3e3625bd4fc5c85cbb2ad47b43155" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 75c56d7a629ef7abf5294b8b22dfc45b125e5054ab891107be9588c8d07423fd
[INFO] running `Command { std: "docker" "start" "-a" "75c56d7a629ef7abf5294b8b22dfc45b125e5054ab891107be9588c8d07423fd", kill_on_drop: false }`
[INFO] [stderr]    Compiling unicase v2.7.0
[INFO] [stderr]     Checking http v0.2.12
[INFO] [stderr]    Compiling serde v1.0.210
[INFO] [stderr]    Compiling zerocopy-derive v0.7.35
[INFO] [stderr]     Checking futures-util v0.3.31
[INFO] [stderr]    Compiling thiserror-impl v1.0.64
[INFO] [stderr]     Checking tracing v0.1.40
[INFO] [stderr]    Compiling multer v2.1.0
[INFO] [stderr]    Compiling serde_json v1.0.129
[INFO] [stderr]    Compiling pin-project-internal v1.1.6
[INFO] [stderr]    Compiling mime_guess v2.0.5
[INFO] [stderr]     Checking zerocopy v0.7.35
[INFO] [stderr]     Checking http-body v0.4.6
[INFO] [stderr]     Checking headers-core v0.2.0
[INFO] [stderr]     Checking thiserror v1.0.64
[INFO] [stderr]     Checking headers v0.3.9
[INFO] [stderr]     Checking pin-project v1.1.6
[INFO] [stderr]     Checking ppv-lite86 v0.2.20
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking h2 v0.3.26
[INFO] [stderr]     Checking tungstenite v0.21.0
[INFO] [stderr]     Checking serde_urlencoded v0.7.1
[INFO] [stderr]     Checking tokio-tungstenite v0.21.0
[INFO] [stderr]     Checking hyper v0.14.31
[INFO] [stderr]     Checking warp v0.3.7
[INFO] [stderr]     Checking wrap v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused imports: `collections::HashMap`, `time::Instant`, and `vec`
[INFO] [stdout]  --> src/main.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::HashMap, time::Instant, vec};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^  ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `b_tree::b_tree_link::Btree`
[INFO] [stdout]  --> src/main.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use b_tree::b_tree_link::Btree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `recursion::normal::memoized_feibo`
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use recursion::normal::memoized_feibo;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_node` should have an upper camel case name
[INFO] [stdout]  --> src/hash.rs:3:16
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub struct hash_node {
[INFO] [stdout]   |                ^^^^^^^^^ help: convert the identifier to upper camel case: `HashNode`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_camel_case_types)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hashmap` should have an upper camel case name
[INFO] [stdout]  --> src/hash.rs:9:16
[INFO] [stdout]   |
[INFO] [stdout] 9 |     pub struct hashmap {
[INFO] [stdout]   |                ^^^^^^^ help: convert the identifier to upper camel case: `Hashmap`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `collections::HashMap`, `time::Instant`, and `vec`
[INFO] [stdout]  --> src/main.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::HashMap, time::Instant, vec};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^  ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `b_tree::b_tree_link::Btree`
[INFO] [stdout]  --> src/main.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use b_tree::b_tree_link::Btree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `recursion::normal::memoized_feibo`
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use recursion::normal::memoized_feibo;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hash_node` should have an upper camel case name
[INFO] [stdout]  --> src/hash.rs:3:16
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub struct hash_node {
[INFO] [stdout]   |                ^^^^^^^^^ help: convert the identifier to upper camel case: `HashNode`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_camel_case_types)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `hashmap` should have an upper camel case name
[INFO] [stdout]  --> src/hash.rs:9:16
[INFO] [stdout]   |
[INFO] [stdout] 9 |     pub struct hashmap {
[INFO] [stdout]   |                ^^^^^^^ help: convert the identifier to upper camel case: `Hashmap`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `value`
[INFO] [stdout]   --> src/b_tree.rs:27:32
[INFO] [stdout]    |
[INFO] [stdout] 27 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]    |                                ^^^^^ help: if this is intentional, prefix it with an underscore: `_value`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/b_tree.rs:29:28
[INFO] [stdout]    |
[INFO] [stdout] 29 |             while let Some(v) = unsafe { &mut *current_node } {}
[INFO] [stdout]    |                            ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/b_tree.rs:43:17
[INFO] [stdout]    |
[INFO] [stdout] 43 |             for i in 0..length {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `value`
[INFO] [stdout]   --> src/b_tree.rs:27:32
[INFO] [stdout]    |
[INFO] [stdout] 27 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]    |                                ^^^^^ help: if this is intentional, prefix it with an underscore: `_value`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/b_tree.rs:29:28
[INFO] [stdout]    |
[INFO] [stdout] 29 |             while let Some(v) = unsafe { &mut *current_node } {}
[INFO] [stdout]    |                            ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/b_tree.rs:43:17
[INFO] [stdout]    |
[INFO] [stdout] 43 |             for i in 0..length {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]    --> src/b_tree.rs:127:21
[INFO] [stdout]     |
[INFO] [stdout] 127 |                 for i in 0..c {
[INFO] [stdout]     |                     ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]    --> src/b_tree.rs:127:21
[INFO] [stdout]     |
[INFO] [stdout] 127 |                 for i in 0..c {
[INFO] [stdout]     |                     ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `arr_value`
[INFO] [stdout]    --> src/b_tree.rs:173:26
[INFO] [stdout]     |
[INFO] [stdout] 173 |             for (index, &arr_value) in self.arr.iter().enumerate() {
[INFO] [stdout]     |                          ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_arr_value`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `arr_value`
[INFO] [stdout]    --> src/b_tree.rs:173:26
[INFO] [stdout]     |
[INFO] [stdout] 173 |             for (index, &arr_value) in self.arr.iter().enumerate() {
[INFO] [stdout]     |                          ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_arr_value`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/recursion.rs:10:13
[INFO] [stdout]    |
[INFO] [stdout] 10 |         let mut t1 = feibo(value - 1);
[INFO] [stdout]    |             ----^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/recursion.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut t2 = feibo(value - 2);
[INFO] [stdout]    |             ----^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `t1` is never read
[INFO] [stdout]   --> src/recursion.rs:21:22
[INFO] [stdout]    |
[INFO] [stdout] 21 |         let mut t1 = 0;
[INFO] [stdout]    |                      ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `t2` is never read
[INFO] [stdout]   --> src/recursion.rs:22:22
[INFO] [stdout]    |
[INFO] [stdout] 22 |         let mut t2 = 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/recursion.rs:10:13
[INFO] [stdout]    |
[INFO] [stdout] 10 |         let mut t1 = feibo(value - 1);
[INFO] [stdout]    |             ----^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/recursion.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut t2 = feibo(value - 2);
[INFO] [stdout]    |             ----^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `t1` is never read
[INFO] [stdout]   --> src/recursion.rs:21:22
[INFO] [stdout]    |
[INFO] [stdout] 21 |         let mut t1 = 0;
[INFO] [stdout]    |                      ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `t2` is never read
[INFO] [stdout]   --> src/recursion.rs:22:22
[INFO] [stdout]    |
[INFO] [stdout] 22 |         let mut t2 = 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/hash.rs:56:17
[INFO] [stdout]    |
[INFO] [stdout] 56 |             let mut first = self.hash(key);
[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.rs:97:17
[INFO] [stdout]    |
[INFO] [stdout] 97 |             let mut key = key;
[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.rs:56:17
[INFO] [stdout]    |
[INFO] [stdout] 56 |             let mut first = self.hash(key);
[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.rs:97:17
[INFO] [stdout]    |
[INFO] [stdout] 97 |             let mut key = key;
[INFO] [stdout]    |                 ----^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BTreeNode` is never constructed
[INFO] [stdout]  --> src/b_tree.rs:5:16
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub struct BTreeNode {
[INFO] [stdout]   |                ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Btree` is never constructed
[INFO] [stdout]   --> src/b_tree.rs:11:16
[INFO] [stdout]    |
[INFO] [stdout] 11 |     pub struct Btree {
[INFO] [stdout]    |                ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/b_tree.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 |     impl BTreeNode {
[INFO] [stdout]    |     -------------- associated function in this implementation
[INFO] [stdout] 15 |         fn new(value: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/b_tree.rs:24:16
[INFO] [stdout]     |
[INFO] [stdout]  23 |     impl Btree {
[INFO] [stdout]     |     ---------- associated items in this implementation
[INFO] [stdout]  24 |         pub fn new() -> Self {
[INFO] [stdout]     |                ^^^
[INFO] [stdout] ...
[INFO] [stdout]  27 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]     |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout]  32 |         pub fn index_to_lr(&self, mut index: usize) -> Vec<usize> {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  51 |         pub fn vec_to_tree(&mut self, arr: Vec<i32>) {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  85 |         fn prin_t(&self, root: &Option<Box<BTreeNode>>) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  95 |         pub fn print_tree(&self) {
[INFO] [stdout]     |                ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  98 |         fn di_vec(&self, root: &Option<Box<BTreeNode>>, arr: &mut Vec<i32>) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |         pub fn tree_to_vec(&self) -> Vec<i32> {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 120 |         fn vis(&self,root:&Option<Box<BTreeNode>>,mut c:i32){
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 136 |         pub fn vision(&self){
[INFO] [stdout]     |                ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MAX_INDEX` is never used
[INFO] [stdout]    --> src/b_tree.rs:149:11
[INFO] [stdout]     |
[INFO] [stdout] 149 |     const MAX_INDEX: usize = 15;
[INFO] [stdout]     |           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Btree` is never constructed
[INFO] [stdout]    --> src/b_tree.rs:151:16
[INFO] [stdout]     |
[INFO] [stdout] 151 |     pub struct Btree {
[INFO] [stdout]     |                ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/b_tree.rs:155:16
[INFO] [stdout]     |
[INFO] [stdout] 154 |     impl Btree {
[INFO] [stdout]     |     ---------- associated items in this implementation
[INFO] [stdout] 155 |         pub fn new() -> Self {
[INFO] [stdout]     |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 164 |         fn index_check(&self, index: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 171 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]     |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 189 |         pub fn insert(&mut self, index: usize, value: i32) -> Result<(), Box<dyn Error>> {
[INFO] [stdout]     |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 199 |         pub fn get_partent(&mut self, index: usize) -> Option<i32> {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |         pub fn get_left(&mut self, index: usize) -> Option<i32> {
[INFO] [stdout]     |                ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 245 |         pub fn get_right(&mut self, index: usize) -> Option<i32> {
[INFO] [stdout]     |                ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 264 |         pub fn get_iter(&self) -> &[Option<i32>] {
[INFO] [stdout]     |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkNode` is never constructed
[INFO] [stdout]  --> src/linklist.rs:5:16
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub struct LinkNode {
[INFO] [stdout]   |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkList` is never constructed
[INFO] [stdout]   --> src/linklist.rs:11:16
[INFO] [stdout]    |
[INFO] [stdout] 11 |     pub struct LinkList {
[INFO] [stdout]    |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `delete`, `pop`, and `take_head` are never used
[INFO] [stdout]   --> src/linklist.rs:16:16
[INFO] [stdout]    |
[INFO] [stdout] 15 |     impl LinkList {
[INFO] [stdout]    |     ------------- associated items in this implementation
[INFO] [stdout] 16 |         pub fn new() -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]    |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |         pub fn delete(&mut self, value: i32) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |         pub fn pop(&mut self) -> Option<i32> {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |         pub fn take_head(&mut self) {
[INFO] [stdout]    |                ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `feibo` is never used
[INFO] [stdout]  --> src/recursion.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn feibo(value: u32) -> u32 {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memoized_feibo` is never used
[INFO] [stdout]   --> src/recursion.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 15 |     pub fn memoized_feibo(value: u128, map:&mut  HashMap<u128, u128>) -> u128 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `val` is never read
[INFO] [stdout]  --> src/hash.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub struct hash_node {
[INFO] [stdout]   |                --------- field in this struct
[INFO] [stdout] 4 |         pub key: usize,
[INFO] [stdout] 5 |         pub val: String,
[INFO] [stdout]   |             ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `hash_node` has derived impls for the traits `Debug` and `Clone`, but these are intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `insert` and `find_new_index` are never used
[INFO] [stdout]   --> src/hash.rs:33:16
[INFO] [stdout]    |
[INFO] [stdout] 19 |     impl hashmap {
[INFO] [stdout]    |     ------------ methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |         pub fn insert(&mut self, key: usize, val: String) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |         fn find_new_index(&self, key: usize, first_index: usize) -> Option<usize> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BTreeNode` is never constructed
[INFO] [stdout]  --> src/b_tree.rs:5:16
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub struct BTreeNode {
[INFO] [stdout]   |                ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Btree` is never constructed
[INFO] [stdout]   --> src/b_tree.rs:11:16
[INFO] [stdout]    |
[INFO] [stdout] 11 |     pub struct Btree {
[INFO] [stdout]    |                ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/b_tree.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 |     impl BTreeNode {
[INFO] [stdout]    |     -------------- associated function in this implementation
[INFO] [stdout] 15 |         fn new(value: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/b_tree.rs:24:16
[INFO] [stdout]     |
[INFO] [stdout]  23 |     impl Btree {
[INFO] [stdout]     |     ---------- associated items in this implementation
[INFO] [stdout]  24 |         pub fn new() -> Self {
[INFO] [stdout]     |                ^^^
[INFO] [stdout] ...
[INFO] [stdout]  27 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]     |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout]  32 |         pub fn index_to_lr(&self, mut index: usize) -> Vec<usize> {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  51 |         pub fn vec_to_tree(&mut self, arr: Vec<i32>) {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  85 |         fn prin_t(&self, root: &Option<Box<BTreeNode>>) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  95 |         pub fn print_tree(&self) {
[INFO] [stdout]     |                ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  98 |         fn di_vec(&self, root: &Option<Box<BTreeNode>>, arr: &mut Vec<i32>) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |         pub fn tree_to_vec(&self) -> Vec<i32> {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 120 |         fn vis(&self,root:&Option<Box<BTreeNode>>,mut c:i32){
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 136 |         pub fn vision(&self){
[INFO] [stdout]     |                ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MAX_INDEX` is never used
[INFO] [stdout]    --> src/b_tree.rs:149:11
[INFO] [stdout]     |
[INFO] [stdout] 149 |     const MAX_INDEX: usize = 15;
[INFO] [stdout]     |           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Btree` is never constructed
[INFO] [stdout]    --> src/b_tree.rs:151:16
[INFO] [stdout]     |
[INFO] [stdout] 151 |     pub struct Btree {
[INFO] [stdout]     |                ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/b_tree.rs:155:16
[INFO] [stdout]     |
[INFO] [stdout] 154 |     impl Btree {
[INFO] [stdout]     |     ---------- associated items in this implementation
[INFO] [stdout] 155 |         pub fn new() -> Self {
[INFO] [stdout]     |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 164 |         fn index_check(&self, index: usize) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 171 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]     |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 189 |         pub fn insert(&mut self, index: usize, value: i32) -> Result<(), Box<dyn Error>> {
[INFO] [stdout]     |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 199 |         pub fn get_partent(&mut self, index: usize) -> Option<i32> {
[INFO] [stdout]     |                ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |         pub fn get_left(&mut self, index: usize) -> Option<i32> {
[INFO] [stdout]     |                ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 245 |         pub fn get_right(&mut self, index: usize) -> Option<i32> {
[INFO] [stdout]     |                ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 264 |         pub fn get_iter(&self) -> &[Option<i32>] {
[INFO] [stdout]     |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkNode` is never constructed
[INFO] [stdout]  --> src/linklist.rs:5:16
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub struct LinkNode {
[INFO] [stdout]   |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkList` is never constructed
[INFO] [stdout]   --> src/linklist.rs:11:16
[INFO] [stdout]    |
[INFO] [stdout] 11 |     pub struct LinkList {
[INFO] [stdout]    |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `delete`, `pop`, and `take_head` are never used
[INFO] [stdout]   --> src/linklist.rs:16:16
[INFO] [stdout]    |
[INFO] [stdout] 15 |     impl LinkList {
[INFO] [stdout]    |     ------------- associated items in this implementation
[INFO] [stdout] 16 |         pub fn new() -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |         pub fn push(&mut self, value: i32) {
[INFO] [stdout]    |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |         pub fn delete(&mut self, value: i32) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |         pub fn pop(&mut self) -> Option<i32> {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |         pub fn take_head(&mut self) {
[INFO] [stdout]    |                ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `feibo` is never used
[INFO] [stdout]  --> src/recursion.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn feibo(value: u32) -> u32 {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memoized_feibo` is never used
[INFO] [stdout]   --> src/recursion.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 15 |     pub fn memoized_feibo(value: u128, map:&mut  HashMap<u128, u128>) -> u128 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `val` is never read
[INFO] [stdout]  --> src/hash.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub struct hash_node {
[INFO] [stdout]   |                --------- field in this struct
[INFO] [stdout] 4 |         pub key: usize,
[INFO] [stdout] 5 |         pub val: String,
[INFO] [stdout]   |             ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `hash_node` has derived impls for the traits `Debug` and `Clone`, but these are intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `insert` and `find_new_index` are never used
[INFO] [stdout]   --> src/hash.rs:33:16
[INFO] [stdout]    |
[INFO] [stdout] 19 |     impl hashmap {
[INFO] [stdout]    |     ------------ methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 33 |         pub fn insert(&mut self, key: usize, val: String) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |         fn find_new_index(&self, key: usize, first_index: usize) -> Option<usize> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 8.98s
[INFO] running `Command { std: "docker" "inspect" "75c56d7a629ef7abf5294b8b22dfc45b125e5054ab891107be9588c8d07423fd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "75c56d7a629ef7abf5294b8b22dfc45b125e5054ab891107be9588c8d07423fd", kill_on_drop: false }`
[INFO] [stdout] 75c56d7a629ef7abf5294b8b22dfc45b125e5054ab891107be9588c8d07423fd
