[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-2024-12-08 for beta-1.84.0-4-retry [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-2024-12-08 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2024-12-08" "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-2024-12-08" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded rstest v0.17.0 [INFO] [stderr] Downloaded rstest_macros v0.17.0 [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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2024-12-08" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 6f2764c8a3cc5bad851290659d66d7e0a4dd173cdbce9a1d1174a42f1cf08285 [INFO] running `Command { std: "docker" "start" "-a" "6f2764c8a3cc5bad851290659d66d7e0a4dd173cdbce9a1d1174a42f1cf08285", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "6f2764c8a3cc5bad851290659d66d7e0a4dd173cdbce9a1d1174a42f1cf08285", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "6f2764c8a3cc5bad851290659d66d7e0a4dd173cdbce9a1d1174a42f1cf08285", kill_on_drop: false }` [INFO] [stdout] 6f2764c8a3cc5bad851290659d66d7e0a4dd173cdbce9a1d1174a42f1cf08285 [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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2024-12-08" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] a877a6ad1205c171dcb90350e1bd2a90fbc960a4b722209670698c66b04e0937 [INFO] running `Command { std: "docker" "start" "-a" "a877a6ad1205c171dcb90350e1bd2a90fbc960a4b722209670698c66b04e0937", 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 futures-core v0.3.28 [INFO] [stderr] Compiling semver v1.0.17 [INFO] [stderr] Compiling autocfg v1.1.0 [INFO] [stderr] Compiling memchr v2.5.0 [INFO] [stderr] Compiling futures-channel v0.3.28 [INFO] [stderr] Compiling futures-task v0.3.28 [INFO] [stderr] Compiling futures-util v0.3.28 [INFO] [stderr] Compiling futures-sink v0.3.28 [INFO] [stderr] Compiling futures-io v0.3.28 [INFO] [stderr] Compiling pin-utils v0.1.0 [INFO] [stderr] Compiling syn v1.0.109 [INFO] [stderr] Compiling slab v0.4.8 [INFO] [stderr] Compiling pin-project-lite v0.2.9 [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` 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)]` 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(head: &Link) -> Vec { [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(node: &Link, path: &mut Vec) { [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(tree: &BinaryTree) -> Vec { [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(value: Option, queue: &mut Queue) { [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 { [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 { [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] [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 BinaryTree [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 Node [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: 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) -> 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) -> &Node { [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, item: i32) -> Link { [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, 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>; [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] = 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: type alias `Link` is never used [INFO] [stdout] --> src/linked_lists/doubly_linked_list.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type Link = Option>>>; [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 { [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 DoublyLinkedList { [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 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | pub fn pop_front(&mut self) -> Option { [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 { [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 Node { [INFO] [stdout] | --------------- associated function in this implementation [INFO] [stdout] 98 | pub fn new(val: T) -> Rc> { [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 = Option>>; [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 { [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 Node { [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 { [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 LinkedList [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) -> Option> { [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>) -> Option> { [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) -> Option> { [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>, b: &Vec>) -> Vec> { [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; [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 { [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 = Option>>; [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 { [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 Node { [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 { [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 Queue { [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 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn peek(&self) -> &Link { [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, 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 { [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 { [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 { [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 { [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 { [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 { [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 { [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 { [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, 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, amount: i32, dp: &mut Vec) -> 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, 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) -> 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 { [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) -> 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) -> &'a Vec { [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) -> &Vec { [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) -> Vec { [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) { [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, 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, 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, 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, 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>; [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> { [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] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 17.94s [INFO] running `Command { std: "docker" "inspect" "a877a6ad1205c171dcb90350e1bd2a90fbc960a4b722209670698c66b04e0937", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a877a6ad1205c171dcb90350e1bd2a90fbc960a4b722209670698c66b04e0937", kill_on_drop: false }` [INFO] [stdout] a877a6ad1205c171dcb90350e1bd2a90fbc960a4b722209670698c66b04e0937 [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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2024-12-08" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] b33431a19939119545cc0a01949cb2542bbc26f3783a51fda68efbbf8ef32d59 [INFO] running `Command { std: "docker" "start" "-a" "b33431a19939119545cc0a01949cb2542bbc26f3783a51fda68efbbf8ef32d59", 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` 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)]` 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 `height` is never read [INFO] [stdout] --> src/binary_tree/types.rs:5:9 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct BinaryTree { [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)]` 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 = Option>>>; [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 { [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 DoublyLinkedList { [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 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | pub fn pop_front(&mut self) -> Option { [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 { [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 Node { [INFO] [stdout] | --------------- associated function in this implementation [INFO] [stdout] 98 | pub fn new(val: T) -> Rc> { [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 = Option>>; [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 { [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 Node { [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 { [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 LinkedList [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 { [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 { [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 { [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, amount: i32, dp: &mut Vec) -> 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) -> &'a Vec { [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) -> &Vec { [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>; [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> { [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] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 1.42s [INFO] running `Command { std: "docker" "inspect" "b33431a19939119545cc0a01949cb2542bbc26f3783a51fda68efbbf8ef32d59", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "b33431a19939119545cc0a01949cb2542bbc26f3783a51fda68efbbf8ef32d59", kill_on_drop: false }` [INFO] [stdout] b33431a19939119545cc0a01949cb2542bbc26f3783a51fda68efbbf8ef32d59 [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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2024-12-08" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 04092db9772cd0341cd1eb7aa57c20950508d2489d1c9dd7fb528d9804a28d7f [INFO] running `Command { std: "docker" "start" "-a" "04092db9772cd0341cd1eb7aa57c20950508d2489d1c9dd7fb528d9804a28d7f", 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` 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)]` 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 `height` is never read [INFO] [stderr] --> src/binary_tree/types.rs:5:9 [INFO] [stderr] | [INFO] [stderr] 4 | pub struct BinaryTree { [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)]` 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 = Option>>>; [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 { [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 DoublyLinkedList { [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 { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 70 | pub fn pop_front(&mut self) -> Option { [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 { [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 Node { [INFO] [stderr] | --------------- associated function in this implementation [INFO] [stderr] 98 | pub fn new(val: T) -> Rc> { [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 = Option>>; [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 { [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 Node { [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 { [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 LinkedList [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 { [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 { [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 { [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, amount: i32, dp: &mut Vec) -> 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) -> &'a Vec { [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) -> &Vec { [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>; [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> { [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 31 warnings (run `cargo fix --bin "scripts" --tests` to apply 5 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.05s [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/debug/deps/scripts-59e406d49054552a) [INFO] [stdout] [INFO] [stdout] running 44 tests [INFO] [stdout] test binary_tree::BST::tests::bst ... ok [INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_2 ... ok [INFO] [stdout] test binary_tree::AVL_tree::tests::test_avl ... ok [INFO] [stdout] test binary_tree::breadth_first_traversal::tests::breadth_first ... ok [INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_1 ... 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_4 ... ok [INFO] [stdout] test dynamic_programming::climbing_stairs::tests::climb_stairs_test_1::case_5 ... 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_4 ... ok [INFO] [stdout] test dynamic_programming::coin_change::tests::coin_change_test::case_2 ... ok [INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_1 ... 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_2 ... 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_5 ... 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_3 ... ok [INFO] [stdout] test dynamic_programming::longest_increasing_subsequence::tests::length_of_lis_test_1 ... 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::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 linked_lists::reverse_linked_list::tests::test_merge ... ok [INFO] [stdout] test dynamic_programming::house_robber::tests::rob_test::case_4 ... 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 heap::tests::test_heap ... ok [INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply ... ok [INFO] [stdout] test matrix_multiply::tests::test_matrix_multiply_empty ... ok [INFO] [stdout] test search_insert_pos::tests::test_search ... 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 sorting::merge_sort::tests::test_merge_sort ... ok [INFO] [stdout] test sorting::quick_sort::tests::test_quick_sort ... ok [INFO] [stdout] test sorting::heap_sort::tests::test_heap ... 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_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] [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: 0x5b767d38a11a - std::backtrace_rs::backtrace::libunwind::trace::h8810477743020387 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/../../backtrace/src/backtrace/libunwind.rs:116:5 [INFO] [stdout] 1: 0x5b767d38a11a - std::backtrace_rs::backtrace::trace_unsynchronized::h3aa55355dd6c54a6 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5 [INFO] [stdout] 2: 0x5b767d38a11a - std::sys::backtrace::_print_fmt::h8588b0f62410823f [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/sys/backtrace.rs:66:9 [INFO] [stdout] 3: 0x5b767d38a11a - ::fmt::h98c26ac25ffe89bb [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/sys/backtrace.rs:39:26 [INFO] [stdout] 4: 0x5b767d3afb83 - core::fmt::rt::Argument::fmt::hf95377f4aebd453b [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/fmt/rt.rs:177:76 [INFO] [stdout] 5: 0x5b767d3afb83 - core::fmt::write::h0dd5f6e2238c7982 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/fmt/mod.rs:1189:21 [INFO] [stdout] 6: 0x5b767d3872b3 - std::io::Write::write_fmt::h03bb0ca26e6faf8c [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/io/mod.rs:1884:15 [INFO] [stdout] 7: 0x5b767d389f62 - std::sys::backtrace::BacktraceLock::print::h5c19c1c038ee186d [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/sys/backtrace.rs:42:9 [INFO] [stdout] 8: 0x5b767d38b59d - std::panicking::default_hook::{{closure}}::h77172f079a1fcb13 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:268:22 [INFO] [stdout] 9: 0x5b767d38b3a7 - std::panicking::default_hook::he5f8e3b203ccddba [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:292:9 [INFO] [stdout] 10: 0x5b767d353f37 - as core::ops::function::Fn>::call::h7a3c7b4a1ae77f2f [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/alloc/src/boxed.rs:1986:9 [INFO] [stdout] 11: 0x5b767d353f37 - test::test_main::{{closure}}::hf0d3b69ae9b353d1 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/test/src/lib.rs:134:21 [INFO] [stdout] 12: 0x5b767d38bc48 - as core::ops::function::Fn>::call::h6332e82e7b189abd [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/alloc/src/boxed.rs:1986:9 [INFO] [stdout] 13: 0x5b767d38bc48 - std::panicking::rust_panic_with_hook::h53863d4e9018df39 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:809:13 [INFO] [stdout] 14: 0x5b767d38ba0a - std::panicking::begin_panic_handler::{{closure}}::h67280e6fa0757873 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:674:13 [INFO] [stdout] 15: 0x5b767d38a5f9 - std::sys::backtrace::__rust_end_short_backtrace::h1dac3f54d6fbbeb2 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/sys/backtrace.rs:170:18 [INFO] [stdout] 16: 0x5b767d38b69c - rust_begin_unwind [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:665:5 [INFO] [stdout] 17: 0x5b767d2feaa0 - core::panicking::panic_fmt::h6792bd1b2bf01041 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/panicking.rs:76:14 [INFO] [stdout] 18: 0x5b767d2fee6b - core::panicking::assert_failed_inner::hf2c17e6d30928787 [INFO] [stdout] 19: 0x5b767d304978 - core::panicking::assert_failed::h6045a33fff50692d [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/panicking.rs:373:5 [INFO] [stdout] 20: 0x5b767d30fc5a - scripts::dynamic_programming::word_break::tests::word_break_test::h7a9930e554a3e02c [INFO] [stdout] at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:36:9 [INFO] [stdout] 21: 0x5b767d308a40 - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::h3f6cf0ea1e2040f2 [INFO] [stdout] at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:5 [INFO] [stdout] 22: 0x5b767d308887 - scripts::dynamic_programming::word_break::tests::word_break_test::case_1::{{closure}}::he4c3fb7494aa6501 [INFO] [stdout] at /opt/rustwide/workdir/src/dynamic_programming/word_break.rs:29:14 [INFO] [stdout] 23: 0x5b767d302c16 - core::ops::function::FnOnce::call_once::h0e6e30153e009108 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 24: 0x5b767d358a5b - core::ops::function::FnOnce::call_once::h871bf86719ec9aa4 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 25: 0x5b767d358a5b - test::__rust_begin_short_backtrace::h2167df1e2b7d76fd [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/test/src/lib.rs:632:18 [INFO] [stdout] 26: 0x5b767d358448 - test::run_test_in_process::{{closure}}::h15d92f75a3adfb79 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/test/src/lib.rs:655:60 [INFO] [stdout] 27: 0x5b767d358448 - as core::ops::function::FnOnce<()>>::call_once::hb6c8955835a8dbbb [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 28: 0x5b767d358448 - std::panicking::try::do_call::hc79d0fc888a0bd30 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:557:40 [INFO] [stdout] 29: 0x5b767d358448 - std::panicking::try::hb8a7878e3a8589d6 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:520:19 [INFO] [stdout] 30: 0x5b767d358448 - std::panic::catch_unwind::hb8e4600ff0ff5cfa [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panic.rs:358:14 [INFO] [stdout] 31: 0x5b767d358448 - test::run_test_in_process::hc2900b0b18688dd6 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/test/src/lib.rs:655:27 [INFO] [stdout] 32: 0x5b767d358448 - test::run_test::{{closure}}::hac2a9cb07be3d48d [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/test/src/lib.rs:576:43 [INFO] [stdout] 33: 0x5b767d31beea - test::run_test::{{closure}}::h4a5b729e66a38cd8 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/test/src/lib.rs:606:41 [INFO] [stdout] 34: 0x5b767d31beea - std::sys::backtrace::__rust_begin_short_backtrace::h0496fb742492f573 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/sys/backtrace.rs:154:18 [INFO] [stdout] 35: 0x5b767d31f864 - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::hbb6d257c550a54bd [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/thread/mod.rs:561:17 [INFO] [stdout] 36: 0x5b767d31f864 - as core::ops::function::FnOnce<()>>::call_once::h46696fe4a6832328 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 37: 0x5b767d31f864 - std::panicking::try::do_call::h2625a51b667bfb64 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:557:40 [INFO] [stdout] 38: 0x5b767d31f864 - std::panicking::try::hb956a59a1973aa4c [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panicking.rs:520:19 [INFO] [stdout] 39: 0x5b767d31f864 - std::panic::catch_unwind::h64f3b9d1067ef6a0 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/panic.rs:358:14 [INFO] [stdout] 40: 0x5b767d31f864 - std::thread::Builder::spawn_unchecked_::{{closure}}::h42b2841295b6c0b2 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/thread/mod.rs:559:30 [INFO] [stdout] 41: 0x5b767d31f864 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h6127de71b8124639 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 42: 0x5b767d38fb8b - as core::ops::function::FnOnce>::call_once::h42f0ba71002a1b2c [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/alloc/src/boxed.rs:1972:9 [INFO] [stdout] 43: 0x5b767d38fb8b - as core::ops::function::FnOnce>::call_once::had9e47d7a3dcecb8 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/alloc/src/boxed.rs:1972:9 [INFO] [stdout] 44: 0x5b767d38fb8b - std::sys::pal::unix::thread::Thread::new::thread_start::h48cf765408f6f5f2 [INFO] [stdout] at /rustc/202008a1b8de96d2e5b6bc02d379db03a877d34d/library/std/src/sys/pal/unix/thread.rs:105:17 [INFO] [stdout] 45: 0x7a0883191ac3 - [INFO] [stdout] 46: 0x7a0883222a04 - clone [INFO] [stdout] 47: 0x0 - [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 7.84s [INFO] [stdout] [INFO] [stderr] error: test failed, to rerun pass `--bin scripts` [INFO] running `Command { std: "docker" "inspect" "04092db9772cd0341cd1eb7aa57c20950508d2489d1c9dd7fb528d9804a28d7f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "04092db9772cd0341cd1eb7aa57c20950508d2489d1c9dd7fb528d9804a28d7f", kill_on_drop: false }` [INFO] [stdout] 04092db9772cd0341cd1eb7aa57c20950508d2489d1c9dd7fb528d9804a28d7f