[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 beta-2026-01-20 for beta-1.94-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faditya2337%2Flearn-algorithms" "/workspace/builds/worker-4-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc2/source'...
[INFO] [stderr] done.
[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-4-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/aditya2337/learn-algorithms on toolchain beta-2026-01-20
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2026-01-20" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[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-2026-01-20" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:98afbf2d16093dec2546ff8915fddc74e65664aa03fc460b3712b1c2c54a33e4" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2026-01-20" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 0f300a92d0992b2735f539b155ce0d0752db4f0f941682a074290b2ef0ce225d
[INFO] running `Command { std: "docker" "start" "-a" "0f300a92d0992b2735f539b155ce0d0752db4f0f941682a074290b2ef0ce225d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "0f300a92d0992b2735f539b155ce0d0752db4f0f941682a074290b2ef0ce225d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0f300a92d0992b2735f539b155ce0d0752db4f0f941682a074290b2ef0ce225d", kill_on_drop: false }`
[INFO] [stdout] 0f300a92d0992b2735f539b155ce0d0752db4f0f941682a074290b2ef0ce225d
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:98afbf2d16093dec2546ff8915fddc74e65664aa03fc460b3712b1c2c54a33e4" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2026-01-20" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f1231b94d875c848b1bad76292a0e6df07407c6b1ba0d665abc5706fe427b23f
[INFO] running `Command { std: "docker" "start" "-a" "f1231b94d875c848b1bad76292a0e6df07407c6b1ba0d665abc5706fe427b23f", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.59
[INFO] [stderr]    Compiling unicode-ident v1.0.9
[INFO] [stderr]    Compiling quote v1.0.28
[INFO] [stderr]    Compiling semver v1.0.17
[INFO] [stderr]    Compiling syn v1.0.109
[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-util 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)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem` and `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)]` (part of `#[warn(unused)]`) 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)]` (part of `#[warn(unused)]`) 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)]` (part of `#[warn(unused)]`) 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: struct `BinaryTree` is never constructed
[INFO] [stdout]  --> src/binary_tree/types.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct BinaryTree<T> {
[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: struct `Node` is never constructed
[INFO] [stdout]   --> src/binary_tree/types.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub struct Node<T> {
[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: type alias `Link` is never used
[INFO] [stdout]   --> src/binary_tree/types.rs:48:10
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub type Link<T> = Option<Box<Node<T>>>;
[INFO] [stdout]    |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinarySearchTree` is never constructed
[INFO] [stdout]  --> src/binary_tree/BST.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct BinarySearchTree {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[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: type alias `Link` is never used
[INFO] [stdout]  --> src/binary_tree/AVL_tree.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Link = Option<Box<AVLNode>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `AVLNode` is never constructed
[INFO] [stdout]  --> src/binary_tree/AVL_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct AVLNode {
[INFO] [stdout]   |        ^^^^^^^
[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: struct `AVLTree` is never constructed
[INFO] [stdout]    --> src/binary_tree/AVL_tree.rs:101:8
[INFO] [stdout]     |
[INFO] [stdout] 101 | struct AVLTree {
[INFO] [stdout]     |        ^^^^^^^
[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: struct `MinHeap` is never constructed
[INFO] [stdout]  --> src/heap.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct MinHeap {
[INFO] [stdout]   |            ^^^^^^^
[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: type alias `Link` is never used
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Link<T> = Option<Rc<RefCell<Node<T>>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DoublyLinkedList` is never constructed
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct DoublyLinkedList<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[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: struct `Node` is never constructed
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:92:8
[INFO] [stdout]    |
[INFO] [stdout] 92 | struct Node<T> {
[INFO] [stdout]    |        ^^^^
[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: type alias `Link` is never used
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Link<T> = Option<Box<Node<T>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ^^^^
[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: struct `LinkedList` is never constructed
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct LinkedList<T> {
[INFO] [stdout]    |            ^^^^^^^^^^
[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: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_lists/merge_linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[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: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_lists/reverse_linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct 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: struct `Point` is never constructed
[INFO] [stdout]  --> src/path_finding.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct Point {
[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: type alias `Link` is never used
[INFO] [stdout]  --> src/queue.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Link<T> = Option<Box<Node<T>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/queue.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ^^^^
[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: struct `Queue` is never constructed
[INFO] [stdout]   --> src/queue.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct Queue<T> {
[INFO] [stdout]    |            ^^^^^
[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: struct `Heap` is never constructed
[INFO] [stdout]  --> src/sorting/heap_sort.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Heap {
[INFO] [stdout]   |        ^^^^
[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)]` (part of `#[warn(nonstandard_style)]`) 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] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 12.44s
[INFO] running `Command { std: "docker" "inspect" "f1231b94d875c848b1bad76292a0e6df07407c6b1ba0d665abc5706fe427b23f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f1231b94d875c848b1bad76292a0e6df07407c6b1ba0d665abc5706fe427b23f", kill_on_drop: false }`
[INFO] [stdout] f1231b94d875c848b1bad76292a0e6df07407c6b1ba0d665abc5706fe427b23f
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:98afbf2d16093dec2546ff8915fddc74e65664aa03fc460b3712b1c2c54a33e4" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2026-01-20" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] c598c82c85d62ee6fa19f2df6e73ca0c5962faee38e7cc5e7fcd720e64b51157
[INFO] running `Command { std: "docker" "start" "-a" "c598c82c85d62ee6fa19f2df6e73ca0c5962faee38e7cc5e7fcd720e64b51157", 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)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem` and `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)]` (part of `#[warn(unused)]`) 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)]` (part of `#[warn(unused)]`) 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)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `height` is never read
[INFO] [stdout]  --> src/binary_tree/types.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct BinaryTree<T> {
[INFO] [stdout]   |            ---------- field in this struct
[INFO] [stdout] 5 |     pub height: usize,
[INFO] [stdout]   |         ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `BinaryTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) 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] 
[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: type alias `Link` is never used
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Link<T> = Option<Rc<RefCell<Node<T>>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DoublyLinkedList` is never constructed
[INFO] [stdout]  --> src/linked_lists/doubly_linked_list.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct DoublyLinkedList<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[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: struct `Node` is never constructed
[INFO] [stdout]   --> src/linked_lists/doubly_linked_list.rs:92:8
[INFO] [stdout]    |
[INFO] [stdout] 92 | struct Node<T> {
[INFO] [stdout]    |        ^^^^
[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: type alias `Link` is never used
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Link<T> = Option<Box<Node<T>>>;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/linked_lists/linked_lists.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Node<T> {
[INFO] [stdout]   |            ^^^^
[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: struct `LinkedList` is never constructed
[INFO] [stdout]   --> src/linked_lists/linked_lists.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct LinkedList<T> {
[INFO] [stdout]    |            ^^^^^^^^^^
[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)]` (part of `#[warn(nonstandard_style)]`) 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] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.99s
[INFO] running `Command { std: "docker" "inspect" "c598c82c85d62ee6fa19f2df6e73ca0c5962faee38e7cc5e7fcd720e64b51157", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "c598c82c85d62ee6fa19f2df6e73ca0c5962faee38e7cc5e7fcd720e64b51157", kill_on_drop: false }`
[INFO] [stdout] c598c82c85d62ee6fa19f2df6e73ca0c5962faee38e7cc5e7fcd720e64b51157
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:98afbf2d16093dec2546ff8915fddc74e65664aa03fc460b3712b1c2c54a33e4" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2026-01-20" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 66ced96a471f37dfa7b22bcfdd09ae20e511d8a49e4e1d9a603a81f31a87bbff
[INFO] running `Command { std: "docker" "start" "-a" "66ced96a471f37dfa7b22bcfdd09ae20e511d8a49e4e1d9a603a81f31a87bbff", 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)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `mem` and `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)]` (part of `#[warn(unused)]`) 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)]` (part of `#[warn(unused)]`) 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)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: field `height` is never read
[INFO] [stderr]  --> src/binary_tree/types.rs:5:9
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub struct BinaryTree<T> {
[INFO] [stderr]   |            ---------- field in this struct
[INFO] [stderr] 5 |     pub height: usize,
[INFO] [stderr]   |         ^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `BinaryTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) 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] 
[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: type alias `Link` is never used
[INFO] [stderr]  --> src/linked_lists/doubly_linked_list.rs:3:6
[INFO] [stderr]   |
[INFO] [stderr] 3 | type Link<T> = Option<Rc<RefCell<Node<T>>>>;
[INFO] [stderr]   |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `DoublyLinkedList` is never constructed
[INFO] [stderr]  --> src/linked_lists/doubly_linked_list.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct DoublyLinkedList<T> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^
[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: struct `Node` is never constructed
[INFO] [stderr]   --> src/linked_lists/doubly_linked_list.rs:92:8
[INFO] [stderr]    |
[INFO] [stderr] 92 | struct Node<T> {
[INFO] [stderr]    |        ^^^^
[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: type alias `Link` is never used
[INFO] [stderr]  --> src/linked_lists/linked_lists.rs:3:6
[INFO] [stderr]   |
[INFO] [stderr] 3 | type Link<T> = Option<Box<Node<T>>>;
[INFO] [stderr]   |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Node` is never constructed
[INFO] [stderr]  --> src/linked_lists/linked_lists.rs:6:12
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct Node<T> {
[INFO] [stderr]   |            ^^^^
[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: struct `LinkedList` is never constructed
[INFO] [stderr]   --> src/linked_lists/linked_lists.rs:18:12
[INFO] [stderr]    |
[INFO] [stderr] 18 | pub struct LinkedList<T> {
[INFO] [stderr]    |            ^^^^^^^^^^
[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)]` (part of `#[warn(nonstandard_style)]`) 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 31 warnings (run `cargo fix --bin "scripts" -p scripts --tests` to apply 6 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.06s
[INFO] [stderr]      Running unittests src/main.rs (/opt/rustwide/target/debug/deps/scripts-0c4101d002df7dc6)
[INFO] [stdout] 
[INFO] [stdout] running 44 tests
[INFO] [stdout] test binary_tree::BST::tests::bst ... ok
[INFO] [stdout] test binary_tree::breadth_first_traversal::tests::breadth_first ... 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_1 ... 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_3 ... 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_2 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_1 ... 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::coin_change::tests::coin_change_test::case_5 ... 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_4 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_1 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_3 ... ok
[INFO] [stdout] test heap::tests::test_heap ... ok
[INFO] [stdout] test linked_lists::merge_linked_list::tests::test_merge ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_2 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_2 ... 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_4 ... ok
[INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_6 ... ok
[INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_1 ... ok
[INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_3 ... ok
[INFO] [stdout] test dynamic_programming::maximum_subarray::tests::max_sub_array_test_2 ... ok
[INFO] [stdout] test sorting::heap_sort::tests::test_heap ... ok
[INFO] [stdout] test linked_lists::reverse_linked_list::tests::test_merge ... ok
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply_empty ... ok
[INFO] [stdout] test queue::tests::test_queue ... ok
[INFO] [stdout] test sorting::counting_sort::tests::test_count_sort ... 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 sorting::quick_sort::tests::test_quick_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 dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_1 ... ok
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply ... ok
[INFO] [stdout] test path_finding::tests::test_path_finder ... ok
[INFO] [stdout] test binary_tree::AVL_tree::tests::test_avl ... ok
[INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply_wrong_size - should panic ... ok
[INFO] [stdout] test dynamic_programming::word_break::tests::word_break_test::case_1 ... FAILED
[INFO] [stdout] test dynamic_programming::rod_cutting::tests::test_rod_cut ... ok
[INFO] [stderr] error: test failed, to rerun pass `--bin scripts`
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout] 
[INFO] [stdout] ---- dynamic_programming::word_break::tests::word_break_test::case_1 stdout ----
[INFO] [stdout] 
[INFO] [stdout] thread 'dynamic_programming::word_break::tests::word_break_test::case_1' (53) 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:     0x56da42167a92 - std::backtrace_rs::backtrace::libunwind::trace::hf0bd46b30bc61685
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/../../backtrace/src/backtrace/libunwind.rs:117:9
[INFO] [stdout]    1:     0x56da42167a92 - std::backtrace_rs::backtrace::trace_unsynchronized::h1d1fbb72ad89d7b7
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/../../backtrace/src/backtrace/mod.rs:66:14
[INFO] [stdout]    2:     0x56da42167a92 - std::sys::backtrace::_print_fmt::he38b6f68ca847f47
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/sys/backtrace.rs:74:9
[INFO] [stdout]    3:     0x56da42167a92 - <std::sys::backtrace::BacktraceLock::print::DisplayBacktrace as core::fmt::Display>::fmt::hb7e843cde1bc81a3
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/sys/backtrace.rs:44:26
[INFO] [stdout]    4:     0x56da42177aea - core::fmt::rt::Argument::fmt::hc1dd77ac64f2688c
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/fmt/rt.rs:152:76
[INFO] [stdout]    5:     0x56da42177aea - core::fmt::write::h952c506e2dbe9cff
[INFO] [stdout]    6:     0x56da42136a16 - std::io::default_write_fmt::hd23bd8145c03a23a
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/io/mod.rs:639:11
[INFO] [stdout]    7:     0x56da42136a16 - std::io::Write::write_fmt::hdd3314a2bd8a34bd
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/io/mod.rs:1994:13
[INFO] [stdout]    8:     0x56da42146f79 - std::sys::backtrace::BacktraceLock::print::h1079b82381c2c252
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/sys/backtrace.rs:47:9
[INFO] [stdout]    9:     0x56da42146f79 - std::panicking::default_hook::{{closure}}::h85cb76b8462c00f2
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:292:27
[INFO] [stdout]   10:     0x56da42146e11 - std::panicking::default_hook::h0134d220cc034c02
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:316:9
[INFO] [stdout]   11:     0x56da4210aaae - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::hb2e68dca3970e3ca
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/alloc/src/boxed.rs:2220:9
[INFO] [stdout]   12:     0x56da4210aaae - test::test_main_with_exit_callback::{{closure}}::ha7ec2063a2565ec3
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/test/src/lib.rs:145:21
[INFO] [stdout]   13:     0x56da421471f2 - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::haebee478d0f56cf4
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/alloc/src/boxed.rs:2220:9
[INFO] [stdout]   14:     0x56da421471f2 - std::panicking::panic_with_hook::h8119b6db1fef734f
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:833:13
[INFO] [stdout]   15:     0x56da42147038 - std::panicking::panic_handler::{{closure}}::h24f5360b91482c0e
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:698:13
[INFO] [stdout]   16:     0x56da421425c9 - std::sys::backtrace::__rust_end_short_backtrace::h4e60c5cbd1bd0108
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/sys/backtrace.rs:182:18
[INFO] [stdout]   17:     0x56da4212b60d - __rustc[e4c6931bd8050421]::rust_begin_unwind
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:689:5
[INFO] [stdout]   18:     0x56da4217f09c - core::panicking::panic_fmt::hb1614a3ff6840071
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/panicking.rs:80:14
[INFO] [stdout]   19:     0x56da4217ef53 - core::panicking::assert_failed_inner::h5aabe811ef142622
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/panicking.rs:439:17
[INFO] [stdout]   20:     0x56da420d8f8c - core::panicking::assert_failed::h965f59e3e4d9a6c4
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/panicking.rs:394:5
[INFO] [stdout]   21:     0x56da420e3b79 - scripts::dynamic_programming::word_break::tests::word_break_test::h13e9878d0b9ecc39
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:36:9
[INFO] [stdout]   22:     0x56da420d575c - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::h4b9aa3589b88aeea
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:5
[INFO] [stdout]   23:     0x56da420d57b7 - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::{{closure}}::h32d85fe8dfb28617
[INFO] [stdout]                                at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:14
[INFO] [stdout]   24:     0x56da420d7556 - core::ops::function::FnOnce::call_once::h7553696fae36ee86
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   25:     0x56da4210a8ab - core::ops::function::FnOnce::call_once::hefaf63600cd43d2a
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   26:     0x56da4210a8ab - test::__rust_begin_short_backtrace::he30322a73a0e9ea6
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/test/src/lib.rs:663:18
[INFO] [stdout]   27:     0x56da4211e27a - test::run_test_in_process::{{closure}}::hdea3ab8d0243ef36
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/test/src/lib.rs:686:74
[INFO] [stdout]   28:     0x56da4211e27a - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h66d192f42498ffce
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/panic/unwind_safe.rs:274:9
[INFO] [stdout]   29:     0x56da4211e27a - std::panicking::catch_unwind::do_call::h822e18e8d3a6bb65
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:581:40
[INFO] [stdout]   30:     0x56da4211e27a - std::panicking::catch_unwind::h54b1de7ceab578bf
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:544:19
[INFO] [stdout]   31:     0x56da4211e27a - std::panic::catch_unwind::h60c29b7a9d0246b1
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panic.rs:359:14
[INFO] [stdout]   32:     0x56da4211e27a - test::run_test_in_process::h6099b5f871379b13
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/test/src/lib.rs:686:27
[INFO] [stdout]   33:     0x56da4211e27a - test::run_test::{{closure}}::h926ce0a38281a4c8
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/test/src/lib.rs:607:43
[INFO] [stdout]   34:     0x56da420f86d4 - test::run_test::{{closure}}::h508de21a9afc7140
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/test/src/lib.rs:637:41
[INFO] [stdout]   35:     0x56da420f86d4 - std::sys::backtrace::__rust_begin_short_backtrace::h6e2f5c39ca00735a
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/sys/backtrace.rs:166:18
[INFO] [stdout]   36:     0x56da420fbf92 - std::thread::lifecycle::spawn_unchecked::{{closure}}::{{closure}}::h133e44f0e5802c14
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/thread/lifecycle.rs:91:13
[INFO] [stdout]   37:     0x56da420fbf92 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h4718c1285283955c
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/panic/unwind_safe.rs:274:9
[INFO] [stdout]   38:     0x56da420fbf92 - std::panicking::catch_unwind::do_call::h0bba3937b4892238
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:581:40
[INFO] [stdout]   39:     0x56da420fbf92 - std::panicking::catch_unwind::h5b31cab5fb8c5d7f
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panicking.rs:544:19
[INFO] [stdout]   40:     0x56da420fbf92 - std::panic::catch_unwind::hb2fa05d52ed0124e
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/panic.rs:359:14
[INFO] [stdout]   41:     0x56da420fbf92 - std::thread::lifecycle::spawn_unchecked::{{closure}}::hf401cf5ff501bd29
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/thread/lifecycle.rs:89:26
[INFO] [stdout]   42:     0x56da420fbf92 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h160022e94ce3b0bb
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   43:     0x56da4213d85f - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::hf234e0d1d1d272ba
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/alloc/src/boxed.rs:2206:9
[INFO] [stdout]   44:     0x56da4213d85f - std::sys::thread::unix::Thread::new::thread_start::h106a295241840d3b
[INFO] [stdout]                                at /rustc/9b1f8ff42d110b0ca138116745be921df5dc97e7/library/std/src/sys/thread/unix.rs:127:17
[INFO] [stdout]   45:     0x7ae92253daa4 - <unknown>
[INFO] [stdout]   46:     0x7ae9225caa64 - clone
[INFO] [stdout]   47:                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 6.54s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "66ced96a471f37dfa7b22bcfdd09ae20e511d8a49e4e1d9a603a81f31a87bbff", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "66ced96a471f37dfa7b22bcfdd09ae20e511d8a49e4e1d9a603a81f31a87bbff", kill_on_drop: false }`
[INFO] [stdout] 66ced96a471f37dfa7b22bcfdd09ae20e511d8a49e4e1d9a603a81f31a87bbff
