[INFO] cloning repository https://github.com/CodingInGreen/algorithms
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/CodingInGreen/algorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FCodingInGreen%2Falgorithms", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FCodingInGreen%2Falgorithms'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 564c150ffa60f9af7cc7d5e43a3e3403ac96480d
[INFO] testing CodingInGreen/algorithms against master#1ef7943ee607160a564655b6596f83670ef95df5 for pr-146098-6
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FCodingInGreen%2Falgorithms" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/CodingInGreen/algorithms
[INFO] finished tweaking git repo https://github.com/CodingInGreen/algorithms
[INFO] tweaked toml for git repo https://github.com/CodingInGreen/algorithms written to /workspace/builds/worker-7-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/CodingInGreen/algorithms on toolchain 1ef7943ee607160a564655b6596f83670ef95df5
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1ef7943ee607160a564655b6596f83670ef95df5" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/CodingInGreen/algorithms already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1ef7943ee607160a564655b6596f83670ef95df5" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+1ef7943ee607160a564655b6596f83670ef95df5" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 05089f99e6976b4c101c38e55dfdc1e46efe828077855f51bd34370cb5550172
[INFO] running `Command { std: "docker" "start" "-a" "05089f99e6976b4c101c38e55dfdc1e46efe828077855f51bd34370cb5550172", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "05089f99e6976b4c101c38e55dfdc1e46efe828077855f51bd34370cb5550172", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "05089f99e6976b4c101c38e55dfdc1e46efe828077855f51bd34370cb5550172", kill_on_drop: false }`
[INFO] [stdout] 05089f99e6976b4c101c38e55dfdc1e46efe828077855f51bd34370cb5550172
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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=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:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+1ef7943ee607160a564655b6596f83670ef95df5" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 2fe75f0cdf7325d5b631d2e5a0f7d9c3c6e7ce81241730f738055a657cb616c7
[INFO] running `Command { std: "docker" "start" "-a" "2fe75f0cdf7325d5b631d2e5a0f7d9c3c6e7ce81241730f738055a657cb616c7", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithms v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] error[E0601]: `main` function not found in crate `235_lowest_common_ancestor_of_a_binary_search_tree`
[INFO] [stdout]    --> bin/235_lowest_common_ancestor_of_a_binary_search_tree.rs:130:2
[INFO] [stdout]     |
[INFO] [stdout] 130 | }
[INFO] [stdout]     |  ^ consider adding a `main` function to `bin/235_lowest_common_ancestor_of_a_binary_search_tree.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0601]: `main` function not found in crate `226_invert_binary_tree`
[INFO] [stdout]    --> bin/226_invert_binary_tree.rs:131:2
[INFO] [stdout]     |
[INFO] [stdout] 131 | }
[INFO] [stdout]     |  ^ consider adding a `main` function to `bin/226_invert_binary_tree.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0601]: `main` function not found in crate `141_linked_list_cycles`
[INFO] [stdout]   --> bin/141_linked_list_cycles.rs:87:2
[INFO] [stdout]    |
[INFO] [stdout] 87 | }
[INFO] [stdout]    |  ^ consider adding a `main` function to `bin/141_linked_list_cycles.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> bin/19_remove_node_from_end_of_linked_list.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     fn new(val: i32) -> ListLink {
[INFO] [stdout]    |        ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/19_remove_node_from_end_of_linked_list.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]   --> bin/19_remove_node_from_end_of_linked_list.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     fn remove_nth_from_end(mut head: ListLink, n: i32) -> ListLink {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/153_find_minimum_in_rotated_sorted_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[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 `find_min` is never used
[INFO] [stdout]   --> bin/153_find_minimum_in_rotated_sorted_array.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/121_best_time_to_buy_and_sell_stock.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[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 `max_profit` is never used
[INFO] [stdout]   --> bin/121_best_time_to_buy_and_sell_stock.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "235_lowest_common_ancestor_of_a_binary_search_tree") due to 1 previous error
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stderr] error: could not compile `algorithms` (bin "141_linked_list_cycles") due to 1 previous error
[INFO] [stdout] warning: function `build_tree` is never used
[INFO] [stdout]   --> bin/124_binary_tree_maximum_path_sum.rs:62:4
[INFO] [stdout]    |
[INFO] [stdout] 62 | fn build_tree(values: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]   --> bin/150_evaluate_reverse_polish_notation.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 20 | use std::collections::VecDeque;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "226_invert_binary_tree") due to 1 previous error
[INFO] [stdout] warning: function `build_tree_from_vec` is never used
[INFO] [stdout]   --> bin/105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:48:4
[INFO] [stdout]    |
[INFO] [stdout] 48 | fn build_tree_from_vec(values: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `are_trees_equal` is never used
[INFO] [stdout]   --> bin/105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:84:4
[INFO] [stdout]    |
[INFO] [stdout] 84 | fn are_trees_equal(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0601]: `main` function not found in crate `295_find_medium_from_data_stream`
[INFO] [stdout]   --> bin/295_find_medium_from_data_stream.rs:86:2
[INFO] [stdout]    |
[INFO] [stdout] 86 | }
[INFO] [stdout]    |  ^ consider adding a `main` function to `bin/295_find_medium_from_data_stream.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]   --> bin/100_same_tree.rs:10:5
[INFO] [stdout]    |
[INFO] [stdout] 10 | use std::collections::VecDeque;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0601]: `main` function not found in crate `100_same_tree`
[INFO] [stdout]    --> bin/100_same_tree.rs:104:2
[INFO] [stdout]     |
[INFO] [stdout] 104 | }
[INFO] [stdout]     |  ^ consider adding a `main` function to `bin/100_same_tree.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::f64`
[INFO] [stdout]   --> bin/875_koko_eating_bananas.rs:18:5
[INFO] [stdout]    |
[INFO] [stdout] 18 | use std::f64;
[INFO] [stdout]    |     ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> bin/1_two_sum.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_tree` is never used
[INFO] [stdout]   --> bin/297_serialize_and_deserialize_binary_tree.rs:85:4
[INFO] [stdout]    |
[INFO] [stdout] 85 | fn build_tree(values: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_alphanumeric` is never used
[INFO] [stdout]   --> bin/125_valid_palindrome.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn is_alphanumeric(c: char) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_lowercase` is never used
[INFO] [stdout]   --> bin/125_valid_palindrome.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn to_lowercase(c: char) -> char {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> bin/125_valid_palindrome.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn is_palindrome(s: &str) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "295_find_medium_from_data_stream") due to 1 previous error
[INFO] [stdout] warning: function `build_tree` is never used
[INFO] [stdout]   --> bin/230_kth_smallest_element_in_a_bst.rs:58:4
[INFO] [stdout]    |
[INFO] [stdout] 58 | fn build_tree(values: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/150_evaluate_reverse_polish_notation.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[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 `eval_rpn` is never used
[INFO] [stdout]   --> bin/150_evaluate_reverse_polish_notation.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/875_koko_eating_bananas.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[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 `min_eating_speed` is never used
[INFO] [stdout]   --> bin/875_koko_eating_bananas.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn min_eating_speed(piles: Vec<i32>, h: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "100_same_tree") due to 1 previous error; 1 warning emitted
[INFO] running `Command { std: "docker" "inspect" "2fe75f0cdf7325d5b631d2e5a0f7d9c3c6e7ce81241730f738055a657cb616c7", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "2fe75f0cdf7325d5b631d2e5a0f7d9c3c6e7ce81241730f738055a657cb616c7", kill_on_drop: false }`
[INFO] [stdout] 2fe75f0cdf7325d5b631d2e5a0f7d9c3c6e7ce81241730f738055a657cb616c7
