[INFO] cloning repository https://github.com/aditya2337/learn-algorithms
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/aditya2337/learn-algorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faditya2337%2Flearn-algorithms", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faditya2337%2Flearn-algorithms'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] aef65b374234414a932c7b41b2d6fcceae562728
[INFO] testing aditya2337/learn-algorithms against 1.75.0 for beta-1.76-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faditya2337%2Flearn-algorithms" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/aditya2337/learn-algorithms on toolchain 1.75.0
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.75.0" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/aditya2337/learn-algorithms
[INFO] finished tweaking git repo https://github.com/aditya2337/learn-algorithms
[INFO] tweaked toml for git repo https://github.com/aditya2337/learn-algorithms written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/aditya2337/learn-algorithms already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.75.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 91e6bd06abded78152faf58ab23bff8385d30900ab0d3984022ea747a79538f0
[INFO] running `Command { std: "docker" "start" "-a" "91e6bd06abded78152faf58ab23bff8385d30900ab0d3984022ea747a79538f0", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "91e6bd06abded78152faf58ab23bff8385d30900ab0d3984022ea747a79538f0", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "91e6bd06abded78152faf58ab23bff8385d30900ab0d3984022ea747a79538f0", kill_on_drop: false }`
[INFO] [stdout] 91e6bd06abded78152faf58ab23bff8385d30900ab0d3984022ea747a79538f0
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 51e9043c04e739770ce11324aebb1e14be5798016439c7f5a5833e6e9e123fa3
[INFO] running `Command { std: "docker" "start" "-a" "51e9043c04e739770ce11324aebb1e14be5798016439c7f5a5833e6e9e123fa3", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.59
[INFO] [stderr]    Compiling quote v1.0.28
[INFO] [stderr]    Compiling unicode-ident v1.0.9
[INFO] [stderr]    Compiling semver v1.0.17
[INFO] [stderr]    Compiling futures-core v0.3.28
[INFO] [stderr]    Compiling futures-task v0.3.28
[INFO] [stderr]    Compiling futures-channel v0.3.28
[INFO] [stderr]    Compiling futures-sink v0.3.28
[INFO] [stderr]    Compiling futures-util v0.3.28
[INFO] [stderr]    Compiling syn v1.0.109
[INFO] [stderr]    Compiling futures-io v0.3.28
[INFO] [stderr]    Compiling cfg-if v1.0.0
[INFO] [stderr]    Compiling futures-timer v3.0.2
[INFO] [stderr]    Compiling rustc_version v0.4.0
[INFO] [stderr]    Compiling rstest_macros v0.17.0
[INFO] [stderr]    Compiling syn v2.0.18
[INFO] [stderr]    Compiling futures-macro v0.3.28
[INFO] [stderr]    Compiling futures-executor v0.3.28
[INFO] [stderr]    Compiling futures v0.3.28
[INFO] [stderr]    Compiling rstest v0.17.0
[INFO] [stderr]    Compiling scripts v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `Node`
[INFO] [stdout]  --> src/binary_tree/breadth_first_traversal.rs:3:32
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::types::{BinaryTree, Node};
[INFO] [stdout]   |                                ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem`, `ops::Index`
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:1:23
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{fmt::Debug, mem, ptr, ops::Index};
[INFO] [stdout]   |                       ^^^       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if (i >= maze.len()) {
[INFO] [stdout]    |            ^               ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 21 -         if (i >= maze.len()) {
[INFO] [stdout] 21 +         if i >= maze.len() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:73:12
[INFO] [stdout]    |
[INFO] [stdout] 73 |         if (walk(
[INFO] [stdout]    |            ^
[INFO] [stdout] ...
[INFO] [stdout] 80 |         )) {
[INFO] [stdout]    |          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 73 ~         if walk(
[INFO] [stdout] 74 |             maze,
[INFO] [stdout]  ...
[INFO] [stdout] 79 |             path,
[INFO] [stdout] 80 ~         ) {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/queue.rs:54:13
[INFO] [stdout]    |
[INFO] [stdout] 54 |         let mut current_node = self.head.take();
[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: function `pre_order_traversal` is never used
[INFO] [stdout]  --> src/binary_tree/binary_tree_pre_order.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn pre_order_traversal<T: std::clone::Clone>(head: &Link<T>) -> Vec<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk` is never used
[INFO] [stdout]  --> src/binary_tree/binary_tree_pre_order.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn walk<T: Clone>(node: &Link<T>, path: &mut Vec<T>) {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `breadth_first_traversal` is never used
[INFO] [stdout]  --> src/binary_tree/breadth_first_traversal.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn breadth_first_traversal<T: Clone>(tree: &BinaryTree<T>) -> Vec<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `push_to_queue` is never used
[INFO] [stdout]   --> src/binary_tree/breadth_first_traversal.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn push_to_queue<T>(value: Option<T>, queue: &mut Queue<T>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_mock_tree` is never used
[INFO] [stdout]  --> src/binary_tree/mock_tree.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn get_mock_tree() -> BinaryTree<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/types.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | / impl<T> BinaryTree<T>
[INFO] [stdout] 10 | | where
[INFO] [stdout] 11 | |     T: Debug,
[INFO] [stdout]    | |_____________- associated function in this implementation
[INFO] [stdout] 12 |   {
[INFO] [stdout] 13 |       pub fn new() -> Self {
[INFO] [stdout]    |              ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/types.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | / impl<T> Node<T>
[INFO] [stdout] 26 | | where
[INFO] [stdout] 27 | |     T: Debug,
[INFO] [stdout]    | |_____________- associated function in this implementation
[INFO] [stdout] 28 |   {
[INFO] [stdout] 29 |       pub fn new(value: T) -> Self {
[INFO] [stdout]    |              ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `tree` is never read
[INFO] [stdout]  --> src/binary_tree/BST.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct BinarySearchTree {
[INFO] [stdout]   |        ---------------- field in this struct
[INFO] [stdout] 5 |     tree: BinaryTree<i32>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `BinarySearchTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, and `delete` are never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl BinarySearchTree {
[INFO] [stdout]    | --------------------- associated items in this implementation
[INFO] [stdout] 9  |     pub fn new(tree: BinaryTree<i32>) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     pub fn insert(&mut self, item: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn delete(mut self, item: i32) -> Self {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_value_node` is never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn min_value_node(node: &Node<i32>) -> &Node<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_node` is never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:39:4
[INFO] [stdout]    |
[INFO] [stdout] 39 | fn delete_node(node: Link<i32>, item: i32) -> Link<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk_and_insert` is never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:73:4
[INFO] [stdout]    |
[INFO] [stdout] 73 | fn walk_and_insert(node: &mut Node<i32>, item: i32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `val`, `left_child`, `right_child`, and `height` are never read
[INFO] [stdout]   --> src/binary_tree/AVL_tree.rs:7:5
[INFO] [stdout]    |
[INFO] [stdout] 6  | struct AVLNode {
[INFO] [stdout]    |        ------- fields in this struct
[INFO] [stdout] 7  |     val: i32,
[INFO] [stdout]    |     ^^^
[INFO] [stdout] 8  |     left_child: Link,
[INFO] [stdout]    |     ^^^^^^^^^^
[INFO] [stdout] 9  |     right_child: Link,
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout] 10 |     height: usize,
[INFO] [stdout]    |     ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AVLNode` 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/binary_tree/AVL_tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl AVLNode {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn height(node: &Link) -> usize {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn get_left_height(&self) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn get_right_height(&self) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn balance_factor(&self) -> i8 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn update_height(&mut self) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     fn rotate_left(&mut self) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     fn rotate_right(&mut self) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn balance(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 92 |     pub fn insert(&mut self, val: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `root` is never read
[INFO] [stdout]    --> src/binary_tree/AVL_tree.rs:102:5
[INFO] [stdout]     |
[INFO] [stdout] 101 | struct AVLTree {
[INFO] [stdout]     |        ------- field in this struct
[INFO] [stdout] 102 |     root: Link,
[INFO] [stdout]     |     ^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `AVLTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `insert` are never used
[INFO] [stdout]    --> src/binary_tree/AVL_tree.rs:106:12
[INFO] [stdout]     |
[INFO] [stdout] 105 | impl AVLTree {
[INFO] [stdout]     | ------------ associated items in this implementation
[INFO] [stdout] 106 |     pub fn new() -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 110 |     pub fn insert(&mut self, val: i32) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk_and_insert` is never used
[INFO] [stdout]    --> src/binary_tree/AVL_tree.rs:121:4
[INFO] [stdout]     |
[INFO] [stdout] 121 | fn walk_and_insert(node: &mut AVLNode, new_node: AVLNode) {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `length` and `harr` are never read
[INFO] [stdout]  --> src/heap.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct MinHeap {
[INFO] [stdout]   |            ------- fields in this struct
[INFO] [stdout] 3 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout] 4 |     harr: Vec<i32>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `MinHeap` 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/heap.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl MinHeap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 8  |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn get_left_child_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn get_right_child_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn get_parent_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn swap_up(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn swap_down(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn insert(&mut self, item: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     pub fn delete_min(&mut self) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79 |     pub fn delete_element(&mut self, item: i32) {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head`, `tail`, and `length` are never read
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct DoublyLinkedList<T> {
[INFO] [stdout]   |        ---------------- fields in this struct
[INFO] [stdout] 7 |     head: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 8 |     tail: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 9 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `DoublyLinkedList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `append_front`, `append`, `pop`, and `pop_front` are never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> DoublyLinkedList<T> {
[INFO] [stdout]    | --------------------------- associated items in this implementation
[INFO] [stdout] 12 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn append_front(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn append(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `val`, `next`, and `prev` are never read
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:93:5
[INFO] [stdout]    |
[INFO] [stdout] 92 | struct Node<T> {
[INFO] [stdout]    |        ---- fields in this struct
[INFO] [stdout] 93 |     val: T,
[INFO] [stdout]    |     ^^^
[INFO] [stdout] 94 |     next: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 95 |     prev: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:98:12
[INFO] [stdout]    |
[INFO] [stdout] 97 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 98 |     pub fn new(val: T) -> Rc<RefCell<Self>> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `value` and `next` are never read
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ---- fields in this struct
[INFO] [stdout] 7 |     value: T,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout] 8 |     next: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head` and `tail` are never read
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct LinkedList<T> {
[INFO] [stdout]    |            ---------- fields in this struct
[INFO] [stdout] 19 |     head: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 20 |     tail: *mut Node<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `LinkedList` 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/linked_lists/linked_lists.rs:27:12
[INFO] [stdout]     |
[INFO] [stdout] 23  | / impl<T> LinkedList<T>
[INFO] [stdout] 24  | | where
[INFO] [stdout] 25  | |     T: Debug,
[INFO] [stdout]     | |_____________- associated items in this implementation
[INFO] [stdout] 26  |   {
[INFO] [stdout] 27  |       pub fn new() -> Self {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |       pub fn get_length(&self) -> i32 {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51  |       fn check_idx_validity(&self, &idx: &i32) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       pub fn insert_at(&mut self, value: T, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79  |       pub fn delete_at(&mut self, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |       pub fn append(&mut self, value: T) {
[INFO] [stdout]     |              ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 120 |       fn prepend(&self) {}
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_ll` is never used
[INFO] [stdout]    --> src/linked_lists/linked_lists.rs:123:8
[INFO] [stdout]     |
[INFO] [stdout] 123 | pub fn test_ll() {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_lists/merge_linked_list.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]   --> src/linked_lists/merge_linked_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn merge_two_lists(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `create_linked_list` is never used
[INFO] [stdout]   --> src/linked_lists/merge_linked_list.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn create_linked_list(nums: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_lists/reverse_linked_list.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]   --> src/linked_lists/reverse_linked_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `create_linked_list` is never used
[INFO] [stdout]   --> src/linked_lists/reverse_linked_list.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn create_linked_list(nums: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `matrix_multiply` is never used
[INFO] [stdout]  --> src/matrix_multiply.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn matrix_multiply(a: &Vec<Vec<i32>>, b: &Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/path_finding.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Point {
[INFO] [stdout]   | ---------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn new(x: isize, y: isize) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Maze` is never used
[INFO] [stdout]   --> src/path_finding.rs:13:6
[INFO] [stdout]    |
[INFO] [stdout] 13 | type Maze = Vec<String>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_path` is never used
[INFO] [stdout]   --> src/path_finding.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn find_path(maze: Maze, wall: char, start: Point, end: Point) -> Vec<Point> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk` is never used
[INFO] [stdout]   --> src/path_finding.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn walk(
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `next` is never read
[INFO] [stdout]  --> src/queue.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ---- field in this struct
[INFO] [stdout] 7 |     pub value: T,
[INFO] [stdout] 8 |     next: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/queue.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head` and `tail` are never read
[INFO] [stdout]   --> src/queue.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct Queue<T> {
[INFO] [stdout]    |            ----- fields in this struct
[INFO] [stdout] 19 |     pub length: i32,
[INFO] [stdout] 20 |     head: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 21 |     tail: *mut Node<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Queue` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, and `peek` are never used
[INFO] [stdout]   --> src/queue.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 25 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn enqueue(&mut self, item: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     pub fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     fn peek(&self) -> &Link<T> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]  --> src/search_insert_pos.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_idx` is never used
[INFO] [stdout]  --> src/search_insert_pos.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn search_idx(start_idx: usize, end_idx: usize, target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `PRICES` is never used
[INFO] [stdout]  --> src/dynamic_programming/rod_cutting.rs:3:7
[INFO] [stdout]   |
[INFO] [stdout] 3 | const PRICES: [u8; 40] = [
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rod_cut_recursively` is never used
[INFO] [stdout]  --> src/dynamic_programming/rod_cutting.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn rod_cut_recursively(idx: usize) -> u8 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rod_cut_top_down` is never used
[INFO] [stdout]   --> src/dynamic_programming/rod_cutting.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn rod_cut_top_down(idx: usize) -> u8 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memoized_cut_rod_aux` is never used
[INFO] [stdout]   --> src/dynamic_programming/rod_cutting.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn memoized_cut_rod_aux(idx: usize, r: &mut Vec<u8>) -> u8 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rod_cut_bottom_up` is never used
[INFO] [stdout]   --> src/dynamic_programming/rod_cutting.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 45 | pub fn rod_cut_bottom_up(idx: usize) -> u8 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/dynamic_programming/maximum_subarray.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_iterative` is never used
[INFO] [stdout]  --> src/dynamic_programming/maximum_subarray.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_sub_array_iterative(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_recursive` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn max_sub_array_recursive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_linear` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn max_sub_array_linear(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_kadane` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:59:8
[INFO] [stdout]    |
[INFO] [stdout] 59 | pub fn max_sub_array_kadane(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]  --> src/dynamic_programming/longest_increasing_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> src/dynamic_programming/climbing_stairs.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/dynamic_programming/coin_change.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_min_coins` is never used
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn cal_min_coins(coins: &Vec<i32>, amount: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_min_coins_bottom_up` is never used
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:42:4
[INFO] [stdout]    |
[INFO] [stdout] 42 | fn cal_min_coins_bottom_up(coins: &Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `word_break` is never used
[INFO] [stdout]  --> src/dynamic_programming/word_break.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]  --> src/dynamic_programming/house_robber.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `heap` and `size` are never read
[INFO] [stdout]  --> src/sorting/heap_sort.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Heap {
[INFO] [stdout]   |        ---- fields in this struct
[INFO] [stdout] 3 |     heap: Vec<i32>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 4 |     size: usize,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Heap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `heapify`, `sort`, `delete`, `left_idx`, and `right_idx` are never used
[INFO] [stdout]   --> src/sorting/heap_sort.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl Heap {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 8  |     pub fn new(arr: Vec<i32>) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn heapify(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn sort(&mut self) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn delete(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn left_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn right_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `srt` is never used
[INFO] [stdout]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn srt<'a>(unsorted_list: &'a mut Vec<i32>) -> &'a Vec<i32> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/bubble_sort.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn swap(previous_idx: usize, next_idx: usize, list: &mut Vec<i32>) -> &Vec<i32> {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]  --> src/sorting/counting_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn sort(a: Vec<usize>) -> Vec<usize> {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]  --> src/sorting/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn sort(arr: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]  --> src/sorting/merge_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn sort(arr: &mut Vec<i32>, p: usize, r: usize) {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/sorting/merge_sort.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn merge(arr: &mut Vec<i32>, p: usize, q: usize, r: usize) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `new_sort` is never used
[INFO] [stdout]  --> src/sorting/quick_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn new_sort(list: &mut Vec<i32>, lo: usize, hi: usize) {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]   --> src/sorting/quick_sort.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn partition(list: &mut Vec<i32>, lo: usize, hi: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WeightedAdjacencyMatrix` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type WeightedAdjacencyMatrix = Vec<Vec<i32>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bfs` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn bfs(graph: WeightedAdjacencyMatrix, source: i32, needle: i32) -> Option<Vec<i32>> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `BST` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub mod BST;
[INFO] [stdout]   |         ^^^ help: convert the identifier to snake case: `bst`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `AVL_tree` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub mod AVL_tree;
[INFO] [stdout]   |         ^^^^^^^^ help: convert the identifier to snake case: `avl_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 81 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 15.26s
[INFO] running `Command { std: "docker" "inspect" "51e9043c04e739770ce11324aebb1e14be5798016439c7f5a5833e6e9e123fa3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "51e9043c04e739770ce11324aebb1e14be5798016439c7f5a5833e6e9e123fa3", kill_on_drop: false }`
[INFO] [stdout] 51e9043c04e739770ce11324aebb1e14be5798016439c7f5a5833e6e9e123fa3
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 8c681ad5514b9434969a3deb79f6fae31ef1c3f5aee42f28a3b84a357aa8d4f8
[INFO] running `Command { std: "docker" "start" "-a" "8c681ad5514b9434969a3deb79f6fae31ef1c3f5aee42f28a3b84a357aa8d4f8", kill_on_drop: false }`
[INFO] [stderr]    Compiling scripts v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `Node`
[INFO] [stdout]  --> src/binary_tree/breadth_first_traversal.rs:3:32
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::types::{BinaryTree, Node};
[INFO] [stdout]   |                                ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem`, `ops::Index`
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:1:23
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{fmt::Debug, mem, ptr, ops::Index};
[INFO] [stdout]   |                       ^^^       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if (i >= maze.len()) {
[INFO] [stdout]    |            ^               ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 21 -         if (i >= maze.len()) {
[INFO] [stdout] 21 +         if i >= maze.len() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:73:12
[INFO] [stdout]    |
[INFO] [stdout] 73 |         if (walk(
[INFO] [stdout]    |            ^
[INFO] [stdout] ...
[INFO] [stdout] 80 |         )) {
[INFO] [stdout]    |          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 73 ~         if walk(
[INFO] [stdout] 74 |             maze,
[INFO] [stdout]  ...
[INFO] [stdout] 79 |             path,
[INFO] [stdout] 80 ~         ) {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/queue.rs:54:13
[INFO] [stdout]    |
[INFO] [stdout] 54 |         let mut current_node = self.head.take();
[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: unused variable: `nums`
[INFO] [stdout]   --> src/search_insert_pos.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let nums = vec![1, 3, 5, 6];
[INFO] [stdout]    |             ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `length` is never read
[INFO] [stdout]  --> src/heap.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct MinHeap {
[INFO] [stdout]   |            ------- field in this struct
[INFO] [stdout] 3 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `MinHeap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `get_right_child_idx` is never used
[INFO] [stdout]   --> src/heap.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl MinHeap {
[INFO] [stdout]    | ------------ method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn get_right_child_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head`, `tail`, and `length` are never read
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct DoublyLinkedList<T> {
[INFO] [stdout]   |        ---------------- fields in this struct
[INFO] [stdout] 7 |     head: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 8 |     tail: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 9 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `DoublyLinkedList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `append_front`, `append`, `pop`, and `pop_front` are never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> DoublyLinkedList<T> {
[INFO] [stdout]    | --------------------------- associated items in this implementation
[INFO] [stdout] 12 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn append_front(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn append(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `val`, `next`, and `prev` are never read
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:93:5
[INFO] [stdout]    |
[INFO] [stdout] 92 | struct Node<T> {
[INFO] [stdout]    |        ---- fields in this struct
[INFO] [stdout] 93 |     val: T,
[INFO] [stdout]    |     ^^^
[INFO] [stdout] 94 |     next: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 95 |     prev: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:98:12
[INFO] [stdout]    |
[INFO] [stdout] 97 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 98 |     pub fn new(val: T) -> Rc<RefCell<Self>> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `value` and `next` are never read
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ---- fields in this struct
[INFO] [stdout] 7 |     value: T,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout] 8 |     next: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head` and `tail` are never read
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct LinkedList<T> {
[INFO] [stdout]    |            ---------- fields in this struct
[INFO] [stdout] 19 |     head: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 20 |     tail: *mut Node<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `LinkedList` 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/linked_lists/linked_lists.rs:27:12
[INFO] [stdout]     |
[INFO] [stdout] 23  | / impl<T> LinkedList<T>
[INFO] [stdout] 24  | | where
[INFO] [stdout] 25  | |     T: Debug,
[INFO] [stdout]     | |_____________- associated items in this implementation
[INFO] [stdout] 26  |   {
[INFO] [stdout] 27  |       pub fn new() -> Self {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |       pub fn get_length(&self) -> i32 {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51  |       fn check_idx_validity(&self, &idx: &i32) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       pub fn insert_at(&mut self, value: T, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79  |       pub fn delete_at(&mut self, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |       pub fn append(&mut self, value: T) {
[INFO] [stdout]     |              ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 120 |       fn prepend(&self) {}
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_ll` is never used
[INFO] [stdout]    --> src/linked_lists/linked_lists.rs:123:8
[INFO] [stdout]     |
[INFO] [stdout] 123 | pub fn test_ll() {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_lists/reverse_linked_list.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_iterative` is never used
[INFO] [stdout]  --> src/dynamic_programming/maximum_subarray.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_sub_array_iterative(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_recursive` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn max_sub_array_recursive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_linear` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn max_sub_array_linear(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_min_coins` is never used
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn cal_min_coins(coins: &Vec<i32>, amount: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `srt` is never used
[INFO] [stdout]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn srt<'a>(unsorted_list: &'a mut Vec<i32>) -> &'a Vec<i32> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/bubble_sort.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn swap(previous_idx: usize, next_idx: usize, list: &mut Vec<i32>) -> &Vec<i32> {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WeightedAdjacencyMatrix` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type WeightedAdjacencyMatrix = Vec<Vec<i32>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bfs` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn bfs(graph: WeightedAdjacencyMatrix, source: i32, needle: i32) -> Option<Vec<i32>> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `BST` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub mod BST;
[INFO] [stdout]   |         ^^^ help: convert the identifier to snake case: `bst`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `AVL_tree` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub mod AVL_tree;
[INFO] [stdout]   |         ^^^^^^^^ help: convert the identifier to snake case: `avl_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 28 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 1.15s
[INFO] running `Command { std: "docker" "inspect" "8c681ad5514b9434969a3deb79f6fae31ef1c3f5aee42f28a3b84a357aa8d4f8", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "8c681ad5514b9434969a3deb79f6fae31ef1c3f5aee42f28a3b84a357aa8d4f8", kill_on_drop: false }`
[INFO] [stdout] 8c681ad5514b9434969a3deb79f6fae31ef1c3f5aee42f28a3b84a357aa8d4f8
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 0e0fcf8befd123eeef9e8ad86e3c997aec94ba99061e7d20acabdfc66ae65e5f
[INFO] running `Command { std: "docker" "start" "-a" "0e0fcf8befd123eeef9e8ad86e3c997aec94ba99061e7d20acabdfc66ae65e5f", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `Node`
[INFO] [stderr]  --> src/binary_tree/breadth_first_traversal.rs:3:32
[INFO] [stderr]   |
[INFO] [stderr] 3 | use super::types::{BinaryTree, Node};
[INFO] [stderr]   |                                ^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `mem`, `ops::Index`
[INFO] [stderr]  --> src/linked_lists/linked_lists.rs:1:23
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{fmt::Debug, mem, ptr, ops::Index};
[INFO] [stderr]   |                       ^^^       ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/path_finding.rs:21:12
[INFO] [stderr]    |
[INFO] [stderr] 21 |         if (i >= maze.len()) {
[INFO] [stderr]    |            ^               ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stderr] help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr] 21 -         if (i >= maze.len()) {
[INFO] [stderr] 21 +         if i >= maze.len() {
[INFO] [stderr]    |
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/path_finding.rs:73:12
[INFO] [stderr]    |
[INFO] [stderr] 73 |         if (walk(
[INFO] [stderr]    |            ^
[INFO] [stderr] ...
[INFO] [stderr] 80 |         )) {
[INFO] [stderr]    |          ^
[INFO] [stderr]    |
[INFO] [stderr] help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr] 73 ~         if walk(
[INFO] [stderr] 74 |             maze,
[INFO] [stderr]  ...
[INFO] [stderr] 79 |             path,
[INFO] [stderr] 80 ~         ) {
[INFO] [stderr]    |
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/queue.rs:54:13
[INFO] [stderr]    |
[INFO] [stderr] 54 |         let mut current_node = self.head.take();
[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: unused variable: `nums`
[INFO] [stderr]   --> src/search_insert_pos.rs:47:13
[INFO] [stderr]    |
[INFO] [stderr] 47 |         let nums = vec![1, 3, 5, 6];
[INFO] [stderr]    |             ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: field `length` is never read
[INFO] [stderr]  --> src/heap.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct MinHeap {
[INFO] [stderr]   |            ------- field in this struct
[INFO] [stderr] 3 |     length: usize,
[INFO] [stderr]   |     ^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `MinHeap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method `get_right_child_idx` is never used
[INFO] [stderr]   --> src/heap.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 7  | impl MinHeap {
[INFO] [stderr]    | ------------ method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 19 |     fn get_right_child_idx(&self, i: usize) -> usize {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `head`, `tail`, and `length` are never read
[INFO] [stderr]  --> src/linked_lists/doubly_linked_list.rs:7:5
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct DoublyLinkedList<T> {
[INFO] [stderr]   |        ---------------- fields in this struct
[INFO] [stderr] 7 |     head: Link<T>,
[INFO] [stderr]   |     ^^^^
[INFO] [stderr] 8 |     tail: Link<T>,
[INFO] [stderr]   |     ^^^^
[INFO] [stderr] 9 |     length: usize,
[INFO] [stderr]   |     ^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `DoublyLinkedList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `append_front`, `append`, `pop`, and `pop_front` are never used
[INFO] [stderr]   --> src/linked_lists/doubly_linked_list.rs:12:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl<T> DoublyLinkedList<T> {
[INFO] [stderr]    | --------------------------- associated items in this implementation
[INFO] [stderr] 12 |     pub fn new() -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |     pub fn append_front(&mut self, val: T) {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 36 |     pub fn append(&mut self, val: T) {
[INFO] [stderr]    |            ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 53 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 70 |     pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `val`, `next`, and `prev` are never read
[INFO] [stderr]   --> src/linked_lists/doubly_linked_list.rs:93:5
[INFO] [stderr]    |
[INFO] [stderr] 92 | struct Node<T> {
[INFO] [stderr]    |        ---- fields in this struct
[INFO] [stderr] 93 |     val: T,
[INFO] [stderr]    |     ^^^
[INFO] [stderr] 94 |     next: Link<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr] 95 |     prev: Link<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/linked_lists/doubly_linked_list.rs:98:12
[INFO] [stderr]    |
[INFO] [stderr] 97 | impl<T> Node<T> {
[INFO] [stderr]    | --------------- associated function in this implementation
[INFO] [stderr] 98 |     pub fn new(val: T) -> Rc<RefCell<Self>> {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `value` and `next` are never read
[INFO] [stderr]  --> src/linked_lists/linked_lists.rs:7:5
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct Node<T> {
[INFO] [stderr]   |            ---- fields in this struct
[INFO] [stderr] 7 |     value: T,
[INFO] [stderr]   |     ^^^^^
[INFO] [stderr] 8 |     next: Link<T>,
[INFO] [stderr]   |     ^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/linked_lists/linked_lists.rs:12:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl<T> Node<T> {
[INFO] [stderr]    | --------------- associated function in this implementation
[INFO] [stderr] 12 |     pub fn new(value: T) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `head` and `tail` are never read
[INFO] [stderr]   --> src/linked_lists/linked_lists.rs:19:5
[INFO] [stderr]    |
[INFO] [stderr] 18 | pub struct LinkedList<T> {
[INFO] [stderr]    |            ---------- fields in this struct
[INFO] [stderr] 19 |     head: Link<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr] 20 |     tail: *mut Node<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `LinkedList` 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/linked_lists/linked_lists.rs:27:12
[INFO] [stderr]     |
[INFO] [stderr] 23  | / impl<T> LinkedList<T>
[INFO] [stderr] 24  | | where
[INFO] [stderr] 25  | |     T: Debug,
[INFO] [stderr]     | |_____________- associated items in this implementation
[INFO] [stderr] 26  |   {
[INFO] [stderr] 27  |       pub fn new() -> Self {
[INFO] [stderr]     |              ^^^
[INFO] [stderr] ...
[INFO] [stderr] 34  |       pub fn get_length(&self) -> i32 {
[INFO] [stderr]     |              ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 51  |       fn check_idx_validity(&self, &idx: &i32) {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 57  |       pub fn insert_at(&mut self, value: T, idx: i32) -> bool {
[INFO] [stderr]     |              ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 79  |       pub fn delete_at(&mut self, idx: i32) -> bool {
[INFO] [stderr]     |              ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 106 |       pub fn append(&mut self, value: T) {
[INFO] [stderr]     |              ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 120 |       fn prepend(&self) {}
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `test_ll` is never used
[INFO] [stderr]    --> src/linked_lists/linked_lists.rs:123:8
[INFO] [stderr]     |
[INFO] [stderr] 123 | pub fn test_ll() {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/linked_lists/reverse_linked_list.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     #[inline]
[INFO] [stderr] 9 |     fn new(val: i32) -> Self {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_sub_array_iterative` is never used
[INFO] [stderr]  --> src/dynamic_programming/maximum_subarray.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn max_sub_array_iterative(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_sub_array_recursive` is never used
[INFO] [stderr]   --> src/dynamic_programming/maximum_subarray.rs:25:8
[INFO] [stderr]    |
[INFO] [stderr] 25 | pub fn max_sub_array_recursive(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_sub_array_linear` is never used
[INFO] [stderr]   --> src/dynamic_programming/maximum_subarray.rs:43:8
[INFO] [stderr]    |
[INFO] [stderr] 43 | pub fn max_sub_array_linear(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `cal_min_coins` is never used
[INFO] [stderr]   --> src/dynamic_programming/coin_change.rs:12:4
[INFO] [stderr]    |
[INFO] [stderr] 12 | fn cal_min_coins(coins: &Vec<i32>, amount: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stderr]    |    ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `srt` is never used
[INFO] [stderr]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn srt<'a>(unsorted_list: &'a mut Vec<i32>) -> &'a Vec<i32> {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `swap` is never used
[INFO] [stderr]   --> src/sorting/bubble_sort.rs:29:4
[INFO] [stderr]    |
[INFO] [stderr] 29 | fn swap(previous_idx: usize, next_idx: usize, list: &mut Vec<i32>) -> &Vec<i32> {
[INFO] [stderr]    |    ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `WeightedAdjacencyMatrix` is never used
[INFO] [stderr]  --> src/graphs/bfs.rs:3:6
[INFO] [stderr]   |
[INFO] [stderr] 3 | type WeightedAdjacencyMatrix = Vec<Vec<i32>>;
[INFO] [stderr]   |      ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `bfs` is never used
[INFO] [stderr]  --> src/graphs/bfs.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn bfs(graph: WeightedAdjacencyMatrix, source: i32, needle: i32) -> Option<Vec<i32>> {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: module `BST` should have a snake case name
[INFO] [stderr]  --> src/binary_tree/mod.rs:5:9
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub mod BST;
[INFO] [stderr]   |         ^^^ help: convert the identifier to snake case: `bst`
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: module `AVL_tree` should have a snake case name
[INFO] [stderr]  --> src/binary_tree/mod.rs:6:9
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub mod AVL_tree;
[INFO] [stderr]   |         ^^^^^^^^ help: convert the identifier to snake case: `avl_tree`
[INFO] [stderr] 
[INFO] [stderr] warning: `scripts` (bin "scripts" test) generated 28 warnings (run `cargo fix --bin "scripts" --tests` to apply 6 suggestions)
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.04s
[INFO] [stderr]      Running unittests src/main.rs (/opt/rustwide/target/debug/deps/scripts-629902ccacac60e3)
[INFO] [stdout] 
[INFO] [stdout] running 44 tests
[INFO] [stdout] test binary_tree::binary_tree_pre_order::tests::test_pre_order ... ok
[INFO] [stdout] test binary_tree::breadth_first_traversal::tests::breadth_first ... ok
[INFO] [stdout] test binary_tree::BST::tests::bst ... ok
[INFO] [stdout] test binary_tree::AVL_tree::tests::test_avl ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_5 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_1 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_2 ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_3 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_5 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_1 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_3 ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_1 ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_2 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_2 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_3 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_2 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_3 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_4 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_2 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_3 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_4 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_4 ... ok
[INFO] [stdout] test heap::tests::test_heap ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_1 ... ok
[INFO] [stdout] test linked_lists::merge_linked_list::tests::test_merge ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_4 ... ok
[INFO] [stdout] test linked_lists::reverse_linked_list::tests::test_merge ... ok
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_6 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_1 ... ok
[INFO] [stdout] test path_finding::tests::test_path_finder ... ok
[INFO] [stdout] test queue::tests::test_queue ... ok
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply_empty ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_4 ... ok
[INFO] [stdout] test sorting::counting_sort::tests::test_count_sort ... ok
[INFO] [stdout] test sorting::insertion_sort::tests::test_insertion_sort ... ok
[INFO] [stdout] test sorting::merge_sort::tests::test_merge ... ok
[INFO] [stdout] test search_insert_pos::tests::test_search ... ok
[INFO] [stdout] test sorting::merge_sort::tests::test_merge_sort ... ok
[INFO] [stdout] test dynamic_programming::word_break::tests::word_break_test::case_1 ... FAILED
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply_wrong_size - should panic ... ok
[INFO] [stdout] test sorting::heap_sort::tests::test_heap ... ok
[INFO] [stdout] test sorting::quick_sort::tests::test_quick_sort ... ok
[INFO] [stdout] test dynamic_programming::rod_cutting::tests::test_rod_cut ... ok
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout] 
[INFO] [stdout] ---- dynamic_programming::word_break::tests::word_break_test::case_1 stdout ----
[INFO] [stdout] thread 'dynamic_programming::word_break::tests::word_break_test::case_1' panicked at src/dynamic_programming/word_break.rs:36:9:
[INFO] [stdout] assertion `left == right` failed
[INFO] [stdout]   left: false
[INFO] [stdout]  right: true
[INFO] [stdout] stack backtrace:
[INFO] [stdout]    0:     0x55c773c84eac - std::backtrace_rs::backtrace::libunwind::trace::ha637c64ce894333a
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/../../backtrace/src/backtrace/libunwind.rs:104:5
[INFO] [stdout]    1:     0x55c773c84eac - std::backtrace_rs::backtrace::trace_unsynchronized::h47f62dea28e0c88d
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5
[INFO] [stdout]    2:     0x55c773c84eac - std::sys_common::backtrace::_print_fmt::h9eef0abe20ede486
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:67:5
[INFO] [stdout]    3:     0x55c773c84eac - <std::sys_common::backtrace::_print::DisplayBacktrace as core::fmt::Display>::fmt::hed7f999df88cc644
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:44:22
[INFO] [stdout]    4:     0x55c773cae9f0 - core::fmt::rt::Argument::fmt::h1539a9308b8d058d
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/fmt/rt.rs:142:9
[INFO] [stdout]    5:     0x55c773cae9f0 - core::fmt::write::h3a39390d8560d9c9
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/fmt/mod.rs:1120:17
[INFO] [stdout]    6:     0x55c773c8285f - std::io::Write::write_fmt::h040b369f3a0f9cbc
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/io/mod.rs:1762:15
[INFO] [stdout]    7:     0x55c773c84c94 - std::sys_common::backtrace::_print::h894006fb5c6f3d45
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:47:5
[INFO] [stdout]    8:     0x55c773c84c94 - std::sys_common::backtrace::print::h23a2d212c6fff936
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:34:9
[INFO] [stdout]    9:     0x55c773c86957 - std::panicking::default_hook::{{closure}}::h8a1d2ee00185001a
[INFO] [stdout]   10:     0x55c773c86643 - std::panicking::default_hook::h6038f2eba384e475
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:289:9
[INFO] [stdout]   11:     0x55c773c550a7 - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::h0ad024c9bdc6d768
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2021:9
[INFO] [stdout]   12:     0x55c773c550a7 - test::test_main::{{closure}}::h7500b54257359db6
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:138:21
[INFO] [stdout]   13:     0x55c773c86f68 - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::h1f8f335eaa9cfaee
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2021:9
[INFO] [stdout]   14:     0x55c773c86f68 - std::panicking::rust_panic_with_hook::h2b5517d590cab22e
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:783:13
[INFO] [stdout]   15:     0x55c773c86cbe - std::panicking::begin_panic_handler::{{closure}}::h233112c06e0ef43e
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:657:13
[INFO] [stdout]   16:     0x55c773c85376 - std::sys_common::backtrace::__rust_end_short_backtrace::h6e893f24d7ebbff8
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:170:18
[INFO] [stdout]   17:     0x55c773c86a22 - rust_begin_unwind
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:645:5
[INFO] [stdout]   18:     0x55c773bffcf5 - core::panicking::panic_fmt::hbf0e066aabfa482c
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panicking.rs:72:14
[INFO] [stdout]   19:     0x55c773c0010b - core::panicking::assert_failed_inner::h0bba8b7c26ee4492
[INFO] [stdout]   20:     0x55c773c0092e - core::panicking::assert_failed::hdc1e3f4f12cce7b0
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panicking.rs:279:5
[INFO] [stdout]   21:     0x55c773c0da8f - scripts::dynamic_programming::word_break::tests::word_break_test::h6a25d45338df0445
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:36:9
[INFO] [stdout]   22:     0x55c773c0dc7c - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::h76250bc9044e9803
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:5
[INFO] [stdout]   23:     0x55c773c0dab7 - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::{{closure}}::ha3791aeb0ab563de
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:14
[INFO] [stdout]   24:     0x55c773c1d026 - core::ops::function::FnOnce::call_once::ha0b93070548d9b85
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   25:     0x55c773c5a6ff - core::ops::function::FnOnce::call_once::h2b5d431d5046312d
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   26:     0x55c773c5a6ff - test::__rust_begin_short_backtrace::h7714669af176e207
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:628:18
[INFO] [stdout]   27:     0x55c773c59715 - test::run_test_in_process::{{closure}}::h85218797dcbcec12
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:651:60
[INFO] [stdout]   28:     0x55c773c59715 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h76c106ea31c14d7b
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   29:     0x55c773c59715 - std::panicking::try::do_call::h3bd5d0f6620ee946
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:552:40
[INFO] [stdout]   30:     0x55c773c59715 - std::panicking::try::h232e535e4744fe31
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:516:19
[INFO] [stdout]   31:     0x55c773c59715 - std::panic::catch_unwind::h3ce3bd6ca8dbac68
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panic.rs:142:14
[INFO] [stdout]   32:     0x55c773c59715 - test::run_test_in_process::hc97b257c9621286a
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:651:27
[INFO] [stdout]   33:     0x55c773c59715 - test::run_test::{{closure}}::h2aa798823a438d38
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:574:43
[INFO] [stdout]   34:     0x55c773c219d6 - test::run_test::{{closure}}::h87d231c78fb59832
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:602:41
[INFO] [stdout]   35:     0x55c773c219d6 - std::sys_common::backtrace::__rust_begin_short_backtrace::he6df152596625789
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:154:18
[INFO] [stdout]   36:     0x55c773c26a87 - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::ha94be15d1e0acf36
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/thread/mod.rs:529:17
[INFO] [stdout]   37:     0x55c773c26a87 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h9dc6bd6372f16606
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   38:     0x55c773c26a87 - std::panicking::try::do_call::h9057517f80303cd4
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:552:40
[INFO] [stdout]   39:     0x55c773c26a87 - std::panicking::try::he3a30b11ee45340c
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:516:19
[INFO] [stdout]   40:     0x55c773c26a87 - std::panic::catch_unwind::h410458cfd3528b8b
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panic.rs:142:14
[INFO] [stdout]   41:     0x55c773c26a87 - std::thread::Builder::spawn_unchecked_::{{closure}}::h72ac3bdb567b737b
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/thread/mod.rs:528:30
[INFO] [stdout]   42:     0x55c773c26a87 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h38f34da3654a8344
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   43:     0x55c773c8b9f5 - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::hc7eafaff61e32df9
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2007:9
[INFO] [stdout]   44:     0x55c773c8b9f5 - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h6ba4a5de48dd2304
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2007:9
[INFO] [stdout]   45:     0x55c773c8b9f5 - std::sys::unix::thread::Thread::new::thread_start::he469335aef763e45
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys/unix/thread.rs:108:17
[INFO] [stdout]   46:     0x7f43359d1ac3 - <unknown>
[INFO] [stdout]   47:     0x7f4335a62bf4 - __clone
[INFO] [stdout]   48:                0x0 - <unknown>
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout]     dynamic_programming::word_break::tests::word_break_test::case_1
[INFO] [stdout] 
[INFO] [stdout] test result: FAILED. 43 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 5.98s
[INFO] [stdout] 
[INFO] [stderr] error: test failed, to rerun pass `--bin scripts`
[INFO] running `Command { std: "docker" "inspect" "0e0fcf8befd123eeef9e8ad86e3c997aec94ba99061e7d20acabdfc66ae65e5f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0e0fcf8befd123eeef9e8ad86e3c997aec94ba99061e7d20acabdfc66ae65e5f", kill_on_drop: false }`
[INFO] [stdout] 0e0fcf8befd123eeef9e8ad86e3c997aec94ba99061e7d20acabdfc66ae65e5f
[INFO] testing aditya2337/learn-algorithms against beta-2023-12-22 for beta-1.76-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faditya2337%2Flearn-algorithms" "/workspace/builds/worker-3-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/aditya2337/learn-algorithms on toolchain beta-2023-12-22
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2023-12-22" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/aditya2337/learn-algorithms
[INFO] finished tweaking git repo https://github.com/aditya2337/learn-algorithms
[INFO] tweaked toml for git repo https://github.com/aditya2337/learn-algorithms written to /workspace/builds/worker-3-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/aditya2337/learn-algorithms already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2023-12-22" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 91ca4e1aac854aacf0eb06da2b7a752d94fd93ef76885cfa10725cb059d0310b
[INFO] running `Command { std: "docker" "start" "-a" "91ca4e1aac854aacf0eb06da2b7a752d94fd93ef76885cfa10725cb059d0310b", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "91ca4e1aac854aacf0eb06da2b7a752d94fd93ef76885cfa10725cb059d0310b", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "91ca4e1aac854aacf0eb06da2b7a752d94fd93ef76885cfa10725cb059d0310b", kill_on_drop: false }`
[INFO] [stdout] 91ca4e1aac854aacf0eb06da2b7a752d94fd93ef76885cfa10725cb059d0310b
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 6047cc41b2fdae73ab4e7903ed337b21a65dfb50ef07e0adb053586ca8274beb
[INFO] running `Command { std: "docker" "start" "-a" "6047cc41b2fdae73ab4e7903ed337b21a65dfb50ef07e0adb053586ca8274beb", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.59
[INFO] [stderr]    Compiling quote v1.0.28
[INFO] [stderr]    Compiling unicode-ident v1.0.9
[INFO] [stderr]    Compiling futures-core v0.3.28
[INFO] [stderr]    Compiling semver v1.0.17
[INFO] [stderr]    Compiling futures-task v0.3.28
[INFO] [stderr]    Compiling futures-channel v0.3.28
[INFO] [stderr]    Compiling futures-util v0.3.28
[INFO] [stderr]    Compiling futures-sink v0.3.28
[INFO] [stderr]    Compiling syn v1.0.109
[INFO] [stderr]    Compiling futures-io v0.3.28
[INFO] [stderr]    Compiling cfg-if v1.0.0
[INFO] [stderr]    Compiling futures-timer v3.0.2
[INFO] [stderr]    Compiling rustc_version v0.4.0
[INFO] [stderr]    Compiling rstest_macros v0.17.0
[INFO] [stderr]    Compiling syn v2.0.18
[INFO] [stderr]    Compiling futures-macro v0.3.28
[INFO] [stderr]    Compiling futures-executor v0.3.28
[INFO] [stderr]    Compiling futures v0.3.28
[INFO] [stderr]    Compiling rstest v0.17.0
[INFO] [stderr]    Compiling scripts v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `Node`
[INFO] [stdout]  --> src/binary_tree/breadth_first_traversal.rs:3:32
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::types::{BinaryTree, Node};
[INFO] [stdout]   |                                ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem`, `ops::Index`
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:1:23
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{fmt::Debug, mem, ptr, ops::Index};
[INFO] [stdout]   |                       ^^^       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if (i >= maze.len()) {
[INFO] [stdout]    |            ^               ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 21 -         if (i >= maze.len()) {
[INFO] [stdout] 21 +         if i >= maze.len() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:73:12
[INFO] [stdout]    |
[INFO] [stdout] 73 |         if (walk(
[INFO] [stdout]    |            ^
[INFO] [stdout] ...
[INFO] [stdout] 80 |         )) {
[INFO] [stdout]    |          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 73 ~         if walk(
[INFO] [stdout] 74 |             maze,
[INFO] [stdout]  ...
[INFO] [stdout] 79 |             path,
[INFO] [stdout] 80 ~         ) {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/queue.rs:54:13
[INFO] [stdout]    |
[INFO] [stdout] 54 |         let mut current_node = self.head.take();
[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: function `pre_order_traversal` is never used
[INFO] [stdout]  --> src/binary_tree/binary_tree_pre_order.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn pre_order_traversal<T: std::clone::Clone>(head: &Link<T>) -> Vec<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk` is never used
[INFO] [stdout]  --> src/binary_tree/binary_tree_pre_order.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn walk<T: Clone>(node: &Link<T>, path: &mut Vec<T>) {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `breadth_first_traversal` is never used
[INFO] [stdout]  --> src/binary_tree/breadth_first_traversal.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn breadth_first_traversal<T: Clone>(tree: &BinaryTree<T>) -> Vec<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `push_to_queue` is never used
[INFO] [stdout]   --> src/binary_tree/breadth_first_traversal.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn push_to_queue<T>(value: Option<T>, queue: &mut Queue<T>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_mock_tree` is never used
[INFO] [stdout]  --> src/binary_tree/mock_tree.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn get_mock_tree() -> BinaryTree<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/types.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | / impl<T> BinaryTree<T>
[INFO] [stdout] 10 | | where
[INFO] [stdout] 11 | |     T: Debug,
[INFO] [stdout]    | |_____________- associated function in this implementation
[INFO] [stdout] 12 |   {
[INFO] [stdout] 13 |       pub fn new() -> Self {
[INFO] [stdout]    |              ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/types.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | / impl<T> Node<T>
[INFO] [stdout] 26 | | where
[INFO] [stdout] 27 | |     T: Debug,
[INFO] [stdout]    | |_____________- associated function in this implementation
[INFO] [stdout] 28 |   {
[INFO] [stdout] 29 |       pub fn new(value: T) -> Self {
[INFO] [stdout]    |              ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `tree` is never read
[INFO] [stdout]  --> src/binary_tree/BST.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct BinarySearchTree {
[INFO] [stdout]   |        ---------------- field in this struct
[INFO] [stdout] 5 |     tree: BinaryTree<i32>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `BinarySearchTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, and `delete` are never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl BinarySearchTree {
[INFO] [stdout]    | --------------------- associated items in this implementation
[INFO] [stdout] 9  |     pub fn new(tree: BinaryTree<i32>) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     pub fn insert(&mut self, item: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn delete(mut self, item: i32) -> Self {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_value_node` is never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn min_value_node(node: &Node<i32>) -> &Node<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_node` is never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:39:4
[INFO] [stdout]    |
[INFO] [stdout] 39 | fn delete_node(node: Link<i32>, item: i32) -> Link<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk_and_insert` is never used
[INFO] [stdout]   --> src/binary_tree/BST.rs:73:4
[INFO] [stdout]    |
[INFO] [stdout] 73 | fn walk_and_insert(node: &mut Node<i32>, item: i32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `val`, `left_child`, `right_child`, and `height` are never read
[INFO] [stdout]   --> src/binary_tree/AVL_tree.rs:7:5
[INFO] [stdout]    |
[INFO] [stdout] 6  | struct AVLNode {
[INFO] [stdout]    |        ------- fields in this struct
[INFO] [stdout] 7  |     val: i32,
[INFO] [stdout]    |     ^^^
[INFO] [stdout] 8  |     left_child: Link,
[INFO] [stdout]    |     ^^^^^^^^^^
[INFO] [stdout] 9  |     right_child: Link,
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout] 10 |     height: usize,
[INFO] [stdout]    |     ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `AVLNode` 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/binary_tree/AVL_tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl AVLNode {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn height(node: &Link) -> usize {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn get_left_height(&self) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn get_right_height(&self) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn balance_factor(&self) -> i8 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn update_height(&mut self) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     fn rotate_left(&mut self) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     fn rotate_right(&mut self) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn balance(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 92 |     pub fn insert(&mut self, val: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `root` is never read
[INFO] [stdout]    --> src/binary_tree/AVL_tree.rs:102:5
[INFO] [stdout]     |
[INFO] [stdout] 101 | struct AVLTree {
[INFO] [stdout]     |        ------- field in this struct
[INFO] [stdout] 102 |     root: Link,
[INFO] [stdout]     |     ^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `AVLTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `insert` are never used
[INFO] [stdout]    --> src/binary_tree/AVL_tree.rs:106:12
[INFO] [stdout]     |
[INFO] [stdout] 105 | impl AVLTree {
[INFO] [stdout]     | ------------ associated items in this implementation
[INFO] [stdout] 106 |     pub fn new() -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 110 |     pub fn insert(&mut self, val: i32) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk_and_insert` is never used
[INFO] [stdout]    --> src/binary_tree/AVL_tree.rs:121:4
[INFO] [stdout]     |
[INFO] [stdout] 121 | fn walk_and_insert(node: &mut AVLNode, new_node: AVLNode) {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `length` and `harr` are never read
[INFO] [stdout]  --> src/heap.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct MinHeap {
[INFO] [stdout]   |            ------- fields in this struct
[INFO] [stdout] 3 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout] 4 |     harr: Vec<i32>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `MinHeap` 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/heap.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl MinHeap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 8  |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn get_left_child_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn get_right_child_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn get_parent_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn swap_up(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn swap_down(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn insert(&mut self, item: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     pub fn delete_min(&mut self) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79 |     pub fn delete_element(&mut self, item: i32) {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head`, `tail`, and `length` are never read
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct DoublyLinkedList<T> {
[INFO] [stdout]   |        ---------------- fields in this struct
[INFO] [stdout] 7 |     head: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 8 |     tail: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 9 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `DoublyLinkedList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `append_front`, `append`, `pop`, and `pop_front` are never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> DoublyLinkedList<T> {
[INFO] [stdout]    | --------------------------- associated items in this implementation
[INFO] [stdout] 12 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn append_front(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn append(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `val`, `next`, and `prev` are never read
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:93:5
[INFO] [stdout]    |
[INFO] [stdout] 92 | struct Node<T> {
[INFO] [stdout]    |        ---- fields in this struct
[INFO] [stdout] 93 |     val: T,
[INFO] [stdout]    |     ^^^
[INFO] [stdout] 94 |     next: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 95 |     prev: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:98:12
[INFO] [stdout]    |
[INFO] [stdout] 97 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 98 |     pub fn new(val: T) -> Rc<RefCell<Self>> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `value` and `next` are never read
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ---- fields in this struct
[INFO] [stdout] 7 |     value: T,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout] 8 |     next: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head` and `tail` are never read
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct LinkedList<T> {
[INFO] [stdout]    |            ---------- fields in this struct
[INFO] [stdout] 19 |     head: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 20 |     tail: *mut Node<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `LinkedList` 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/linked_lists/linked_lists.rs:27:12
[INFO] [stdout]     |
[INFO] [stdout] 23  | / impl<T> LinkedList<T>
[INFO] [stdout] 24  | | where
[INFO] [stdout] 25  | |     T: Debug,
[INFO] [stdout]     | |_____________- associated items in this implementation
[INFO] [stdout] 26  |   {
[INFO] [stdout] 27  |       pub fn new() -> Self {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |       pub fn get_length(&self) -> i32 {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51  |       fn check_idx_validity(&self, &idx: &i32) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       pub fn insert_at(&mut self, value: T, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79  |       pub fn delete_at(&mut self, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |       pub fn append(&mut self, value: T) {
[INFO] [stdout]     |              ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 120 |       fn prepend(&self) {}
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_ll` is never used
[INFO] [stdout]    --> src/linked_lists/linked_lists.rs:123:8
[INFO] [stdout]     |
[INFO] [stdout] 123 | pub fn test_ll() {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_lists/merge_linked_list.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]   --> src/linked_lists/merge_linked_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn merge_two_lists(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `create_linked_list` is never used
[INFO] [stdout]   --> src/linked_lists/merge_linked_list.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn create_linked_list(nums: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_lists/reverse_linked_list.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]   --> src/linked_lists/reverse_linked_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `create_linked_list` is never used
[INFO] [stdout]   --> src/linked_lists/reverse_linked_list.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn create_linked_list(nums: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `matrix_multiply` is never used
[INFO] [stdout]  --> src/matrix_multiply.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn matrix_multiply(a: &Vec<Vec<i32>>, b: &Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/path_finding.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Point {
[INFO] [stdout]   | ---------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn new(x: isize, y: isize) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Maze` is never used
[INFO] [stdout]   --> src/path_finding.rs:13:6
[INFO] [stdout]    |
[INFO] [stdout] 13 | type Maze = Vec<String>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_path` is never used
[INFO] [stdout]   --> src/path_finding.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn find_path(maze: Maze, wall: char, start: Point, end: Point) -> Vec<Point> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `walk` is never used
[INFO] [stdout]   --> src/path_finding.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn walk(
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `next` is never read
[INFO] [stdout]  --> src/queue.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ---- field in this struct
[INFO] [stdout] 7 |     pub value: T,
[INFO] [stdout] 8 |     next: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/queue.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head` and `tail` are never read
[INFO] [stdout]   --> src/queue.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct Queue<T> {
[INFO] [stdout]    |            ----- fields in this struct
[INFO] [stdout] 19 |     pub length: i32,
[INFO] [stdout] 20 |     head: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 21 |     tail: *mut Node<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Queue` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, and `peek` are never used
[INFO] [stdout]   --> src/queue.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl<T> Queue<T> {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 25 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn enqueue(&mut self, item: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     pub fn dequeue(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     fn peek(&self) -> &Link<T> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]  --> src/search_insert_pos.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_idx` is never used
[INFO] [stdout]  --> src/search_insert_pos.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn search_idx(start_idx: usize, end_idx: usize, target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `PRICES` is never used
[INFO] [stdout]  --> src/dynamic_programming/rod_cutting.rs:3:7
[INFO] [stdout]   |
[INFO] [stdout] 3 | const PRICES: [u8; 40] = [
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rod_cut_recursively` is never used
[INFO] [stdout]  --> src/dynamic_programming/rod_cutting.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn rod_cut_recursively(idx: usize) -> u8 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rod_cut_top_down` is never used
[INFO] [stdout]   --> src/dynamic_programming/rod_cutting.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn rod_cut_top_down(idx: usize) -> u8 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memoized_cut_rod_aux` is never used
[INFO] [stdout]   --> src/dynamic_programming/rod_cutting.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn memoized_cut_rod_aux(idx: usize, r: &mut Vec<u8>) -> u8 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rod_cut_bottom_up` is never used
[INFO] [stdout]   --> src/dynamic_programming/rod_cutting.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 45 | pub fn rod_cut_bottom_up(idx: usize) -> u8 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/dynamic_programming/maximum_subarray.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_iterative` is never used
[INFO] [stdout]  --> src/dynamic_programming/maximum_subarray.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_sub_array_iterative(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_recursive` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn max_sub_array_recursive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_linear` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn max_sub_array_linear(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_kadane` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:59:8
[INFO] [stdout]    |
[INFO] [stdout] 59 | pub fn max_sub_array_kadane(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]  --> src/dynamic_programming/longest_increasing_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> src/dynamic_programming/climbing_stairs.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/dynamic_programming/coin_change.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_min_coins` is never used
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn cal_min_coins(coins: &Vec<i32>, amount: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_min_coins_bottom_up` is never used
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:42:4
[INFO] [stdout]    |
[INFO] [stdout] 42 | fn cal_min_coins_bottom_up(coins: &Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `word_break` is never used
[INFO] [stdout]  --> src/dynamic_programming/word_break.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]  --> src/dynamic_programming/house_robber.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `heap` and `size` are never read
[INFO] [stdout]  --> src/sorting/heap_sort.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Heap {
[INFO] [stdout]   |        ---- fields in this struct
[INFO] [stdout] 3 |     heap: Vec<i32>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 4 |     size: usize,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Heap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `heapify`, `sort`, `delete`, `left_idx`, and `right_idx` are never used
[INFO] [stdout]   --> src/sorting/heap_sort.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl Heap {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 8  |     pub fn new(arr: Vec<i32>) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn heapify(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn sort(&mut self) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn delete(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn left_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn right_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `srt` is never used
[INFO] [stdout]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn srt<'a>(unsorted_list: &'a mut Vec<i32>) -> &'a Vec<i32> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/bubble_sort.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn swap(previous_idx: usize, next_idx: usize, list: &mut Vec<i32>) -> &Vec<i32> {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]  --> src/sorting/counting_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn sort(a: Vec<usize>) -> Vec<usize> {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]  --> src/sorting/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn sort(arr: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]  --> src/sorting/merge_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn sort(arr: &mut Vec<i32>, p: usize, r: usize) {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/sorting/merge_sort.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn merge(arr: &mut Vec<i32>, p: usize, q: usize, r: usize) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `new_sort` is never used
[INFO] [stdout]  --> src/sorting/quick_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn new_sort(list: &mut Vec<i32>, lo: usize, hi: usize) {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]   --> src/sorting/quick_sort.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn partition(list: &mut Vec<i32>, lo: usize, hi: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WeightedAdjacencyMatrix` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type WeightedAdjacencyMatrix = Vec<Vec<i32>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bfs` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn bfs(graph: WeightedAdjacencyMatrix, source: i32, needle: i32) -> Option<Vec<i32>> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `BST` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub mod BST;
[INFO] [stdout]   |         ^^^ help: convert the identifier to snake case: `bst`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `AVL_tree` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub mod AVL_tree;
[INFO] [stdout]   |         ^^^^^^^^ help: convert the identifier to snake case: `avl_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 81 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 10.45s
[INFO] running `Command { std: "docker" "inspect" "6047cc41b2fdae73ab4e7903ed337b21a65dfb50ef07e0adb053586ca8274beb", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6047cc41b2fdae73ab4e7903ed337b21a65dfb50ef07e0adb053586ca8274beb", kill_on_drop: false }`
[INFO] [stdout] 6047cc41b2fdae73ab4e7903ed337b21a65dfb50ef07e0adb053586ca8274beb
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f30a8ca42e96453b8ef0c2e57eacdb9653c65b89de4bc2281b087e03c019c6d8
[INFO] running `Command { std: "docker" "start" "-a" "f30a8ca42e96453b8ef0c2e57eacdb9653c65b89de4bc2281b087e03c019c6d8", kill_on_drop: false }`
[INFO] [stderr]    Compiling scripts v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `Node`
[INFO] [stdout]  --> src/binary_tree/breadth_first_traversal.rs:3:32
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::types::{BinaryTree, Node};
[INFO] [stdout]   |                                ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem`, `ops::Index`
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:1:23
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{fmt::Debug, mem, ptr, ops::Index};
[INFO] [stdout]   |                       ^^^       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if (i >= maze.len()) {
[INFO] [stdout]    |            ^               ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 21 -         if (i >= maze.len()) {
[INFO] [stdout] 21 +         if i >= maze.len() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/path_finding.rs:73:12
[INFO] [stdout]    |
[INFO] [stdout] 73 |         if (walk(
[INFO] [stdout]    |            ^
[INFO] [stdout] ...
[INFO] [stdout] 80 |         )) {
[INFO] [stdout]    |          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 73 ~         if walk(
[INFO] [stdout] 74 |             maze,
[INFO] [stdout]  ...
[INFO] [stdout] 79 |             path,
[INFO] [stdout] 80 ~         ) {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/queue.rs:54:13
[INFO] [stdout]    |
[INFO] [stdout] 54 |         let mut current_node = self.head.take();
[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: unused variable: `nums`
[INFO] [stdout]   --> src/search_insert_pos.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let nums = vec![1, 3, 5, 6];
[INFO] [stdout]    |             ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `length` is never read
[INFO] [stdout]  --> src/heap.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct MinHeap {
[INFO] [stdout]   |            ------- field in this struct
[INFO] [stdout] 3 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `MinHeap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `get_right_child_idx` is never used
[INFO] [stdout]   --> src/heap.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl MinHeap {
[INFO] [stdout]    | ------------ method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn get_right_child_idx(&self, i: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head`, `tail`, and `length` are never read
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct DoublyLinkedList<T> {
[INFO] [stdout]   |        ---------------- fields in this struct
[INFO] [stdout] 7 |     head: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 8 |     tail: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 9 |     length: usize,
[INFO] [stdout]   |     ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `DoublyLinkedList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `append_front`, `append`, `pop`, and `pop_front` are never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> DoublyLinkedList<T> {
[INFO] [stdout]    | --------------------------- associated items in this implementation
[INFO] [stdout] 12 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn append_front(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn append(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `val`, `next`, and `prev` are never read
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:93:5
[INFO] [stdout]    |
[INFO] [stdout] 92 | struct Node<T> {
[INFO] [stdout]    |        ---- fields in this struct
[INFO] [stdout] 93 |     val: T,
[INFO] [stdout]    |     ^^^
[INFO] [stdout] 94 |     next: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 95 |     prev: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:98:12
[INFO] [stdout]    |
[INFO] [stdout] 97 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 98 |     pub fn new(val: T) -> Rc<RefCell<Self>> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `value` and `next` are never read
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ---- fields in this struct
[INFO] [stdout] 7 |     value: T,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout] 8 |     next: Link<T>,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `head` and `tail` are never read
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct LinkedList<T> {
[INFO] [stdout]    |            ---------- fields in this struct
[INFO] [stdout] 19 |     head: Link<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 20 |     tail: *mut Node<T>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `LinkedList` 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/linked_lists/linked_lists.rs:27:12
[INFO] [stdout]     |
[INFO] [stdout] 23  | / impl<T> LinkedList<T>
[INFO] [stdout] 24  | | where
[INFO] [stdout] 25  | |     T: Debug,
[INFO] [stdout]     | |_____________- associated items in this implementation
[INFO] [stdout] 26  |   {
[INFO] [stdout] 27  |       pub fn new() -> Self {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34  |       pub fn get_length(&self) -> i32 {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51  |       fn check_idx_validity(&self, &idx: &i32) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57  |       pub fn insert_at(&mut self, value: T, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79  |       pub fn delete_at(&mut self, idx: i32) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |       pub fn append(&mut self, value: T) {
[INFO] [stdout]     |              ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 120 |       fn prepend(&self) {}
[INFO] [stdout]     |          ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_ll` is never used
[INFO] [stdout]    --> src/linked_lists/linked_lists.rs:123:8
[INFO] [stdout]     |
[INFO] [stdout] 123 | pub fn test_ll() {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_lists/reverse_linked_list.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_iterative` is never used
[INFO] [stdout]  --> src/dynamic_programming/maximum_subarray.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_sub_array_iterative(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_recursive` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn max_sub_array_recursive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array_linear` is never used
[INFO] [stdout]   --> src/dynamic_programming/maximum_subarray.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn max_sub_array_linear(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cal_min_coins` is never used
[INFO] [stdout]   --> src/dynamic_programming/coin_change.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn cal_min_coins(coins: &Vec<i32>, amount: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `srt` is never used
[INFO] [stdout]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn srt<'a>(unsorted_list: &'a mut Vec<i32>) -> &'a Vec<i32> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/bubble_sort.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn swap(previous_idx: usize, next_idx: usize, list: &mut Vec<i32>) -> &Vec<i32> {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WeightedAdjacencyMatrix` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type WeightedAdjacencyMatrix = Vec<Vec<i32>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bfs` is never used
[INFO] [stdout]  --> src/graphs/bfs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn bfs(graph: WeightedAdjacencyMatrix, source: i32, needle: i32) -> Option<Vec<i32>> {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `BST` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub mod BST;
[INFO] [stdout]   |         ^^^ help: convert the identifier to snake case: `bst`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `AVL_tree` should have a snake case name
[INFO] [stdout]  --> src/binary_tree/mod.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub mod AVL_tree;
[INFO] [stdout]   |         ^^^^^^^^ help: convert the identifier to snake case: `avl_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 28 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.80s
[INFO] running `Command { std: "docker" "inspect" "f30a8ca42e96453b8ef0c2e57eacdb9653c65b89de4bc2281b087e03c019c6d8", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f30a8ca42e96453b8ef0c2e57eacdb9653c65b89de4bc2281b087e03c019c6d8", kill_on_drop: false }`
[INFO] [stdout] f30a8ca42e96453b8ef0c2e57eacdb9653c65b89de4bc2281b087e03c019c6d8
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 0c69bdcb82bfa58e452e70055218e7b3b7d3cd92d6ccbec128edf4fba940ca96
[INFO] running `Command { std: "docker" "start" "-a" "0c69bdcb82bfa58e452e70055218e7b3b7d3cd92d6ccbec128edf4fba940ca96", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `Node`
[INFO] [stderr]  --> src/binary_tree/breadth_first_traversal.rs:3:32
[INFO] [stderr]   |
[INFO] [stderr] 3 | use super::types::{BinaryTree, Node};
[INFO] [stderr]   |                                ^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `mem`, `ops::Index`
[INFO] [stderr]  --> src/linked_lists/linked_lists.rs:1:23
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{fmt::Debug, mem, ptr, ops::Index};
[INFO] [stderr]   |                       ^^^       ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/path_finding.rs:21:12
[INFO] [stderr]    |
[INFO] [stderr] 21 |         if (i >= maze.len()) {
[INFO] [stderr]    |            ^               ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stderr] help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr] 21 -         if (i >= maze.len()) {
[INFO] [stderr] 21 +         if i >= maze.len() {
[INFO] [stderr]    |
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/path_finding.rs:73:12
[INFO] [stderr]    |
[INFO] [stderr] 73 |         if (walk(
[INFO] [stderr]    |            ^
[INFO] [stderr] ...
[INFO] [stderr] 80 |         )) {
[INFO] [stderr]    |          ^
[INFO] [stderr]    |
[INFO] [stderr] help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr] 73 ~         if walk(
[INFO] [stderr] 74 |             maze,
[INFO] [stderr]  ...
[INFO] [stderr] 79 |             path,
[INFO] [stderr] 80 ~         ) {
[INFO] [stderr]    |
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/queue.rs:54:13
[INFO] [stderr]    |
[INFO] [stderr] 54 |         let mut current_node = self.head.take();
[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: unused variable: `nums`
[INFO] [stderr]   --> src/search_insert_pos.rs:47:13
[INFO] [stderr]    |
[INFO] [stderr] 47 |         let nums = vec![1, 3, 5, 6];
[INFO] [stderr]    |             ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: field `length` is never read
[INFO] [stderr]  --> src/heap.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct MinHeap {
[INFO] [stderr]   |            ------- field in this struct
[INFO] [stderr] 3 |     length: usize,
[INFO] [stderr]   |     ^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `MinHeap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method `get_right_child_idx` is never used
[INFO] [stderr]   --> src/heap.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 7  | impl MinHeap {
[INFO] [stderr]    | ------------ method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 19 |     fn get_right_child_idx(&self, i: usize) -> usize {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `head`, `tail`, and `length` are never read
[INFO] [stderr]  --> src/linked_lists/doubly_linked_list.rs:7:5
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct DoublyLinkedList<T> {
[INFO] [stderr]   |        ---------------- fields in this struct
[INFO] [stderr] 7 |     head: Link<T>,
[INFO] [stderr]   |     ^^^^
[INFO] [stderr] 8 |     tail: Link<T>,
[INFO] [stderr]   |     ^^^^
[INFO] [stderr] 9 |     length: usize,
[INFO] [stderr]   |     ^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `DoublyLinkedList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `append_front`, `append`, `pop`, and `pop_front` are never used
[INFO] [stderr]   --> src/linked_lists/doubly_linked_list.rs:12:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl<T> DoublyLinkedList<T> {
[INFO] [stderr]    | --------------------------- associated items in this implementation
[INFO] [stderr] 12 |     pub fn new() -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |     pub fn append_front(&mut self, val: T) {
[INFO] [stderr]    |            ^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 36 |     pub fn append(&mut self, val: T) {
[INFO] [stderr]    |            ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 53 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 70 |     pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `val`, `next`, and `prev` are never read
[INFO] [stderr]   --> src/linked_lists/doubly_linked_list.rs:93:5
[INFO] [stderr]    |
[INFO] [stderr] 92 | struct Node<T> {
[INFO] [stderr]    |        ---- fields in this struct
[INFO] [stderr] 93 |     val: T,
[INFO] [stderr]    |     ^^^
[INFO] [stderr] 94 |     next: Link<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr] 95 |     prev: Link<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/linked_lists/doubly_linked_list.rs:98:12
[INFO] [stderr]    |
[INFO] [stderr] 97 | impl<T> Node<T> {
[INFO] [stderr]    | --------------- associated function in this implementation
[INFO] [stderr] 98 |     pub fn new(val: T) -> Rc<RefCell<Self>> {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `value` and `next` are never read
[INFO] [stderr]  --> src/linked_lists/linked_lists.rs:7:5
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct Node<T> {
[INFO] [stderr]   |            ---- fields in this struct
[INFO] [stderr] 7 |     value: T,
[INFO] [stderr]   |     ^^^^^
[INFO] [stderr] 8 |     next: Link<T>,
[INFO] [stderr]   |     ^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/linked_lists/linked_lists.rs:12:12
[INFO] [stderr]    |
[INFO] [stderr] 11 | impl<T> Node<T> {
[INFO] [stderr]    | --------------- associated function in this implementation
[INFO] [stderr] 12 |     pub fn new(value: T) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `head` and `tail` are never read
[INFO] [stderr]   --> src/linked_lists/linked_lists.rs:19:5
[INFO] [stderr]    |
[INFO] [stderr] 18 | pub struct LinkedList<T> {
[INFO] [stderr]    |            ---------- fields in this struct
[INFO] [stderr] 19 |     head: Link<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr] 20 |     tail: *mut Node<T>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `LinkedList` 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/linked_lists/linked_lists.rs:27:12
[INFO] [stderr]     |
[INFO] [stderr] 23  | / impl<T> LinkedList<T>
[INFO] [stderr] 24  | | where
[INFO] [stderr] 25  | |     T: Debug,
[INFO] [stderr]     | |_____________- associated items in this implementation
[INFO] [stderr] 26  |   {
[INFO] [stderr] 27  |       pub fn new() -> Self {
[INFO] [stderr]     |              ^^^
[INFO] [stderr] ...
[INFO] [stderr] 34  |       pub fn get_length(&self) -> i32 {
[INFO] [stderr]     |              ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 51  |       fn check_idx_validity(&self, &idx: &i32) {
[INFO] [stderr]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 57  |       pub fn insert_at(&mut self, value: T, idx: i32) -> bool {
[INFO] [stderr]     |              ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 79  |       pub fn delete_at(&mut self, idx: i32) -> bool {
[INFO] [stderr]     |              ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 106 |       pub fn append(&mut self, value: T) {
[INFO] [stderr]     |              ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 120 |       fn prepend(&self) {}
[INFO] [stderr]     |          ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `test_ll` is never used
[INFO] [stderr]    --> src/linked_lists/linked_lists.rs:123:8
[INFO] [stderr]     |
[INFO] [stderr] 123 | pub fn test_ll() {
[INFO] [stderr]     |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/linked_lists/reverse_linked_list.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     #[inline]
[INFO] [stderr] 9 |     fn new(val: i32) -> Self {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_sub_array_iterative` is never used
[INFO] [stderr]  --> src/dynamic_programming/maximum_subarray.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn max_sub_array_iterative(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_sub_array_recursive` is never used
[INFO] [stderr]   --> src/dynamic_programming/maximum_subarray.rs:25:8
[INFO] [stderr]    |
[INFO] [stderr] 25 | pub fn max_sub_array_recursive(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_sub_array_linear` is never used
[INFO] [stderr]   --> src/dynamic_programming/maximum_subarray.rs:43:8
[INFO] [stderr]    |
[INFO] [stderr] 43 | pub fn max_sub_array_linear(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `cal_min_coins` is never used
[INFO] [stderr]   --> src/dynamic_programming/coin_change.rs:12:4
[INFO] [stderr]    |
[INFO] [stderr] 12 | fn cal_min_coins(coins: &Vec<i32>, amount: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stderr]    |    ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `srt` is never used
[INFO] [stderr]  --> src/sorting/bubble_sort.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn srt<'a>(unsorted_list: &'a mut Vec<i32>) -> &'a Vec<i32> {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `swap` is never used
[INFO] [stderr]   --> src/sorting/bubble_sort.rs:29:4
[INFO] [stderr]    |
[INFO] [stderr] 29 | fn swap(previous_idx: usize, next_idx: usize, list: &mut Vec<i32>) -> &Vec<i32> {
[INFO] [stderr]    |    ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `WeightedAdjacencyMatrix` is never used
[INFO] [stderr]  --> src/graphs/bfs.rs:3:6
[INFO] [stderr]   |
[INFO] [stderr] 3 | type WeightedAdjacencyMatrix = Vec<Vec<i32>>;
[INFO] [stderr]   |      ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `bfs` is never used
[INFO] [stderr]  --> src/graphs/bfs.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn bfs(graph: WeightedAdjacencyMatrix, source: i32, needle: i32) -> Option<Vec<i32>> {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: module `BST` should have a snake case name
[INFO] [stderr]  --> src/binary_tree/mod.rs:5:9
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub mod BST;
[INFO] [stderr]   |         ^^^ help: convert the identifier to snake case: `bst`
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: module `AVL_tree` should have a snake case name
[INFO] [stderr]  --> src/binary_tree/mod.rs:6:9
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub mod AVL_tree;
[INFO] [stderr]   |         ^^^^^^^^ help: convert the identifier to snake case: `avl_tree`
[INFO] [stderr] 
[INFO] [stderr] warning: `scripts` (bin "scripts" test) generated 28 warnings (run `cargo fix --bin "scripts" --tests` to apply 6 suggestions)
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.06s
[INFO] [stderr]      Running unittests src/main.rs (/opt/rustwide/target/debug/deps/scripts-c3b83b1f185ae131)
[INFO] [stdout] 
[INFO] [stdout] running 44 tests
[INFO] [stdout] test binary_tree::AVL_tree::tests::test_avl ... ok
[INFO] [stdout] test binary_tree::BST::tests::bst ... ok
[INFO] [stdout] test binary_tree::binary_tree_pre_order::tests::test_pre_order ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_2 ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_1 ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_3 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_2 ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_5 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_3 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_4 ... ok
[INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_4 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_5 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_1 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_2 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_3 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_1 ... ok
[INFO] [stdout] test binary_tree::breadth_first_traversal::tests::breadth_first ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_1 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_4 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_2 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_3 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_4 ... ok
[INFO] [stdout] test heap::tests::test_heap ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_6 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_2 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_3 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_4 ... ok
[INFO] [stdout] test linked_lists::merge_linked_list::tests::test_merge ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_1 ... ok
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply_empty ... ok
[INFO] [stdout] test linked_lists::reverse_linked_list::tests::test_merge ... ok
[INFO] [stdout] test path_finding::tests::test_path_finder ... ok
[INFO] [stdout] test queue::tests::test_queue ... ok
[INFO] [stdout] test search_insert_pos::tests::test_search ... ok
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply ... ok
[INFO] [stdout] test sorting::merge_sort::tests::test_merge ... ok
[INFO] [stdout] test sorting::merge_sort::tests::test_merge_sort ... ok
[INFO] [stdout] test sorting::quick_sort::tests::test_quick_sort ... ok
[INFO] [stdout] test sorting::counting_sort::tests::test_count_sort ... ok
[INFO] [stdout] test sorting::heap_sort::tests::test_heap ... ok
[INFO] [stdout] test sorting::insertion_sort::tests::test_insertion_sort ... ok
[INFO] [stdout] test dynamic_programming::word_break::tests::word_break_test::case_1 ... FAILED
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply_wrong_size - should panic ... ok
[INFO] [stdout] test dynamic_programming::rod_cutting::tests::test_rod_cut ... ok
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout] 
[INFO] [stdout] ---- dynamic_programming::word_break::tests::word_break_test::case_1 stdout ----
[INFO] [stdout] thread 'dynamic_programming::word_break::tests::word_break_test::case_1' panicked at src/dynamic_programming/word_break.rs:36:9:
[INFO] [stdout] assertion `left == right` failed
[INFO] [stdout]   left: false
[INFO] [stdout]  right: true
[INFO] [stdout] stack backtrace:
[INFO] [stdout]    0:     0x55bb477ea686 - std::backtrace_rs::backtrace::libunwind::trace::h261606ad26a499c1
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/../../backtrace/src/backtrace/libunwind.rs:104:5
[INFO] [stdout]    1:     0x55bb477ea686 - std::backtrace_rs::backtrace::trace_unsynchronized::hd183f0625477fb28
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5
[INFO] [stdout]    2:     0x55bb477ea686 - std::sys_common::backtrace::_print_fmt::hd7f8fef21b4eda67
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/sys_common/backtrace.rs:68:5
[INFO] [stdout]    3:     0x55bb477ea686 - <std::sys_common::backtrace::_print::DisplayBacktrace as core::fmt::Display>::fmt::h623d9b51f2f453f1
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/sys_common/backtrace.rs:44:22
[INFO] [stdout]    4:     0x55bb478134d0 - core::fmt::rt::Argument::fmt::h9f417ac76a86f368
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/fmt/rt.rs:142:9
[INFO] [stdout]    5:     0x55bb478134d0 - core::fmt::write::hc9b6faf4ac2aeff7
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/fmt/mod.rs:1120:17
[INFO] [stdout]    6:     0x55bb477e80ef - std::io::Write::write_fmt::he04625a3a989fec3
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/io/mod.rs:1810:15
[INFO] [stdout]    7:     0x55bb477ea464 - std::sys_common::backtrace::_print::hd5d66399c7df88a2
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/sys_common/backtrace.rs:47:5
[INFO] [stdout]    8:     0x55bb477ea464 - std::sys_common::backtrace::print::he81ed2da642d37e5
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/sys_common/backtrace.rs:34:9
[INFO] [stdout]    9:     0x55bb477ec1d7 - std::panicking::default_hook::{{closure}}::h85773f4fa117163d
[INFO] [stdout]   10:     0x55bb477ebebd - std::panicking::default_hook::h6a1694a91d09b278
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:289:9
[INFO] [stdout]   11:     0x55bb477ba117 - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::h616ac37fa3cd6c8f
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/alloc/src/boxed.rs:2029:9
[INFO] [stdout]   12:     0x55bb477ba117 - test::test_main::{{closure}}::h00d84697cefdcbb6
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/test/src/lib.rs:138:21
[INFO] [stdout]   13:     0x55bb477ec7f6 - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::hcb3fe3b9bb537ba8
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/alloc/src/boxed.rs:2029:9
[INFO] [stdout]   14:     0x55bb477ec7f6 - std::panicking::rust_panic_with_hook::h0a7ad96e90f7145b
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:783:13
[INFO] [stdout]   15:     0x55bb477ec542 - std::panicking::begin_panic_handler::{{closure}}::h7919090525c6485e
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:657:13
[INFO] [stdout]   16:     0x55bb477eab86 - std::sys_common::backtrace::__rust_end_short_backtrace::hf3289479464f7dfe
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/sys_common/backtrace.rs:171:18
[INFO] [stdout]   17:     0x55bb477ec2a0 - rust_begin_unwind
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:645:5
[INFO] [stdout]   18:     0x55bb47763cd5 - core::panicking::panic_fmt::hcc9f77c5c132af55
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/panicking.rs:72:14
[INFO] [stdout]   19:     0x55bb4776410b - core::panicking::assert_failed_inner::h9f13e27dd63c3a08
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/panicking.rs:342:17
[INFO] [stdout]   20:     0x55bb4776a3de - core::panicking::assert_failed::h39d0b4ded08f13d0
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/panicking.rs:297:5
[INFO] [stdout]   21:     0x55bb4777202f - scripts::dynamic_programming::word_break::tests::word_break_test::h51780fa5b4496c42
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:36:9
[INFO] [stdout]   22:     0x55bb4777221a - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::h240bdc02bd968996
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:5
[INFO] [stdout]   23:     0x55bb47772057 - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::{{closure}}::hf2818bcad503aa7c
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:14
[INFO] [stdout]   24:     0x55bb477732e6 - core::ops::function::FnOnce::call_once::h43ef272016b71ec4
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   25:     0x55bb477bf9ef - core::ops::function::FnOnce::call_once::hd64d26f405258157
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   26:     0x55bb477bf9ef - test::__rust_begin_short_backtrace::he21b0b7a6d731bf9
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/test/src/lib.rs:627:18
[INFO] [stdout]   27:     0x55bb477be771 - test::run_test_in_process::{{closure}}::hf5c73986d7bdfde2
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/test/src/lib.rs:650:60
[INFO] [stdout]   28:     0x55bb477be771 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h330011ad032aadc0
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   29:     0x55bb477be771 - std::panicking::try::do_call::he61b0a958b795a41
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:552:40
[INFO] [stdout]   30:     0x55bb477be771 - std::panicking::try::h7309da130f906eb7
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:516:19
[INFO] [stdout]   31:     0x55bb477be771 - std::panic::catch_unwind::hc5c3a06fdaf0a92a
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panic.rs:142:14
[INFO] [stdout]   32:     0x55bb477be771 - test::run_test_in_process::h7e7b7c71c3324e0f
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/test/src/lib.rs:650:27
[INFO] [stdout]   33:     0x55bb477be771 - test::run_test::{{closure}}::h1f509f28f5cf20b1
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/test/src/lib.rs:573:43
[INFO] [stdout]   34:     0x55bb47785aa6 - test::run_test::{{closure}}::h1754218abf443f6d
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/test/src/lib.rs:601:41
[INFO] [stdout]   35:     0x55bb47785aa6 - std::sys_common::backtrace::__rust_begin_short_backtrace::h2ee174b9d5954948
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/sys_common/backtrace.rs:155:18
[INFO] [stdout]   36:     0x55bb4778ab07 - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::hf60bee9c1a17ef09
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/thread/mod.rs:529:17
[INFO] [stdout]   37:     0x55bb4778ab07 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h33d0dddec5216160
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   38:     0x55bb4778ab07 - std::panicking::try::do_call::h144b3048b546f835
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:552:40
[INFO] [stdout]   39:     0x55bb4778ab07 - std::panicking::try::h978244d04646189f
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panicking.rs:516:19
[INFO] [stdout]   40:     0x55bb4778ab07 - std::panic::catch_unwind::hdf436369d188fe86
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/panic.rs:142:14
[INFO] [stdout]   41:     0x55bb4778ab07 - std::thread::Builder::spawn_unchecked_::{{closure}}::h87329cbdd33c79ec
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/thread/mod.rs:528:30
[INFO] [stdout]   42:     0x55bb4778ab07 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h401abbe67897d450
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   43:     0x55bb477f12a5 - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h5d7c8f150ab9c84c
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/alloc/src/boxed.rs:2015:9
[INFO] [stdout]   44:     0x55bb477f12a5 - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h570d5b005c242c15
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/alloc/src/boxed.rs:2015:9
[INFO] [stdout]   45:     0x55bb477f12a5 - std::sys::unix::thread::Thread::new::thread_start::h36b0a20c0b2361ad
[INFO] [stdout]                                at /rustc/0e09125c6c3c2fd70d7de961bcf0e51575235fad/library/std/src/sys/unix/thread.rs:108:17
[INFO] [stdout]   46:     0x7f30ffd4cac3 - <unknown>
[INFO] [stdout]   47:     0x7f30ffdddbf4 - __clone
[INFO] [stdout]   48:                0x0 - <unknown>
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout]     dynamic_programming::word_break::tests::word_break_test::case_1
[INFO] [stdout] 
[INFO] [stdout] test result: FAILED. 43 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 4.69s
[INFO] [stdout] 
[INFO] [stderr] error: test failed, to rerun pass `--bin scripts`
[INFO] running `Command { std: "docker" "inspect" "0c69bdcb82bfa58e452e70055218e7b3b7d3cd92d6ccbec128edf4fba940ca96", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0c69bdcb82bfa58e452e70055218e7b3b7d3cd92d6ccbec128edf4fba940ca96", kill_on_drop: false }`
[INFO] [stdout] 0c69bdcb82bfa58e452e70055218e7b3b7d3cd92d6ccbec128edf4fba940ca96
