[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] checking terrorjang/rust-algorithm against try#1bd50d4315eb15970d395b6be5823f9384707693 for pr-140151
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fterrorjang%2Frust-algorithm" "/workspace/builds/worker-1-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/terrorjang/rust-algorithm on toolchain 1bd50d4315eb15970d395b6be5823f9384707693
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1bd50d4315eb15970d395b6be5823f9384707693" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[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-1-tc2/source/Cargo.toml
[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" "+1bd50d4315eb15970d395b6be5823f9384707693" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+1bd50d4315eb15970d395b6be5823f9384707693" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 20502ddf174b4b36d397ed6bea6e990a17fd8d2502a9fbd8ac833bc069d36783
[INFO] running `Command { std: "docker" "start" "-a" "20502ddf174b4b36d397ed6bea6e990a17fd8d2502a9fbd8ac833bc069d36783", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "20502ddf174b4b36d397ed6bea6e990a17fd8d2502a9fbd8ac833bc069d36783", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "20502ddf174b4b36d397ed6bea6e990a17fd8d2502a9fbd8ac833bc069d36783", kill_on_drop: false }`
[INFO] [stdout] 20502ddf174b4b36d397ed6bea6e990a17fd8d2502a9fbd8ac833bc069d36783
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+1bd50d4315eb15970d395b6be5823f9384707693" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 839526b3413f36a4b3880e21580b0d066fbc7483543af220a68d86736cb4a1c8
[INFO] running `Command { std: "docker" "start" "-a" "839526b3413f36a4b3880e21580b0d066fbc7483543af220a68d86736cb4a1c8", kill_on_drop: false }`
[INFO] [stderr]    Compiling autocfg v1.3.0
[INFO] [stderr]    Compiling num-traits v0.2.19
[INFO] [stderr]     Checking 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<Node>),
[INFO] [stdout]    |          ^^^^^^^^^ field `first::Link::More::0` is reachable at visibility `pub(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)]` 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<T>
[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<T> BinarySearchTree<T>
[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<T> {
[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<i32> {
[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<usize> {
[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<i32> {
[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: associated items `into_iter`, `new`, `push`, `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<T> {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 18 |     pub fn into_iter(self) -> IntoIter<T> {
[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] 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: function `abs` is never used
[INFO] [stdout]  --> src/math/abs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn abs<T>(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<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[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)]` 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<Node>),
[INFO] [stdout]    |          ^^^^^^^^^ field `first::Link::More::0` is reachable at visibility `pub(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 `dev` profile [unoptimized + debuginfo] target(s) in 1.29s
[INFO] running `Command { std: "docker" "inspect" "839526b3413f36a4b3880e21580b0d066fbc7483543af220a68d86736cb4a1c8", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "839526b3413f36a4b3880e21580b0d066fbc7483543af220a68d86736cb4a1c8", kill_on_drop: false }`
[INFO] [stdout] 839526b3413f36a4b3880e21580b0d066fbc7483543af220a68d86736cb4a1c8