[INFO] cloning repository https://github.com/hunterlester/rusty_algo_structs [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/hunterlester/rusty_algo_structs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 5f421d0712e9f3f331c12c9b41152ad4561c7c4e [INFO] testing hunterlester/rusty_algo_structs against 1.84.0 for beta-1.85-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs" "/workspace/builds/worker-5-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/hunterlester/rusty_algo_structs on toolchain 1.84.0 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.84.0" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/hunterlester/rusty_algo_structs [INFO] finished tweaking git repo https://github.com/hunterlester/rusty_algo_structs [INFO] tweaked toml for git repo https://github.com/hunterlester/rusty_algo_structs written to /workspace/builds/worker-5-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/hunterlester/rusty_algo_structs already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.84.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded criterion-plot v0.4.1 [INFO] [stderr] Downloaded oorandom v11.1.0 [INFO] [stderr] Downloaded tinytemplate v1.0.3 [INFO] [stderr] Downloaded criterion v0.3.1 [INFO] [stderr] Downloaded plotters v0.2.12 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 7bf604b0dcd5bf23a587174ff0c13a28d821920ba2d62e036957b0cd79b32b75 [INFO] running `Command { std: "docker" "start" "-a" "7bf604b0dcd5bf23a587174ff0c13a28d821920ba2d62e036957b0cd79b32b75", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "7bf604b0dcd5bf23a587174ff0c13a28d821920ba2d62e036957b0cd79b32b75", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "7bf604b0dcd5bf23a587174ff0c13a28d821920ba2d62e036957b0cd79b32b75", kill_on_drop: false }` [INFO] [stdout] 7bf604b0dcd5bf23a587174ff0c13a28d821920ba2d62e036957b0cd79b32b75 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] f747db6cc946147ef89e1992160056d08c3da8de0739925906aeaee5e0066875 [INFO] running `Command { std: "docker" "start" "-a" "f747db6cc946147ef89e1992160056d08c3da8de0739925906aeaee5e0066875", kill_on_drop: false }` [INFO] [stderr] Compiling autocfg v1.0.0 [INFO] [stderr] Compiling semver-parser v0.7.0 [INFO] [stderr] Compiling lazy_static v1.4.0 [INFO] [stderr] Compiling serde v1.0.104 [INFO] [stderr] Compiling cfg-if v0.1.10 [INFO] [stderr] Compiling maybe-uninit v2.0.0 [INFO] [stderr] Compiling libc v0.2.67 [INFO] [stderr] Compiling ryu v1.0.2 [INFO] [stderr] Compiling memchr v2.3.3 [INFO] [stderr] Compiling byteorder v1.3.4 [INFO] [stderr] Compiling proc-macro2 v1.0.9 [INFO] [stderr] Compiling unicode-xid v0.2.0 [INFO] [stderr] Compiling scopeguard v1.1.0 [INFO] [stderr] Compiling either v1.5.3 [INFO] [stderr] Compiling itoa v0.4.5 [INFO] [stderr] Compiling bitflags v1.2.1 [INFO] [stderr] Compiling rayon-core v1.7.0 [INFO] [stderr] Compiling syn v1.0.16 [INFO] [stderr] Compiling unicode-width v0.1.7 [INFO] [stderr] Compiling regex-syntax v0.6.16 [INFO] [stderr] Compiling same-file v1.0.6 [INFO] [stderr] Compiling semver v0.9.0 [INFO] [stderr] Compiling itertools v0.8.2 [INFO] [stderr] Compiling textwrap v0.11.0 [INFO] [stderr] Compiling rustc_version v0.2.3 [INFO] [stderr] Compiling walkdir v2.3.1 [INFO] [stderr] Compiling oorandom v11.1.0 [INFO] [stderr] Compiling csv-core v0.1.10 [INFO] [stderr] Compiling clap v2.33.0 [INFO] [stderr] Compiling crossbeam-utils v0.7.2 [INFO] [stderr] Compiling crossbeam-epoch v0.8.2 [INFO] [stderr] Compiling num-traits v0.2.11 [INFO] [stderr] Compiling memoffset v0.5.3 [INFO] [stderr] Compiling cast v0.2.3 [INFO] [stderr] Compiling regex-automata v0.1.8 [INFO] [stderr] Compiling num_cpus v1.12.0 [INFO] [stderr] Compiling atty v0.2.14 [INFO] [stderr] Compiling quote v1.0.2 [INFO] [stderr] Compiling crossbeam-queue v0.2.1 [INFO] [stderr] Compiling criterion-plot v0.4.1 [INFO] [stderr] Compiling regex v1.3.4 [INFO] [stderr] Compiling crossbeam-deque v0.7.3 [INFO] [stderr] Compiling plotters v0.2.12 [INFO] [stderr] Compiling rayon v1.3.0 [INFO] [stderr] Compiling serde_json v1.0.48 [INFO] [stderr] Compiling bstr v0.2.11 [INFO] [stderr] Compiling csv v1.1.3 [INFO] [stderr] Compiling tinytemplate v1.0.3 [INFO] [stderr] Compiling serde_derive v1.0.104 [INFO] [stderr] Compiling criterion v0.3.1 [INFO] [stderr] Compiling rusty_algo_structs v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `linked_lists::*` [INFO] [stdout] --> src/data_structures/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use linked_lists::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `bubble_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use bubble_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `insertion_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | pub use insertion_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `selection_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | pub use selection_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `merge_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use merge_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [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: struct `ListNode` is never constructed [INFO] [stdout] --> src/data_structures/linked_lists.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_linked_list` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn build_linked_list(mut array: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `revserse_list` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `swap_pairs` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:36:4 [INFO] [stdout] | [INFO] [stdout] 36 | fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/bubble_sort.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn bubble_sort(array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/insertion_sort.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn insertion_sort(array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/selection_sort.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn selection_sort(array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/algorithms/sorting/merge_sort.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn merge(sub_array_1: Vec, sub_array_2: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/merge_sort.rs:31:4 [INFO] [stdout] | [INFO] [stdout] 31 | fn merge_sort(array: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_row` is never used [INFO] [stdout] --> src/algorithms/pascal_triangle.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn get_row(row_index: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `linked_lists::*` [INFO] [stdout] --> src/data_structures/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use linked_lists::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `binary_tree::*` [INFO] [stdout] --> src/data_structures/mod.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | pub use binary_tree::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BinarySearchTree` [INFO] [stdout] --> src/data_structures/mod.rs:8:30 [INFO] [stdout] | [INFO] [stdout] 8 | pub use binary_search_tree::{BinarySearchTree}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `IterativeBinarySearchTree` [INFO] [stdout] --> src/data_structures/mod.rs:9:40 [INFO] [stdout] | [INFO] [stdout] 9 | pub use binary_search_tree_iterative::{IterativeBinarySearchTree}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [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: struct `BinaryTreeNode` is never constructed [INFO] [stdout] --> src/data_structures/binary_tree.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct BinaryTreeNode { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BinaryTreeNode` 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: multiple associated items are never used [INFO] [stdout] --> src/data_structures/binary_tree.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl BinaryTreeNode { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 12 | pub fn new(value: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn insert_left(&mut self, value: Option) -> () { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn insert_right(&mut self, value: Option) -> () { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn insert(&mut self, value: Option) -> () { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn inorder_traverse(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | pub fn preorder_traverse(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | pub fn postorder_traverse(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/binary_search_tree.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl BinarySearchTree { [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 15 | pub fn new(value: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn insert(&mut self, value: i32) -> () { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn inorder(&self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn preorder(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | pub fn postorder(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | pub fn delete(&mut self, id: i32) -> () { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | pub fn exists(&self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | pub fn build_bst(array: &Vec>, index: usize) -> PotentialNode { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `preorder`, `inorder`, `postorder`, and `bfs` are never used [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl IterativeBinarySearchTree { [INFO] [stdout] | ------------------------------ associated items in this implementation [INFO] [stdout] 15 | pub fn new(value: i32) -> PotentialNode { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn insert(root: Rc>, value: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn preorder(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn inorder(&self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | pub fn postorder(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | pub fn bfs(&self) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/data_structures/linked_lists.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_linked_list` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn build_linked_list(mut array: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `revserse_list` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `swap_pairs` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:36:4 [INFO] [stdout] | [INFO] [stdout] 36 | fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 15.11s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: criterion v0.3.1 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1` [INFO] running `Command { std: "docker" "inspect" "f747db6cc946147ef89e1992160056d08c3da8de0739925906aeaee5e0066875", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "f747db6cc946147ef89e1992160056d08c3da8de0739925906aeaee5e0066875", kill_on_drop: false }` [INFO] [stdout] f747db6cc946147ef89e1992160056d08c3da8de0739925906aeaee5e0066875 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 0bc18a7064820b7aa6340a08225b937ae4e0caf8d2567a6de91b70adbae40c1d [INFO] running `Command { std: "docker" "start" "-a" "0bc18a7064820b7aa6340a08225b937ae4e0caf8d2567a6de91b70adbae40c1d", kill_on_drop: false }` [INFO] [stdout] warning: unused import: `linked_lists::*` [INFO] [stdout] --> src/data_structures/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use linked_lists::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `bubble_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use bubble_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `insertion_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | pub use insertion_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling rusty_algo_structs v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `selection_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | pub use selection_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `merge_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use merge_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [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: struct `ListNode` is never constructed [INFO] [stdout] --> src/data_structures/linked_lists.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_linked_list` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn build_linked_list(mut array: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `revserse_list` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `swap_pairs` is never used [INFO] [stdout] --> src/data_structures/linked_lists.rs:36:4 [INFO] [stdout] | [INFO] [stdout] 36 | fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/bubble_sort.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn bubble_sort(array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/insertion_sort.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn insertion_sort(array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/selection_sort.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn selection_sort(array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/algorithms/sorting/merge_sort.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn merge(sub_array_1: Vec, sub_array_2: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/algorithms/sorting/merge_sort.rs:31:4 [INFO] [stdout] | [INFO] [stdout] 31 | fn merge_sort(array: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_row` is never used [INFO] [stdout] --> src/algorithms/pascal_triangle.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn get_row(row_index: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ListNode` [INFO] [stdout] --> src/data_structures/linked_lists.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | use super::{ListNode, revserse_list, build_linked_list, swap_pairs}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `linked_lists::*` [INFO] [stdout] --> src/data_structures/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use linked_lists::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `binary_tree::*` [INFO] [stdout] --> src/data_structures/mod.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | pub use binary_tree::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BinarySearchTree` [INFO] [stdout] --> src/data_structures/mod.rs:8:30 [INFO] [stdout] | [INFO] [stdout] 8 | pub use binary_search_tree::{BinarySearchTree}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `IterativeBinarySearchTree` [INFO] [stdout] --> src/data_structures/mod.rs:9:40 [INFO] [stdout] | [INFO] [stdout] 9 | pub use binary_search_tree_iterative::{IterativeBinarySearchTree}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ListNode` [INFO] [stdout] --> src/data_structures/linked_lists.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | use super::{ListNode, revserse_list, build_linked_list, swap_pairs}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `linked_lists::*` [INFO] [stdout] --> src/data_structures/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use linked_lists::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `bubble_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | pub use bubble_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `insertion_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | pub use insertion_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `selection_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | pub use selection_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `merge_sort::*` [INFO] [stdout] --> src/algorithms/sorting/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use merge_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:130:13 [INFO] [stdout] | [INFO] [stdout] 130 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:142:13 [INFO] [stdout] | [INFO] [stdout] 142 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:154:13 [INFO] [stdout] | [INFO] [stdout] 154 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:166:13 [INFO] [stdout] | [INFO] [stdout] 166 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:178:13 [INFO] [stdout] | [INFO] [stdout] 178 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:130:13 [INFO] [stdout] | [INFO] [stdout] 130 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:142:13 [INFO] [stdout] | [INFO] [stdout] 142 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:154:13 [INFO] [stdout] | [INFO] [stdout] 154 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:166:13 [INFO] [stdout] | [INFO] [stdout] 166 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/binary_search_tree_iterative.rs:178:13 [INFO] [stdout] | [INFO] [stdout] 178 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/data_structures/linked_lists.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | fn revserse_list(mut head: Option>) -> Option> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/sorting/merge_sort.rs:49:13 [INFO] [stdout] | [INFO] [stdout] 49 | let mut array = vec![9, 8, 7, 6, 5, 4, 3, 2, 1]; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.75s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: criterion v0.3.1 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1` [INFO] running `Command { std: "docker" "inspect" "0bc18a7064820b7aa6340a08225b937ae4e0caf8d2567a6de91b70adbae40c1d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "0bc18a7064820b7aa6340a08225b937ae4e0caf8d2567a6de91b70adbae40c1d", kill_on_drop: false }` [INFO] [stdout] 0bc18a7064820b7aa6340a08225b937ae4e0caf8d2567a6de91b70adbae40c1d [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 645cd9e5c56542803dfc9fa9ad43ede46f6836e960998b04e81cab9d66bd3439 [INFO] running `Command { std: "docker" "start" "-a" "645cd9e5c56542803dfc9fa9ad43ede46f6836e960998b04e81cab9d66bd3439", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `linked_lists::*` [INFO] [stderr] --> src/data_structures/mod.rs:6:9 [INFO] [stderr] | [INFO] [stderr] 6 | pub use linked_lists::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `bubble_sort::*` [INFO] [stderr] --> src/algorithms/sorting/mod.rs:6:9 [INFO] [stderr] | [INFO] [stderr] 6 | pub use bubble_sort::*; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `insertion_sort::*` [INFO] [stderr] --> src/algorithms/sorting/mod.rs:7:9 [INFO] [stderr] | [INFO] [stderr] 7 | pub use insertion_sort::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `selection_sort::*` [INFO] [stderr] --> src/algorithms/sorting/mod.rs:8:9 [INFO] [stderr] | [INFO] [stderr] 8 | pub use selection_sort::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `merge_sort::*` [INFO] [stderr] --> src/algorithms/sorting/mod.rs:9:9 [INFO] [stderr] | [INFO] [stderr] 9 | pub use merge_sort::*; [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/data_structures/linked_lists.rs:23:18 [INFO] [stderr] | [INFO] [stderr] 23 | fn revserse_list(mut head: Option>) -> Option> { [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: struct `ListNode` is never constructed [INFO] [stderr] --> src/data_structures/linked_lists.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | struct ListNode { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `build_linked_list` is never used [INFO] [stderr] --> src/data_structures/linked_lists.rs:9:4 [INFO] [stderr] | [INFO] [stderr] 9 | fn build_linked_list(mut array: Vec) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `revserse_list` is never used [INFO] [stderr] --> src/data_structures/linked_lists.rs:23:4 [INFO] [stderr] | [INFO] [stderr] 23 | fn revserse_list(mut head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `swap_pairs` is never used [INFO] [stderr] --> src/data_structures/linked_lists.rs:36:4 [INFO] [stderr] | [INFO] [stderr] 36 | fn swap_pairs(head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `bubble_sort` is never used [INFO] [stderr] --> src/algorithms/sorting/bubble_sort.rs:2:8 [INFO] [stderr] | [INFO] [stderr] 2 | pub fn bubble_sort(array: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `insertion_sort` is never used [INFO] [stderr] --> src/algorithms/sorting/insertion_sort.rs:2:4 [INFO] [stderr] | [INFO] [stderr] 2 | fn insertion_sort(array: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `selection_sort` is never used [INFO] [stderr] --> src/algorithms/sorting/selection_sort.rs:2:4 [INFO] [stderr] | [INFO] [stderr] 2 | fn selection_sort(array: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `merge` is never used [INFO] [stderr] --> src/algorithms/sorting/merge_sort.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn merge(sub_array_1: Vec, sub_array_2: Vec) -> Vec { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `merge_sort` is never used [INFO] [stderr] --> src/algorithms/sorting/merge_sort.rs:31:4 [INFO] [stderr] | [INFO] [stderr] 31 | fn merge_sort(array: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `get_row` is never used [INFO] [stderr] --> src/algorithms/pascal_triangle.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn get_row(row_index: i32) -> Vec { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `ListNode` [INFO] [stderr] --> src/data_structures/linked_lists.rs:58:17 [INFO] [stderr] | [INFO] [stderr] 58 | use super::{ListNode, revserse_list, build_linked_list, swap_pairs}; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `linked_lists::*` [INFO] [stderr] --> src/data_structures/mod.rs:6:9 [INFO] [stderr] | [INFO] [stderr] 6 | pub use linked_lists::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/data_structures/binary_search_tree_iterative.rs:130:13 [INFO] [stderr] | [INFO] [stderr] 130 | let mut bst = IterativeBinarySearchTree::new(10); [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: variable does not need to be mutable [INFO] [stderr] --> src/data_structures/binary_search_tree_iterative.rs:142:13 [INFO] [stderr] | [INFO] [stderr] 142 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/data_structures/binary_search_tree_iterative.rs:154:13 [INFO] [stderr] | [INFO] [stderr] 154 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/data_structures/binary_search_tree_iterative.rs:166:13 [INFO] [stderr] | [INFO] [stderr] 166 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/data_structures/binary_search_tree_iterative.rs:178:13 [INFO] [stderr] | [INFO] [stderr] 178 | let mut bst = IterativeBinarySearchTree::new(10); [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/data_structures/linked_lists.rs:23:18 [INFO] [stderr] | [INFO] [stderr] 23 | fn revserse_list(mut head: Option>) -> Option> { [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/sorting/merge_sort.rs:49:13 [INFO] [stderr] | [INFO] [stderr] 49 | let mut array = vec![9, 8, 7, 6, 5, 4, 3, 2, 1]; [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: `rusty_algo_structs` (lib) generated 16 warnings (run `cargo fix --lib -p rusty_algo_structs` to apply 6 suggestions) [INFO] [stderr] warning: `rusty_algo_structs` (lib test) generated 13 warnings (4 duplicates) (run `cargo fix --lib -p rusty_algo_structs --tests` to apply 9 suggestions) [INFO] [stderr] warning: unused import: `binary_tree::*` [INFO] [stderr] --> src/data_structures/mod.rs:7:9 [INFO] [stderr] | [INFO] [stderr] 7 | pub use binary_tree::*; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `BinarySearchTree` [INFO] [stderr] --> src/data_structures/mod.rs:8:30 [INFO] [stderr] | [INFO] [stderr] 8 | pub use binary_search_tree::{BinarySearchTree}; [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `IterativeBinarySearchTree` [INFO] [stderr] --> src/data_structures/mod.rs:9:40 [INFO] [stderr] | [INFO] [stderr] 9 | pub use binary_search_tree_iterative::{IterativeBinarySearchTree}; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `rusty_algo_structs` (bin "rusty_algo_structs" test) generated 11 warnings (8 duplicates) (run `cargo fix --bin "rusty_algo_structs" --tests` to apply 3 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.05s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: criterion v0.3.1 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1` [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/rusty_algo_structs-25cc5c38dacd2a66) [INFO] [stdout] [INFO] [stdout] running 32 tests [INFO] [stdout] test algorithms::fibonacci::tests::dynamic_fib ... ok [INFO] [stdout] test algorithms::fibonacci::tests::iterative_fibonacci ... ok [INFO] [stdout] test algorithms::fibonacci::tests::dynamic_fib_soak ... ok [INFO] [stdout] test algorithms::fibonacci::tests::iterative_fibonacci_soak ... ok [INFO] [stdout] test algorithms::fibonacci::tests::recursive_fibonacci ... ok [INFO] [stdout] test algorithms::pascal_triangle::tests::test_get_row ... ok [INFO] [stdout] test algorithms::sorting::bubble_sort::tests::test_bubble_sort ... ok [INFO] [stdout] test algorithms::sorting::insertion_sort::tests::test_insertion_sort ... ok [INFO] [stdout] test algorithms::sorting::merge_sort::tests::test_merge_sort ... ok [INFO] [stdout] test algorithms::sorting::selection_sort::tests::test_selection_sort ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::bst_duplicate_count ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::bst_insert ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::bst_insert_two ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::delete ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::inorder ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::new_bst ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::postorder ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::test_exists ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::bst_insert_iteratively ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::preorder ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::inorder ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::level_order ... ok [INFO] [stdout] test data_structures::binary_tree::tests::inorder_traverse ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::preorder ... ok [INFO] [stdout] test data_structures::binary_tree::tests::insert ... ok [INFO] [stdout] test data_structures::binary_tree::tests::insert_two ... ok [INFO] [stdout] test data_structures::binary_tree::tests::postorder_traverse ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::postorder ... ok [INFO] [stdout] test data_structures::binary_tree::tests::new ... ok [INFO] [stdout] test data_structures::linked_lists::tests::test_swap_pairs ... ok [INFO] [stdout] test data_structures::binary_tree::tests::preorder_traverse ... ok [INFO] [stdout] test data_structures::linked_lists::tests::test_reverse_list ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 32 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/debug/deps/rusty_algo_structs-55c3853cae4160f2) [INFO] [stdout] [INFO] [stdout] running 22 tests [INFO] [stdout] test data_structures::binary_search_tree::tests::bst_duplicate_count ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::bst_insert ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::bst_insert_two ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::delete ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::inorder ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::new_bst ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::postorder ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::preorder ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::test_exists ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::bst_insert_iteratively ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::inorder ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::level_order ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::postorder ... ok [INFO] [stdout] test data_structures::binary_search_tree_iterative::tests::preorder ... ok [INFO] [stdout] test data_structures::binary_tree::tests::inorder_traverse ... ok [INFO] [stdout] test data_structures::binary_tree::tests::insert ... ok [INFO] [stdout] test data_structures::binary_tree::tests::insert_two ... ok [INFO] [stdout] test data_structures::binary_tree::tests::new ... ok [INFO] [stdout] test data_structures::binary_tree::tests::postorder_traverse ... ok [INFO] [stdout] test data_structures::linked_lists::tests::test_reverse_list ... ok [INFO] [stdout] test data_structures::linked_lists::tests::test_swap_pairs ... ok [INFO] [stdout] test data_structures::binary_tree::tests::preorder_traverse ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 22 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Doc-tests rusty_algo_structs [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "645cd9e5c56542803dfc9fa9ad43ede46f6836e960998b04e81cab9d66bd3439", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "645cd9e5c56542803dfc9fa9ad43ede46f6836e960998b04e81cab9d66bd3439", kill_on_drop: false }` [INFO] [stdout] 645cd9e5c56542803dfc9fa9ad43ede46f6836e960998b04e81cab9d66bd3439