[INFO] cloning repository https://github.com/hunterlester/rusty_algo_structs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/hunterlester/rusty_algo_structs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 5f421d0712e9f3f331c12c9b41152ad4561c7c4e
[INFO] checking hunterlester/rusty_algo_structs against try#e983148bd5f0f0db270bfb72149f5e892e68b67f for pr-150322
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/hunterlester/rusty_algo_structs
[INFO] finished tweaking git repo https://github.com/hunterlester/rusty_algo_structs
[INFO] tweaked toml for git repo https://github.com/hunterlester/rusty_algo_structs written to /workspace/builds/worker-6-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/hunterlester/rusty_algo_structs on toolchain e983148bd5f0f0db270bfb72149f5e892e68b67f
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+e983148bd5f0f0db270bfb72149f5e892e68b67f" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/hunterlester/rusty_algo_structs 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" "+e983148bd5f0f0db270bfb72149f5e892e68b67f" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded proc-macro2 v1.0.9
[INFO] [stderr]   Downloaded hermit-abi v0.1.8
[INFO] [stderr]   Downloaded oorandom v11.1.0
[INFO] [stderr]   Downloaded wasm-bindgen-macro v0.2.59
[INFO] [stderr]   Downloaded criterion-plot v0.4.1
[INFO] [stderr]   Downloaded wasm-bindgen-backend v0.2.59
[INFO] [stderr]   Downloaded criterion v0.3.1
[INFO] [stderr]   Downloaded js-sys v0.3.36
[INFO] [stderr]   Downloaded regex-automata v0.1.8
[INFO] [stderr]   Downloaded wasm-bindgen-macro-support v0.2.59
[INFO] [stderr]   Downloaded syn v1.0.16
[INFO] [stderr]   Downloaded tinytemplate v1.0.3
[INFO] [stderr]   Downloaded wasm-bindgen v0.2.59
[INFO] [stderr]   Downloaded wasm-bindgen-shared v0.2.59
[INFO] [stderr]   Downloaded regex-syntax v0.6.16
[INFO] [stderr]   Downloaded bstr v0.2.11
[INFO] [stderr]   Downloaded libc v0.2.67
[INFO] [stderr]   Downloaded web-sys v0.3.36
[INFO] [stderr]   Downloaded csv v1.1.3
[INFO] [stderr]   Downloaded plotters v0.2.12
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+e983148bd5f0f0db270bfb72149f5e892e68b67f" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] f9c083e523abbc28973b42bd23d293e3a8446b3fdfa5921922f8ee8977ad0fab
[INFO] running `Command { std: "docker" "start" "-a" "f9c083e523abbc28973b42bd23d293e3a8446b3fdfa5921922f8ee8977ad0fab", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "f9c083e523abbc28973b42bd23d293e3a8446b3fdfa5921922f8ee8977ad0fab", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f9c083e523abbc28973b42bd23d293e3a8446b3fdfa5921922f8ee8977ad0fab", kill_on_drop: false }`
[INFO] [stdout] f9c083e523abbc28973b42bd23d293e3a8446b3fdfa5921922f8ee8977ad0fab
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+e983148bd5f0f0db270bfb72149f5e892e68b67f" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 5555e3f34eca4770abf9a6c2a7d1ccd1d4551b6db0b7e758faac61aa34940c5c
[INFO] running `Command { std: "docker" "start" "-a" "5555e3f34eca4770abf9a6c2a7d1ccd1d4551b6db0b7e758faac61aa34940c5c", kill_on_drop: false }`
[INFO] [stderr]    Compiling serde v1.0.104
[INFO] [stderr]    Compiling libc v0.2.67
[INFO] [stderr]    Compiling ryu v1.0.2
[INFO] [stderr]    Compiling memchr v2.3.3
[INFO] [stderr]    Compiling proc-macro2 v1.0.9
[INFO] [stderr]    Compiling num-traits v0.2.11
[INFO] [stderr]    Compiling rayon-core v1.7.0
[INFO] [stderr]    Compiling syn v1.0.16
[INFO] [stderr]    Compiling memoffset v0.5.3
[INFO] [stderr]     Checking unicode-width v0.1.7
[INFO] [stderr]     Checking itertools v0.8.2
[INFO] [stderr]     Checking crossbeam-queue v0.2.1
[INFO] [stderr]     Checking regex-automata v0.1.8
[INFO] [stderr]     Checking regex-syntax v0.6.16
[INFO] [stderr]     Checking oorandom v11.1.0
[INFO] [stderr]     Checking textwrap v0.11.0
[INFO] [stderr]     Checking clap v2.33.0
[INFO] [stderr]     Checking crossbeam-epoch v0.8.2
[INFO] [stderr]     Checking csv-core v0.1.10
[INFO] [stderr]     Checking criterion-plot v0.4.1
[INFO] [stderr]     Checking num_cpus v1.12.0
[INFO] [stderr]     Checking atty v0.2.14
[INFO] [stderr]     Checking regex v1.3.4
[INFO] [stderr]    Compiling quote v1.0.2
[INFO] [stderr]     Checking crossbeam-deque v0.7.3
[INFO] [stderr]     Checking plotters v0.2.12
[INFO] [stderr]     Checking rayon v1.3.0
[INFO] [stderr]     Checking bstr v0.2.11
[INFO] [stderr]     Checking serde_json v1.0.48
[INFO] [stderr]     Checking csv v1.1.3
[INFO] [stderr]     Checking tinytemplate v1.0.3
[INFO] [stderr]    Compiling serde_derive v1.0.104
[INFO] [stderr]     Checking criterion v0.3.1
[INFO] [stderr]     Checking rusty_algo_structs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `linked_lists::*`
[INFO] [stdout]  --> src/data_structures/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub use linked_lists::*;
[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: `bubble_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub use bubble_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `insertion_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:7:9
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub use insertion_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `selection_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:8:9
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub use selection_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `merge_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use merge_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ListNode`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:58:17
[INFO] [stdout]    |
[INFO] [stdout] 58 |     use super::{ListNode, revserse_list, build_linked_list, swap_pairs};
[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: `linked_lists::*`
[INFO] [stdout]  --> src/data_structures/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub use linked_lists::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `bubble_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub use bubble_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `insertion_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:7:9
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub use insertion_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `selection_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:8:9
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub use selection_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `merge_sort::*`
[INFO] [stdout]  --> src/algorithms/sorting/mod.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use merge_sort::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[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: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/data_structures/linked_lists.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct ListNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_linked_list` is never used
[INFO] [stdout]  --> src/data_structures/linked_lists.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn build_linked_list(mut array: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `revserse_list` is never used
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap_pairs` is never used
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> src/algorithms/sorting/bubble_sort.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn bubble_sort(array: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]  --> src/algorithms/sorting/insertion_sort.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn insertion_sort(array: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `selection_sort` is never used
[INFO] [stdout]  --> src/algorithms/sorting/selection_sort.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn selection_sort(array: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> src/algorithms/sorting/merge_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn merge(sub_array_1: Vec<i32>, sub_array_2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]   --> src/algorithms/sorting/merge_sort.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn merge_sort(array: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_row` is never used
[INFO] [stdout]  --> src/algorithms/pascal_triangle.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn get_row(row_index: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `linked_lists::*`
[INFO] [stdout]  --> src/data_structures/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub use linked_lists::*;
[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: `binary_tree::*`
[INFO] [stdout]  --> src/data_structures/mod.rs:7:9
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub use binary_tree::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BinarySearchTree`
[INFO] [stdout]  --> src/data_structures/mod.rs:8:30
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub use binary_search_tree::{BinarySearchTree};
[INFO] [stdout]   |                              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `IterativeBinarySearchTree`
[INFO] [stdout]  --> src/data_structures/mod.rs:9:40
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use binary_search_tree_iterative::{IterativeBinarySearchTree};
[INFO] [stdout]   |                                        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:130:13
[INFO] [stdout]     |
[INFO] [stdout] 130 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:142:13
[INFO] [stdout]     |
[INFO] [stdout] 142 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:154:13
[INFO] [stdout]     |
[INFO] [stdout] 154 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:166:13
[INFO] [stdout]     |
[INFO] [stdout] 166 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:178:13
[INFO] [stdout]     |
[INFO] [stdout] 178 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[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/algorithms/sorting/merge_sort.rs:49:13
[INFO] [stdout]    |
[INFO] [stdout] 49 |         let mut array = vec![9, 8, 7, 6, 5, 4, 3, 2, 1];
[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/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[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: struct `BinaryTreeNode` is never constructed
[INFO] [stdout]  --> src/data_structures/binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct BinaryTreeNode {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl BinaryTreeNode {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 12 |     pub fn new(value: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn insert_left(&mut self, value: Option<i32>) -> () {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn insert_right(&mut self, value: Option<i32>) -> () {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 60 |     pub fn insert(&mut self, value: Option<i32>) -> () {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn inorder_traverse(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |     pub fn preorder_traverse(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 92 |     pub fn postorder_traverse(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `PotentialNode` is never used
[INFO] [stdout]  --> src/data_structures/binary_search_tree.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type PotentialNode = Option<Rc<RefCell<BinarySearchTree>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinarySearchTree` is never constructed
[INFO] [stdout]  --> src/data_structures/binary_search_tree.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct BinarySearchTree {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/data_structures/binary_search_tree.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout]  14 | impl BinarySearchTree {
[INFO] [stdout]     | --------------------- associated items in this implementation
[INFO] [stdout]  15 |     pub fn new(value: i32) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  26 |     pub fn insert(&mut self, value: i32) -> () {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  45 |     pub fn inorder(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  57 |     pub fn preorder(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  69 |     pub fn postorder(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  83 |     pub fn delete(&mut self, id: i32) -> () {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  98 |     pub fn exists(&self, val: i32) -> bool {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 116 |     pub fn build_bst(array: &Vec<Option<i32>>, index: usize) -> PotentialNode {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `PotentialNode` is never used
[INFO] [stdout]  --> src/data_structures/binary_search_tree_iterative.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type PotentialNode = Option<Rc<RefCell<IterativeBinarySearchTree>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `IterativeBinarySearchTree` is never constructed
[INFO] [stdout]  --> src/data_structures/binary_search_tree_iterative.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct IterativeBinarySearchTree {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `preorder`, `inorder`, `postorder`, and `bfs` are never used
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout]  14 | impl IterativeBinarySearchTree {
[INFO] [stdout]     | ------------------------------ associated items in this implementation
[INFO] [stdout]  15 |     pub fn new(value: i32) -> PotentialNode {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  24 |     pub fn insert(root: Rc<RefCell<IterativeBinarySearchTree>>, value: i32) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  46 |     pub fn preorder(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  63 |     pub fn inorder(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  86 |     pub fn postorder(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 104 |     pub fn bfs(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/data_structures/linked_lists.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct ListNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_linked_list` is never used
[INFO] [stdout]  --> src/data_structures/linked_lists.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn build_linked_list(mut array: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `revserse_list` is never used
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap_pairs` is never used
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> benches/bst_benchmark.rs:9:25
[INFO] [stdout]   |
[INFO] [stdout] 9 |         bst_iter.insert(i);
[INFO] [stdout]   |                  ------ ^ expected `Rc<RefCell<IterativeBinarySearchTree>>`, found `i32`
[INFO] [stdout]   |                  |
[INFO] [stdout]   |                  arguments to this method are incorrect
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Rc<RefCell<IterativeBinarySearchTree>>`
[INFO] [stdout]                found type `i32`
[INFO] [stdout] help: the return type of this call is `i32` due to the type of the argument passed
[INFO] [stdout]  --> benches/bst_benchmark.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 |         bst_iter.insert(i);
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^-^
[INFO] [stdout]   |                         |
[INFO] [stdout]   |                         this argument influences the return type of `insert`
[INFO] [stdout] note: method defined here
[INFO] [stdout]  --> /rustc/e983148bd5f0f0db270bfb72149f5e892e68b67f/library/core/src/option.rs:1722:17
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ListNode`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:58:17
[INFO] [stdout]    |
[INFO] [stdout] 58 |     use super::{ListNode, revserse_list, build_linked_list, swap_pairs};
[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: `linked_lists::*`
[INFO] [stdout]  --> src/data_structures/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub use linked_lists::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `binary_tree::*`
[INFO] [stdout]  --> src/data_structures/mod.rs:7:9
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub use binary_tree::*;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BinarySearchTree`
[INFO] [stdout]  --> src/data_structures/mod.rs:8:30
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub use binary_search_tree::{BinarySearchTree};
[INFO] [stdout]   |                              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `IterativeBinarySearchTree`
[INFO] [stdout]  --> src/data_structures/mod.rs:9:40
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub use binary_search_tree_iterative::{IterativeBinarySearchTree};
[INFO] [stdout]   |                                        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `inorder` found for enum `Option<T>` in the current scope
[INFO] [stdout]   --> benches/bst_benchmark.rs:13:92
[INFO] [stdout]    |
[INFO] [stdout] 13 |     group.bench_with_input(BenchmarkId::new("Iterative", 2), &2, |b, _| b.iter(|| bst_iter.inorder()));
[INFO] [stdout]    |                                                                                            ^^^^^^^ method not found in `Option<Rc<RefCell<IterativeBinarySearchTree>>>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0308, E0599.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0308`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `rusty_algo_structs` (bench "bst_benchmark") due to 2 previous errors
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:130:13
[INFO] [stdout]     |
[INFO] [stdout] 130 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:142:13
[INFO] [stdout]     |
[INFO] [stdout] 142 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:154:13
[INFO] [stdout]     |
[INFO] [stdout] 154 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:166:13
[INFO] [stdout]     |
[INFO] [stdout] 166 |         let mut bst = IterativeBinarySearchTree::new(10);
[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/data_structures/binary_search_tree_iterative.rs:178:13
[INFO] [stdout]     |
[INFO] [stdout] 178 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> benches/bst_benchmark.rs:9:25
[INFO] [stdout]   |
[INFO] [stdout] 9 |         bst_iter.insert(i);
[INFO] [stdout]   |                  ------ ^ expected `Rc<RefCell<IterativeBinarySearchTree>>`, found `i32`
[INFO] [stdout]   |                  |
[INFO] [stdout]   |                  arguments to this method are incorrect
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Rc<RefCell<IterativeBinarySearchTree>>`
[INFO] [stdout]                found type `i32`
[INFO] [stdout] help: the return type of this call is `i32` due to the type of the argument passed
[INFO] [stdout]  --> benches/bst_benchmark.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 |         bst_iter.insert(i);
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^-^
[INFO] [stdout]   |                         |
[INFO] [stdout]   |                         this argument influences the return type of `insert`
[INFO] [stdout] note: method defined here
[INFO] [stdout]  --> /rustc/e983148bd5f0f0db270bfb72149f5e892e68b67f/library/core/src/option.rs:1722:17
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                  ----^^^^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `inorder` found for enum `Option<T>` in the current scope
[INFO] [stdout]   --> benches/bst_benchmark.rs:13:92
[INFO] [stdout]    |
[INFO] [stdout] 13 |     group.bench_with_input(BenchmarkId::new("Iterative", 2), &2, |b, _| b.iter(|| bst_iter.inorder()));
[INFO] [stdout]    |                                                                                            ^^^^^^^ method not found in `Option<Rc<RefCell<IterativeBinarySearchTree>>>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0308, E0599.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0308`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `rusty_algo_structs` (bench "main_benchmark") due to 2 previous errors
[INFO] running `Command { std: "docker" "inspect" "5555e3f34eca4770abf9a6c2a7d1ccd1d4551b6db0b7e758faac61aa34940c5c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "5555e3f34eca4770abf9a6c2a7d1ccd1d4551b6db0b7e758faac61aa34940c5c", kill_on_drop: false }`
[INFO] [stdout] 5555e3f34eca4770abf9a6c2a7d1ccd1d4551b6db0b7e758faac61aa34940c5c
