[INFO] cloning repository https://github.com/terrorjang/rust-algorithm [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/terrorjang/rust-algorithm" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fterrorjang%2Frust-algorithm", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fterrorjang%2Frust-algorithm'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 365910f006c4201c7f61004f0f9024dcd4f790b1 [INFO] testing terrorjang/rust-algorithm against try#b83b707f97d809763b7861afa7638871f3339a33 for pr-145838-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fterrorjang%2Frust-algorithm" "/workspace/builds/worker-0-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc2/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/terrorjang/rust-algorithm [INFO] finished tweaking git repo https://github.com/terrorjang/rust-algorithm [INFO] tweaked toml for git repo https://github.com/terrorjang/rust-algorithm written to /workspace/builds/worker-0-tc2/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/terrorjang/rust-algorithm on toolchain b83b707f97d809763b7861afa7638871f3339a33 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+b83b707f97d809763b7861afa7638871f3339a33" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/terrorjang/rust-algorithm 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" "+b83b707f97d809763b7861afa7638871f3339a33" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+b83b707f97d809763b7861afa7638871f3339a33" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] babc6db18ed025b781941ef2786199524003d69505c764ed365c1f34363e56ce [INFO] running `Command { std: "docker" "start" "-a" "babc6db18ed025b781941ef2786199524003d69505c764ed365c1f34363e56ce", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "babc6db18ed025b781941ef2786199524003d69505c764ed365c1f34363e56ce", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "babc6db18ed025b781941ef2786199524003d69505c764ed365c1f34363e56ce", kill_on_drop: false }` [INFO] [stdout] babc6db18ed025b781941ef2786199524003d69505c764ed365c1f34363e56ce [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+b83b707f97d809763b7861afa7638871f3339a33" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 0234e349ccaac0751310f30f175f655a517953becd8a4b3bbd2ef35f6a22aebc [INFO] running `Command { std: "docker" "start" "-a" "0234e349ccaac0751310f30f175f655a517953becd8a4b3bbd2ef35f6a22aebc", kill_on_drop: false }` [INFO] [stderr] Compiling num-traits v0.2.19 [INFO] [stderr] Compiling algorithm v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: type `first::Node` is more private than the item `first::Link::More::0` [INFO] [stdout] --> src/data_structures/linked_list/first.rs:44:10 [INFO] [stdout] | [INFO] [stdout] 44 | More(Box), [INFO] [stdout] | ^^^^^^^^^ field `first::Link::More::0` is reachable at visibility `pub(in crate::data_structures::linked_list)` [INFO] [stdout] | [INFO] [stdout] note: but type `first::Node` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/data_structures/linked_list/first.rs:37:1 [INFO] [stdout] | [INFO] [stdout] 37 | struct Node { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] = note: `#[warn(private_interfaces)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BTree` is never constructed [INFO] [stdout] --> src/data_structures/b_tree.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct BTree {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/data_structures/b_tree.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl BTree { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 4 | fn new() -> BTree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinarySearchTree` is never constructed [INFO] [stdout] --> src/data_structures/binary_search_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct BinarySearchTree [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `minimum`, `maximum`, and `search` are never used [INFO] [stdout] --> src/data_structures/binary_search_tree.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 12 | / impl BinarySearchTree [INFO] [stdout] 13 | | where [INFO] [stdout] 14 | | T: PartialOrd, [INFO] [stdout] | |__________________- associated items in this implementation [INFO] [stdout] 15 | { [INFO] [stdout] 16 | pub fn new() -> BinarySearchTree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn insert(&mut self, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn minimum(&self) -> Option<&T> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn maximum(&self) -> Option<&T> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn search(&self, value: T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Heap` is never constructed [INFO] [stdout] --> src/data_structures/heap.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Heap { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/heap.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Heap { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 7 | pub fn new(comparator: fn(i32, i32) -> bool) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 13 | pub fn new_max() -> Self { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn new_min() -> Self { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn left_child_idx(&self, idx: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn right_child_idx(&self, idx: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn children_present(&self, idx: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | pub fn add(&mut self, val: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn parent_idx(&self, idx: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `List` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/first.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct List { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, and `pop` are never used [INFO] [stdout] --> src/data_structures/linked_list/first.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl List { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 8 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | pub fn push(&mut self, elem: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/first.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Link` is never used [INFO] [stdout] --> src/data_structures/linked_list/first.rs:42:10 [INFO] [stdout] | [INFO] [stdout] 42 | pub enum Link { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `IntoIter` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/second.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct IntoIter(List); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `List` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/second.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct List { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/data_structures/linked_list/second.rs:15:6 [INFO] [stdout] | [INFO] [stdout] 15 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `into_iter`, `new`, `push`, `pop`, `peek`, and `peek_mut` are never used [INFO] [stdout] --> src/data_structures/linked_list/second.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl<'a, T> List { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 18 | pub fn into_iter(self) -> IntoIter { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn push(&mut self, elem: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn peek(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn peek_mut(&mut self) -> Option<&mut T> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/second.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `abs` is never used [INFO] [stdout] --> src/math/abs.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn abs(num: T) -> T [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `ceil` is never used [INFO] [stdout] --> src/math/ceil.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn ceil(x: f64) -> f64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `factorial` is never used [INFO] [stdout] --> src/math/factorial.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn factorial(number: u64) -> u64 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `factorial_recursive` is never used [INFO] [stdout] --> src/math/factorial.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn factorial_recursive(number: u64) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_digits_iterative` is never used [INFO] [stdout] --> src/math/sum_of_digits.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn sum_digits_iterative(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_digits_recursive` is never used [INFO] [stdout] --> src/math/sum_of_digits.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn sum_digits_recursive(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/sorting/bubble.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn bubble_sort(arr: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 1.99s [INFO] running `Command { std: "docker" "inspect" "0234e349ccaac0751310f30f175f655a517953becd8a4b3bbd2ef35f6a22aebc", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "0234e349ccaac0751310f30f175f655a517953becd8a4b3bbd2ef35f6a22aebc", kill_on_drop: false }` [INFO] [stdout] 0234e349ccaac0751310f30f175f655a517953becd8a4b3bbd2ef35f6a22aebc [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+b83b707f97d809763b7861afa7638871f3339a33" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] c8159d413cfe2424b46d79dc5aaf834db0c0bc6704103fd3e582ff96da5ef9ca [INFO] running `Command { std: "docker" "start" "-a" "c8159d413cfe2424b46d79dc5aaf834db0c0bc6704103fd3e582ff96da5ef9ca", kill_on_drop: false }` [INFO] [stdout] warning: type `first::Node` is more private than the item `first::Link::More::0` [INFO] [stdout] --> src/data_structures/linked_list/first.rs:44:10 [INFO] [stdout] | [INFO] [stdout] 44 | More(Box), [INFO] [stdout] | ^^^^^^^^^ field `first::Link::More::0` is reachable at visibility `pub(in crate::data_structures::linked_list)` [INFO] [stdout] | [INFO] [stdout] note: but type `first::Node` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/data_structures/linked_list/first.rs:37:1 [INFO] [stdout] | [INFO] [stdout] 37 | struct Node { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] = note: `#[warn(private_interfaces)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BTree` is never constructed [INFO] [stdout] --> src/data_structures/b_tree.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct BTree {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/data_structures/b_tree.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl BTree { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 4 | fn new() -> BTree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinarySearchTree` is never constructed [INFO] [stdout] --> src/data_structures/binary_search_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct BinarySearchTree [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `minimum`, `maximum`, and `search` are never used [INFO] [stdout] --> src/data_structures/binary_search_tree.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 12 | / impl BinarySearchTree [INFO] [stdout] 13 | | where [INFO] [stdout] 14 | | T: PartialOrd, [INFO] [stdout] | |__________________- associated items in this implementation [INFO] [stdout] 15 | { [INFO] [stdout] 16 | pub fn new() -> BinarySearchTree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn insert(&mut self, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn minimum(&self) -> Option<&T> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn maximum(&self) -> Option<&T> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn search(&self, value: T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Heap` is never constructed [INFO] [stdout] --> src/data_structures/heap.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Heap { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/heap.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Heap { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 7 | pub fn new(comparator: fn(i32, i32) -> bool) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 13 | pub fn new_max() -> Self { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn new_min() -> Self { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn left_child_idx(&self, idx: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn right_child_idx(&self, idx: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn children_present(&self, idx: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | pub fn add(&mut self, val: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn parent_idx(&self, idx: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `List` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/first.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct List { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, and `pop` are never used [INFO] [stdout] --> src/data_structures/linked_list/first.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl List { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 8 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | pub fn push(&mut self, elem: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/first.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Link` is never used [INFO] [stdout] --> src/data_structures/linked_list/first.rs:42:10 [INFO] [stdout] | [INFO] [stdout] 42 | pub enum Link { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `IntoIter` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/second.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct IntoIter(List); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `List` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/second.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct List { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/data_structures/linked_list/second.rs:15:6 [INFO] [stdout] | [INFO] [stdout] 15 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `into_iter`, `new`, `push`, `pop`, `peek`, and `peek_mut` are never used [INFO] [stdout] --> src/data_structures/linked_list/second.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl<'a, T> List { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 18 | pub fn into_iter(self) -> IntoIter { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn push(&mut self, elem: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn peek(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn peek_mut(&mut self) -> Option<&mut T> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data_structures/linked_list/second.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `abs` is never used [INFO] [stdout] --> src/math/abs.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn abs(num: T) -> T [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `ceil` is never used [INFO] [stdout] --> src/math/ceil.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn ceil(x: f64) -> f64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `factorial` is never used [INFO] [stdout] --> src/math/factorial.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn factorial(number: u64) -> u64 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `factorial_recursive` is never used [INFO] [stdout] --> src/math/factorial.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn factorial_recursive(number: u64) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_digits_iterative` is never used [INFO] [stdout] --> src/math/sum_of_digits.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn sum_digits_iterative(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_digits_recursive` is never used [INFO] [stdout] --> src/math/sum_of_digits.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn sum_digits_recursive(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/sorting/bubble.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn bubble_sort(arr: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling algorithm v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused variable: `btree` [INFO] [stdout] --> src/data_structures/b_tree.rs:15:13 [INFO] [stdout] | [INFO] [stdout] 15 | let btree = BTree::new(); [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_btree` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `first::Node` is more private than the item `first::Link::More::0` [INFO] [stdout] --> src/data_structures/linked_list/first.rs:44:10 [INFO] [stdout] | [INFO] [stdout] 44 | More(Box), [INFO] [stdout] | ^^^^^^^^^ field `first::Link::More::0` is reachable at visibility `pub(in crate::data_structures::linked_list)` [INFO] [stdout] | [INFO] [stdout] note: but type `first::Node` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/data_structures/linked_list/first.rs:37:1 [INFO] [stdout] | [INFO] [stdout] 37 | struct Node { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] = note: `#[warn(private_interfaces)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.55s [INFO] running `Command { std: "docker" "inspect" "c8159d413cfe2424b46d79dc5aaf834db0c0bc6704103fd3e582ff96da5ef9ca", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "c8159d413cfe2424b46d79dc5aaf834db0c0bc6704103fd3e582ff96da5ef9ca", kill_on_drop: false }` [INFO] [stdout] c8159d413cfe2424b46d79dc5aaf834db0c0bc6704103fd3e582ff96da5ef9ca [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+b83b707f97d809763b7861afa7638871f3339a33" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 5cf8ed04813955704a2ace0e17fbc402b8175a5ed2e04d0c12f1f94ea55b1ea8 [INFO] running `Command { std: "docker" "start" "-a" "5cf8ed04813955704a2ace0e17fbc402b8175a5ed2e04d0c12f1f94ea55b1ea8", kill_on_drop: false }` [INFO] [stderr] warning: type `first::Node` is more private than the item `first::Link::More::0` [INFO] [stderr] --> src/data_structures/linked_list/first.rs:44:10 [INFO] [stderr] | [INFO] [stderr] 44 | More(Box), [INFO] [stderr] | ^^^^^^^^^ field `first::Link::More::0` is reachable at visibility `pub(in crate::data_structures::linked_list)` [INFO] [stderr] | [INFO] [stderr] note: but type `first::Node` is only usable at visibility `pub(self)` [INFO] [stderr] --> src/data_structures/linked_list/first.rs:37:1 [INFO] [stderr] | [INFO] [stderr] 37 | struct Node { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] = note: `#[warn(private_interfaces)]` on by default [INFO] [stderr] [INFO] [stderr] warning: struct `BTree` is never constructed [INFO] [stderr] --> src/data_structures/b_tree.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | struct BTree {} [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> src/data_structures/b_tree.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 3 | impl BTree { [INFO] [stderr] | ---------- associated function in this implementation [INFO] [stderr] 4 | fn new() -> BTree { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `BinarySearchTree` is never constructed [INFO] [stderr] --> src/data_structures/binary_search_tree.rs:3:12 [INFO] [stderr] | [INFO] [stderr] 3 | pub struct BinarySearchTree [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `insert`, `minimum`, `maximum`, and `search` are never used [INFO] [stderr] --> src/data_structures/binary_search_tree.rs:16:12 [INFO] [stderr] | [INFO] [stderr] 12 | / impl BinarySearchTree [INFO] [stderr] 13 | | where [INFO] [stderr] 14 | | T: PartialOrd, [INFO] [stderr] | |__________________- associated items in this implementation [INFO] [stderr] 15 | { [INFO] [stderr] 16 | pub fn new() -> BinarySearchTree { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 24 | pub fn insert(&mut self, value: T) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 48 | pub fn minimum(&self) -> Option<&T> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 54 | pub fn maximum(&self) -> Option<&T> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 61 | pub fn search(&self, value: T) -> bool { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Heap` is never constructed [INFO] [stderr] --> src/data_structures/heap.rs:1:12 [INFO] [stderr] | [INFO] [stderr] 1 | pub struct Heap { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/data_structures/heap.rs:7:12 [INFO] [stderr] | [INFO] [stderr] 6 | impl Heap { [INFO] [stderr] | --------- associated items in this implementation [INFO] [stderr] 7 | pub fn new(comparator: fn(i32, i32) -> bool) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 13 | pub fn new_max() -> Self { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 16 | pub fn new_min() -> Self { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 20 | pub fn pop(&mut self) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 54 | pub fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 59 | fn left_child_idx(&self, idx: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 62 | fn right_child_idx(&self, idx: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 65 | fn children_present(&self, idx: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 69 | pub fn add(&mut self, val: i32) { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 83 | fn parent_idx(&self, idx: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 91 | pub fn len(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `List` is never constructed [INFO] [stderr] --> src/data_structures/linked_list/first.rs:3:12 [INFO] [stderr] | [INFO] [stderr] 3 | pub struct List { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `push`, and `pop` are never used [INFO] [stderr] --> src/data_structures/linked_list/first.rs:8:12 [INFO] [stderr] | [INFO] [stderr] 7 | impl List { [INFO] [stderr] | --------- associated items in this implementation [INFO] [stderr] 8 | pub fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 12 | pub fn push(&mut self, elem: i32) { [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 21 | pub fn pop(&mut self) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Node` is never constructed [INFO] [stderr] --> src/data_structures/linked_list/first.rs:37:8 [INFO] [stderr] | [INFO] [stderr] 37 | struct Node { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: enum `Link` is never used [INFO] [stderr] --> src/data_structures/linked_list/first.rs:42:10 [INFO] [stderr] | [INFO] [stderr] 42 | pub enum Link { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `IntoIter` is never constructed [INFO] [stderr] --> src/data_structures/linked_list/second.rs:1:12 [INFO] [stderr] | [INFO] [stderr] 1 | pub struct IntoIter(List); [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `List` is never constructed [INFO] [stderr] --> src/data_structures/linked_list/second.rs:11:12 [INFO] [stderr] | [INFO] [stderr] 11 | pub struct List { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `Link` is never used [INFO] [stderr] --> src/data_structures/linked_list/second.rs:15:6 [INFO] [stderr] | [INFO] [stderr] 15 | type Link = Option>>; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `into_iter`, `new`, `push`, `pop`, `peek`, and `peek_mut` are never used [INFO] [stderr] --> src/data_structures/linked_list/second.rs:18:12 [INFO] [stderr] | [INFO] [stderr] 17 | impl<'a, T> List { [INFO] [stderr] | ------------------- associated items in this implementation [INFO] [stderr] 18 | pub fn into_iter(self) -> IntoIter { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 22 | pub fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 26 | pub fn push(&mut self, elem: T) { [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 35 | pub fn pop(&mut self) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 44 | pub fn peek(&self) -> Option<&T> { [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 50 | pub fn peek_mut(&mut self) -> Option<&mut T> { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Node` is never constructed [INFO] [stderr] --> src/data_structures/linked_list/second.rs:57:8 [INFO] [stderr] | [INFO] [stderr] 57 | struct Node { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `abs` is never used [INFO] [stderr] --> src/math/abs.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn abs(num: T) -> T [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `ceil` is never used [INFO] [stderr] --> src/math/ceil.rs:2:8 [INFO] [stderr] | [INFO] [stderr] 2 | pub fn ceil(x: f64) -> f64 { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `factorial` is never used [INFO] [stderr] --> src/math/factorial.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn factorial(number: u64) -> u64 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `factorial_recursive` is never used [INFO] [stderr] --> src/math/factorial.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn factorial_recursive(number: u64) -> u64 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sum_digits_iterative` is never used [INFO] [stderr] --> src/math/sum_of_digits.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn sum_digits_iterative(num: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sum_digits_recursive` is never used [INFO] [stderr] --> src/math/sum_of_digits.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn sum_digits_recursive(num: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `bubble_sort` is never used [INFO] [stderr] --> src/sorting/bubble.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn bubble_sort(arr: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `algorithm` (lib) generated 23 warnings [INFO] [stderr] warning: unused variable: `btree` [INFO] [stderr] --> src/data_structures/b_tree.rs:15:13 [INFO] [stderr] | [INFO] [stderr] 15 | let btree = BTree::new(); [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_btree` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: `algorithm` (lib test) generated 2 warnings (1 duplicate) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.03s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/algorithm-def2d0b278f4cc20) [INFO] [stdout] [INFO] [stdout] running 35 tests [INFO] [stdout] test data_structures::binary_search_tree::tests::search_f64 ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::search_i32 ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::test_str ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::test_i32 ... ok [INFO] [stdout] test data_structures::heap::tests::test_parent_idx ... ok [INFO] [stdout] test data_structures::heap::tests::test_empy_hep ... ok [INFO] [stdout] test data_structures::heap::tests::test_max_heap ... ok [INFO] [stdout] test data_structures::b_tree::test::test_search ... ok [INFO] [stdout] test data_structures::heap::tests::test_min_heap ... ok [INFO] [stdout] test data_structures::binary_search_tree::tests::test_f64 ... ok [INFO] [stdout] test data_structures::linked_list::first::tests::first_test ... ok [INFO] [stdout] test data_structures::linked_list::second::tests::into_iter ... ok [INFO] [stdout] test data_structures::linked_list::second::tests::second_test ... ok [INFO] [stdout] test math::abs::tests::test_f64 ... ok [INFO] [stdout] test math::abs::tests::test_i32 ... ok [INFO] [stdout] test math::abs::tests::zero ... ok [INFO] [stdout] test math::ceil::tests::negative_integer ... ok [INFO] [stdout] test math::ceil::tests::positive_decimal_with_small_number ... ok [INFO] [stdout] test math::ceil::tests::negative_decimal ... ok [INFO] [stdout] test math::sum_of_digits::tests::iterative::positive_number ... ok [INFO] [stdout] test math::ceil::tests::positive_decimal ... ok [INFO] [stdout] test math::ceil::tests::zero ... ok [INFO] [stdout] test math::sum_of_digits::tests::iterative::negative_number ... ok [INFO] [stdout] test math::factorial::tests::test_factorial_recursive ... ok [INFO] [stdout] test math::ceil::tests::positive_integer ... ok [INFO] [stdout] test data_structures::linked_list::second::tests::peek ... ok [INFO] [stdout] test math::sum_of_digits::tests::iterative::trailing_zeros ... ok [INFO] [stdout] test math::sum_of_digits::tests::recursive::positive_number ... ok [INFO] [stdout] test math::factorial::tests::test_factorial ... ok [INFO] [stdout] test math::sum_of_digits::tests::iterative::zero ... ok [INFO] [stdout] test math::sum_of_digits::tests::recursive::trailing_zeros ... ok [INFO] [stdout] test math::sum_of_digits::tests::recursive::zero ... ok [INFO] [stdout] test sorting::bubble::tests::test_sort ... ok [INFO] [stdout] test tests::it_works ... ok [INFO] [stdout] test math::sum_of_digits::tests::recursive::negative_number ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 35 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s [INFO] [stdout] [INFO] [stderr] Doc-tests algorithm [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" "5cf8ed04813955704a2ace0e17fbc402b8175a5ed2e04d0c12f1f94ea55b1ea8", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5cf8ed04813955704a2ace0e17fbc402b8175a5ed2e04d0c12f1f94ea55b1ea8", kill_on_drop: false }` [INFO] [stdout] 5cf8ed04813955704a2ace0e17fbc402b8175a5ed2e04d0c12f1f94ea55b1ea8