[INFO] cloning repository https://github.com/TangMoonDrift/algorithm-in-rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/TangMoonDrift/algorithm-in-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FTangMoonDrift%2Falgorithm-in-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FTangMoonDrift%2Falgorithm-in-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] dbe2b2f9f1dcb0829ef6c54c164026b158367395
[INFO] testing TangMoonDrift/algorithm-in-rust against master#1871252fc8bb672d40787e67404e6eaae7059369 for pr-125151
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FTangMoonDrift%2Falgorithm-in-rust" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/TangMoonDrift/algorithm-in-rust on toolchain 1871252fc8bb672d40787e67404e6eaae7059369
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/TangMoonDrift/algorithm-in-rust
[INFO] finished tweaking git repo https://github.com/TangMoonDrift/algorithm-in-rust
[INFO] tweaked toml for git repo https://github.com/TangMoonDrift/algorithm-in-rust written to /workspace/builds/worker-7-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/TangMoonDrift/algorithm-in-rust 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" "+1871252fc8bb672d40787e67404e6eaae7059369" "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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] da016415b97e58417cda0cac4d7f47e119e84745335185197cb010af6f76c616
[INFO] running `Command { std: "docker" "start" "-a" "da016415b97e58417cda0cac4d7f47e119e84745335185197cb010af6f76c616", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "da016415b97e58417cda0cac4d7f47e119e84745335185197cb010af6f76c616", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "da016415b97e58417cda0cac4d7f47e119e84745335185197cb010af6f76c616", kill_on_drop: false }`
[INFO] [stdout] da016415b97e58417cda0cac4d7f47e119e84745335185197cb010af6f76c616
[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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 7d7c22df409cc6a72493c0510b8f5fbd8bcb82beb84473db06a119af796d8ed7
[INFO] running `Command { std: "docker" "start" "-a" "7d7c22df409cc6a72493c0510b8f5fbd8bcb82beb84473db06a119af796d8ed7", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithm v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: variable `sum` is assigned to, but never used
[INFO] [stdout]   --> src/link/mod.rs:25:17
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut sum = carry;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider using `_sum` instead
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `sum` is never read
[INFO] [stdout]   --> src/link/mod.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |             sum += node.val;
[INFO] [stdout]    |             ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/link/mod.rs:21:9
[INFO] [stdout]    |
[INFO] [stdout] 21 |     let mut tail = &mut head;
[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/link/mod.rs:22:9
[INFO] [stdout]    |
[INFO] [stdout] 22 |     let mut carry = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> src/array/mod.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn merge<T: PartialOrd + Copy>(array: &mut [T], l: usize, m: usize, r: usize) {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_insert` is never used
[INFO] [stdout]   --> src/array/mod.rs:44:4
[INFO] [stdout]    |
[INFO] [stdout] 44 | fn heap_insert<T: PartialOrd + Copy>(array: &mut [T], index: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]   --> src/array/mod.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn heapify<T: PartialOrd + Copy>(array: &mut [T], index: usize, size: usize) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `largest_number` is never used
[INFO] [stdout]  --> src/array/greedy/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn largest_number(nums: Vec<i32>) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_city_sched_cost` is never used
[INFO] [stdout]   --> src/array/greedy/mod.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lis` is never used
[INFO] [stdout]  --> src/array/search/mod.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn lis<T: PartialOrd>(nums: &[T]) -> usize {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_left` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn find_left<T: PartialOrd>(nums: &[T], target: T) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak_element` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Sort` is never constructed
[INFO] [stdout]  --> src/array/sort/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Sort<'a, T>
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/array/sort/mod.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<'a, T> Sort<'a, T>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd + Copy,
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 15  |       pub fn from(array: &'a mut [T]) -> Self {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19  |       fn swap(&mut self, a: usize, b: usize) {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |       pub fn select_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |       pub fn bubble_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |       pub fn insert_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77  |       pub fn merge_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 100 |       pub fn merge_sort_recursion(&mut self, l: usize, r: usize) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |       pub fn heap_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_binary` is never used
[INFO] [stdout]  --> src/bit/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn print_binary(num: i32) {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `missing_number` is never used
[INFO] [stdout]   --> src/bit/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_i` is never used
[INFO] [stdout]   --> src/bit/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn single_number_i(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_ii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn single_number_ii(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_single_number_iii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn two_single_number_iii(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_power_of_two` is never used
[INFO] [stdout]   --> src/bit/mod.rs:95:8
[INFO] [stdout]    |
[INFO] [stdout] 95 | pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `range_bitwise_and` is never used
[INFO] [stdout]    --> src/bit/mod.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 103 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_bits` is never used
[INFO] [stdout]    --> src/bit/mod.rs:115:8
[INFO] [stdout]     |
[INFO] [stdout] 115 | pub fn reverse_bits(x: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_add` is never used
[INFO] [stdout]    --> src/bit/mod.rs:125:8
[INFO] [stdout]     |
[INFO] [stdout] 125 | pub fn binary_add(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_minus` is never used
[INFO] [stdout]    --> src/bit/mod.rs:135:8
[INFO] [stdout]     |
[INFO] [stdout] 135 | pub fn binary_minus(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_mul` is never used
[INFO] [stdout]    --> src/bit/mod.rs:142:8
[INFO] [stdout]     |
[INFO] [stdout] 142 | pub fn binary_mul(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_div` is never used
[INFO] [stdout]    --> src/bit/mod.rs:154:8
[INFO] [stdout]     |
[INFO] [stdout] 154 | pub fn binary_div(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `SetAll` is never used
[INFO] [stdout]  --> src/hash/mod.rs:1:7
[INFO] [stdout]   |
[INFO] [stdout] 1 | trait SetAll {
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_cover` is never used
[INFO] [stdout]  --> src/heap/mod.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_cover(lines: &Vec<[i32; 2]>) -> usize {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `F64` is never constructed
[INFO] [stdout]   --> src/heap/mod.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct F64(f64);
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/heap/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/link/mod.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `add_two_numbers` is never used
[INFO] [stdout]   --> src/link/mod.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn add_two_numbers(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_k_group` is never used
[INFO] [stdout]   --> src/link/mod.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn reverse_k_group(mut head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> src/link/mod.rs:71:8
[INFO] [stdout]    |
[INFO] [stdout] 71 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_days` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn min_days(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `schedule_course` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub fn schedule_course(courses: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_value` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:80:8
[INFO] [stdout]    |
[INFO] [stdout] 80 | pub fn max_value(n: i32, k: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_unsorted_subarray` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:96:8
[INFO] [stdout]    |
[INFO] [stdout] 96 | pub fn find_unsorted_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `power` is never used
[INFO] [stdout]  --> src/topics/greedy/utils.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn power(mut base: i32, mut exponent: i32, model: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 39 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.35s
[INFO] running `Command { std: "docker" "inspect" "7d7c22df409cc6a72493c0510b8f5fbd8bcb82beb84473db06a119af796d8ed7", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "7d7c22df409cc6a72493c0510b8f5fbd8bcb82beb84473db06a119af796d8ed7", kill_on_drop: false }`
[INFO] [stdout] 7d7c22df409cc6a72493c0510b8f5fbd8bcb82beb84473db06a119af796d8ed7
[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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f1c87e0d1856ec987153b4bacc23439e7f01e620f0c7d29fc7cbf35a15d8f356
[INFO] running `Command { std: "docker" "start" "-a" "f1c87e0d1856ec987153b4bacc23439e7f01e620f0c7d29fc7cbf35a15d8f356", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithm v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: variable `sum` is assigned to, but never used
[INFO] [stdout]   --> src/link/mod.rs:25:17
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut sum = carry;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider using `_sum` instead
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `sum` is never read
[INFO] [stdout]   --> src/link/mod.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |             sum += node.val;
[INFO] [stdout]    |             ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/link/mod.rs:21:9
[INFO] [stdout]    |
[INFO] [stdout] 21 |     let mut tail = &mut head;
[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/link/mod.rs:22:9
[INFO] [stdout]    |
[INFO] [stdout] 22 |     let mut carry = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> src/array/mod.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn merge<T: PartialOrd + Copy>(array: &mut [T], l: usize, m: usize, r: usize) {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_insert` is never used
[INFO] [stdout]   --> src/array/mod.rs:44:4
[INFO] [stdout]    |
[INFO] [stdout] 44 | fn heap_insert<T: PartialOrd + Copy>(array: &mut [T], index: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]   --> src/array/mod.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn heapify<T: PartialOrd + Copy>(array: &mut [T], index: usize, size: usize) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `largest_number` is never used
[INFO] [stdout]  --> src/array/greedy/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn largest_number(nums: Vec<i32>) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_city_sched_cost` is never used
[INFO] [stdout]   --> src/array/greedy/mod.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_left` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn find_left<T: PartialOrd>(nums: &[T], target: T) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak_element` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Sort` is never constructed
[INFO] [stdout]  --> src/array/sort/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Sort<'a, T>
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/array/sort/mod.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<'a, T> Sort<'a, T>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd + Copy,
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 15  |       pub fn from(array: &'a mut [T]) -> Self {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19  |       fn swap(&mut self, a: usize, b: usize) {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |       pub fn select_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |       pub fn bubble_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |       pub fn insert_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77  |       pub fn merge_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 100 |       pub fn merge_sort_recursion(&mut self, l: usize, r: usize) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |       pub fn heap_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_binary` is never used
[INFO] [stdout]  --> src/bit/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn print_binary(num: i32) {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `missing_number` is never used
[INFO] [stdout]   --> src/bit/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_i` is never used
[INFO] [stdout]   --> src/bit/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn single_number_i(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_ii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn single_number_ii(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_single_number_iii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn two_single_number_iii(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_power_of_two` is never used
[INFO] [stdout]   --> src/bit/mod.rs:95:8
[INFO] [stdout]    |
[INFO] [stdout] 95 | pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `range_bitwise_and` is never used
[INFO] [stdout]    --> src/bit/mod.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 103 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_bits` is never used
[INFO] [stdout]    --> src/bit/mod.rs:115:8
[INFO] [stdout]     |
[INFO] [stdout] 115 | pub fn reverse_bits(x: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_add` is never used
[INFO] [stdout]    --> src/bit/mod.rs:125:8
[INFO] [stdout]     |
[INFO] [stdout] 125 | pub fn binary_add(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_minus` is never used
[INFO] [stdout]    --> src/bit/mod.rs:135:8
[INFO] [stdout]     |
[INFO] [stdout] 135 | pub fn binary_minus(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_mul` is never used
[INFO] [stdout]    --> src/bit/mod.rs:142:8
[INFO] [stdout]     |
[INFO] [stdout] 142 | pub fn binary_mul(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_div` is never used
[INFO] [stdout]    --> src/bit/mod.rs:154:8
[INFO] [stdout]     |
[INFO] [stdout] 154 | pub fn binary_div(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `SetAll` is never used
[INFO] [stdout]  --> src/hash/mod.rs:1:7
[INFO] [stdout]   |
[INFO] [stdout] 1 | trait SetAll {
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_cover` is never used
[INFO] [stdout]  --> src/heap/mod.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_cover(lines: &Vec<[i32; 2]>) -> usize {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `F64` is never constructed
[INFO] [stdout]   --> src/heap/mod.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct F64(f64);
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/heap/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/link/mod.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `add_two_numbers` is never used
[INFO] [stdout]   --> src/link/mod.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn add_two_numbers(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_k_group` is never used
[INFO] [stdout]   --> src/link/mod.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn reverse_k_group(mut head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> src/link/mod.rs:71:8
[INFO] [stdout]    |
[INFO] [stdout] 71 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_days` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn min_days(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `schedule_course` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub fn schedule_course(courses: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_value` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:80:8
[INFO] [stdout]    |
[INFO] [stdout] 80 | pub fn max_value(n: i32, k: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_unsorted_subarray` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:96:8
[INFO] [stdout]    |
[INFO] [stdout] 96 | pub fn find_unsorted_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `power` is never used
[INFO] [stdout]  --> src/topics/greedy/utils.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn power(mut base: i32, mut exponent: i32, model: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 38 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.47s
[INFO] running `Command { std: "docker" "inspect" "f1c87e0d1856ec987153b4bacc23439e7f01e620f0c7d29fc7cbf35a15d8f356", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f1c87e0d1856ec987153b4bacc23439e7f01e620f0c7d29fc7cbf35a15d8f356", kill_on_drop: false }`
[INFO] [stdout] f1c87e0d1856ec987153b4bacc23439e7f01e620f0c7d29fc7cbf35a15d8f356
[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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+1871252fc8bb672d40787e67404e6eaae7059369" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 91c4fc216064581ea4cf5d500745b102b16cd11c564a3fe984b73fb5a7b8b008
[INFO] running `Command { std: "docker" "start" "-a" "91c4fc216064581ea4cf5d500745b102b16cd11c564a3fe984b73fb5a7b8b008", kill_on_drop: false }`
[INFO] [stderr] warning: variable `sum` is assigned to, but never used
[INFO] [stderr]   --> src/link/mod.rs:25:17
[INFO] [stderr]    |
[INFO] [stderr] 25 |         let mut sum = carry;
[INFO] [stderr]    |                 ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: consider using `_sum` instead
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `sum` is never read
[INFO] [stderr]   --> src/link/mod.rs:31:13
[INFO] [stderr]    |
[INFO] [stderr] 31 |             sum += node.val;
[INFO] [stderr]    |             ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/link/mod.rs:21:9
[INFO] [stderr]    |
[INFO] [stderr] 21 |     let mut tail = &mut head;
[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/link/mod.rs:22:9
[INFO] [stderr]    |
[INFO] [stderr] 22 |     let mut carry = 0;
[INFO] [stderr]    |         ----^^^^^
[INFO] [stderr]    |         |
[INFO] [stderr]    |         help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: function `merge` is never used
[INFO] [stderr]  --> src/array/mod.rs:8:4
[INFO] [stderr]   |
[INFO] [stderr] 8 | fn merge<T: PartialOrd + Copy>(array: &mut [T], l: usize, m: usize, r: usize) {
[INFO] [stderr]   |    ^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `heap_insert` is never used
[INFO] [stderr]   --> src/array/mod.rs:44:4
[INFO] [stderr]    |
[INFO] [stderr] 44 | fn heap_insert<T: PartialOrd + Copy>(array: &mut [T], index: usize) {
[INFO] [stderr]    |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `heapify` is never used
[INFO] [stderr]   --> src/array/mod.rs:54:4
[INFO] [stderr]    |
[INFO] [stderr] 54 | fn heapify<T: PartialOrd + Copy>(array: &mut [T], index: usize, size: usize) {
[INFO] [stderr]    |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `largest_number` is never used
[INFO] [stderr]  --> src/array/greedy/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn largest_number(nums: Vec<i32>) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `two_city_sched_cost` is never used
[INFO] [stderr]   --> src/array/greedy/mod.rs:24:8
[INFO] [stderr]    |
[INFO] [stderr] 24 | pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_left` is never used
[INFO] [stderr]   --> src/array/search/mod.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 | pub fn find_left<T: PartialOrd>(nums: &[T], target: T) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_peak_element` is never used
[INFO] [stderr]   --> src/array/search/mod.rs:53:8
[INFO] [stderr]    |
[INFO] [stderr] 53 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Sort` is never constructed
[INFO] [stderr]  --> src/array/sort/mod.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct Sort<'a, T>
[INFO] [stderr]   |            ^^^^
[INFO] [stderr] 
[INFO] [stdout] 
[INFO] [stdout] running 3 tests
[INFO] [stdout] test tests::check_lcm ... ok
[INFO] [stdout] test tests::check_gcd ... ok
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/array/sort/mod.rs:15:12
[INFO] [stderr]     |
[INFO] [stderr] 10  | / impl<'a, T> Sort<'a, T>
[INFO] [stderr] 11  | | where
[INFO] [stderr] 12  | |     T: PartialOrd + Copy,
[INFO] [stderr]     | |_________________________- associated items in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 15  |       pub fn from(array: &'a mut [T]) -> Self {
[INFO] [stderr]     |              ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 19  |       fn swap(&mut self, a: usize, b: usize) {
[INFO] [stderr]     |          ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 27  |       pub fn select_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45  |       pub fn bubble_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 61  |       pub fn insert_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 77  |       pub fn merge_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 100 |       pub fn merge_sort_recursion(&mut self, l: usize, r: usize) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 115 |       pub fn heap_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `print_binary` is never used
[INFO] [stderr]  --> src/bit/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn print_binary(num: i32) {
[INFO] [stderr]   |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `missing_number` is never used
[INFO] [stderr]   --> src/bit/mod.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `single_number_i` is never used
[INFO] [stderr]   --> src/bit/mod.rs:39:8
[INFO] [stderr]    |
[INFO] [stderr] 39 | pub fn single_number_i(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `single_number_ii` is never used
[INFO] [stderr]   --> src/bit/mod.rs:53:8
[INFO] [stderr]    |
[INFO] [stderr] 53 | pub fn single_number_ii(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `two_single_number_iii` is never used
[INFO] [stderr]   --> src/bit/mod.rs:79:8
[INFO] [stderr]    |
[INFO] [stderr] 79 | pub fn two_single_number_iii(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_power_of_two` is never used
[INFO] [stderr]   --> src/bit/mod.rs:95:8
[INFO] [stderr]    |
[INFO] [stderr] 95 | pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `range_bitwise_and` is never used
[INFO] [stderr]    --> src/bit/mod.rs:103:8
[INFO] [stderr]     |
[INFO] [stderr] 103 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reverse_bits` is never used
[INFO] [stderr]    --> src/bit/mod.rs:115:8
[INFO] [stderr]     |
[INFO] [stderr] 115 | pub fn reverse_bits(x: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_add` is never used
[INFO] [stderr]    --> src/bit/mod.rs:125:8
[INFO] [stderr]     |
[INFO] [stderr] 125 | pub fn binary_add(mut a: i32, mut b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_minus` is never used
[INFO] [stderr]    --> src/bit/mod.rs:135:8
[INFO] [stderr]     |
[INFO] [stderr] 135 | pub fn binary_minus(a: i32, b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_mul` is never used
[INFO] [stderr]    --> src/bit/mod.rs:142:8
[INFO] [stderr]     |
[INFO] [stderr] 142 | pub fn binary_mul(mut a: i32, mut b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_div` is never used
[INFO] [stderr]    --> src/bit/mod.rs:154:8
[INFO] [stderr]     |
[INFO] [stderr] 154 | pub fn binary_div(a: i32, b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `SetAll` is never used
[INFO] [stderr]  --> src/hash/mod.rs:1:7
[INFO] [stderr]   |
[INFO] [stderr] 1 | trait SetAll {
[INFO] [stderr]   |       ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_cover` is never used
[INFO] [stderr]  --> src/heap/mod.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn max_cover(lines: &Vec<[i32; 2]>) -> usize {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `F64` is never constructed
[INFO] [stderr]   --> src/heap/mod.rs:32:8
[INFO] [stderr]    |
[INFO] [stderr] 32 | struct F64(f64);
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `halve_array` is never used
[INFO] [stderr]   --> src/heap/mod.rs:42:8
[INFO] [stderr]    |
[INFO] [stderr] 42 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/link/mod.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     #[inline]
[INFO] [stderr] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]   |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `add_two_numbers` is never used
[INFO] [stderr]   --> src/link/mod.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub fn add_two_numbers(
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reverse_k_group` is never used
[INFO] [stderr]   --> src/link/mod.rs:48:8
[INFO] [stderr]    |
[INFO] [stderr] 48 | pub fn reverse_k_group(mut head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_palindrome` is never used
[INFO] [stderr]   --> src/link/mod.rs:71:8
[INFO] [stderr]    |
[INFO] [stderr] 71 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `min_days` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | pub fn min_days(n: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `schedule_course` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:44:8
[INFO] [stderr]    |
[INFO] [stderr] 44 | pub fn schedule_course(courses: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_value` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:80:8
[INFO] [stderr]    |
[INFO] [stderr] 80 | pub fn max_value(n: i32, k: usize) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_unsorted_subarray` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:96:8
[INFO] [stderr]    |
[INFO] [stderr] 96 | pub fn find_unsorted_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `power` is never used
[INFO] [stderr]  --> src/topics/greedy/utils.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub fn power(mut base: i32, mut exponent: i32, model: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `algorithm` (bin "algorithm" test) generated 38 warnings (run `cargo fix --bin "algorithm" --tests` to apply 2 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.01s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/algorithm-211e73f80901f434)
[INFO] [stdout] test tests::check_nth_magical_number has been running for over 60 seconds
[ERROR] error running command: no output for 300 seconds
[INFO] running `Command { std: "docker" "inspect" "91c4fc216064581ea4cf5d500745b102b16cd11c564a3fe984b73fb5a7b8b008", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "91c4fc216064581ea4cf5d500745b102b16cd11c564a3fe984b73fb5a7b8b008", kill_on_drop: false }`
[INFO] [stdout] 91c4fc216064581ea4cf5d500745b102b16cd11c564a3fe984b73fb5a7b8b008
[INFO] testing TangMoonDrift/algorithm-in-rust against try#b642703cf9526da1e72c0b6755753b939a9c6b6d for pr-125151
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FTangMoonDrift%2Falgorithm-in-rust" "/workspace/builds/worker-7-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/TangMoonDrift/algorithm-in-rust on toolchain b642703cf9526da1e72c0b6755753b939a9c6b6d
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+b642703cf9526da1e72c0b6755753b939a9c6b6d" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/TangMoonDrift/algorithm-in-rust
[INFO] finished tweaking git repo https://github.com/TangMoonDrift/algorithm-in-rust
[INFO] tweaked toml for git repo https://github.com/TangMoonDrift/algorithm-in-rust written to /workspace/builds/worker-7-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/TangMoonDrift/algorithm-in-rust 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" "+b642703cf9526da1e72c0b6755753b939a9c6b6d" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+b642703cf9526da1e72c0b6755753b939a9c6b6d" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 85e05620347476fc92ce1763abe190f08b59cc635baaefd4ba260752c0661e0f
[INFO] running `Command { std: "docker" "start" "-a" "85e05620347476fc92ce1763abe190f08b59cc635baaefd4ba260752c0661e0f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "85e05620347476fc92ce1763abe190f08b59cc635baaefd4ba260752c0661e0f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "85e05620347476fc92ce1763abe190f08b59cc635baaefd4ba260752c0661e0f", kill_on_drop: false }`
[INFO] [stdout] 85e05620347476fc92ce1763abe190f08b59cc635baaefd4ba260752c0661e0f
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+b642703cf9526da1e72c0b6755753b939a9c6b6d" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] dd492043e763509a80051025a47664220dfabdcfefb0c4eea8d6fd1dc2c96e67
[INFO] running `Command { std: "docker" "start" "-a" "dd492043e763509a80051025a47664220dfabdcfefb0c4eea8d6fd1dc2c96e67", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithm v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: variable `sum` is assigned to, but never used
[INFO] [stdout]   --> src/link/mod.rs:25:17
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut sum = carry;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider using `_sum` instead
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `sum` is never read
[INFO] [stdout]   --> src/link/mod.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |             sum += node.val;
[INFO] [stdout]    |             ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/link/mod.rs:21:9
[INFO] [stdout]    |
[INFO] [stdout] 21 |     let mut tail = &mut head;
[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/link/mod.rs:22:9
[INFO] [stdout]    |
[INFO] [stdout] 22 |     let mut carry = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> src/array/mod.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn merge<T: PartialOrd + Copy>(array: &mut [T], l: usize, m: usize, r: usize) {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_insert` is never used
[INFO] [stdout]   --> src/array/mod.rs:44:4
[INFO] [stdout]    |
[INFO] [stdout] 44 | fn heap_insert<T: PartialOrd + Copy>(array: &mut [T], index: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]   --> src/array/mod.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn heapify<T: PartialOrd + Copy>(array: &mut [T], index: usize, size: usize) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `largest_number` is never used
[INFO] [stdout]  --> src/array/greedy/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn largest_number(nums: Vec<i32>) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_city_sched_cost` is never used
[INFO] [stdout]   --> src/array/greedy/mod.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lis` is never used
[INFO] [stdout]  --> src/array/search/mod.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn lis<T: PartialOrd>(nums: &[T]) -> usize {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_left` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn find_left<T: PartialOrd>(nums: &[T], target: T) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak_element` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Sort` is never constructed
[INFO] [stdout]  --> src/array/sort/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Sort<'a, T>
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/array/sort/mod.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<'a, T> Sort<'a, T>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd + Copy,
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 15  |       pub fn from(array: &'a mut [T]) -> Self {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19  |       fn swap(&mut self, a: usize, b: usize) {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |       pub fn select_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |       pub fn bubble_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |       pub fn insert_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77  |       pub fn merge_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 100 |       pub fn merge_sort_recursion(&mut self, l: usize, r: usize) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |       pub fn heap_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_binary` is never used
[INFO] [stdout]  --> src/bit/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn print_binary(num: i32) {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `missing_number` is never used
[INFO] [stdout]   --> src/bit/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_i` is never used
[INFO] [stdout]   --> src/bit/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn single_number_i(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_ii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn single_number_ii(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_single_number_iii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn two_single_number_iii(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_power_of_two` is never used
[INFO] [stdout]   --> src/bit/mod.rs:95:8
[INFO] [stdout]    |
[INFO] [stdout] 95 | pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `range_bitwise_and` is never used
[INFO] [stdout]    --> src/bit/mod.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 103 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_bits` is never used
[INFO] [stdout]    --> src/bit/mod.rs:115:8
[INFO] [stdout]     |
[INFO] [stdout] 115 | pub fn reverse_bits(x: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_add` is never used
[INFO] [stdout]    --> src/bit/mod.rs:125:8
[INFO] [stdout]     |
[INFO] [stdout] 125 | pub fn binary_add(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_minus` is never used
[INFO] [stdout]    --> src/bit/mod.rs:135:8
[INFO] [stdout]     |
[INFO] [stdout] 135 | pub fn binary_minus(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_mul` is never used
[INFO] [stdout]    --> src/bit/mod.rs:142:8
[INFO] [stdout]     |
[INFO] [stdout] 142 | pub fn binary_mul(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_div` is never used
[INFO] [stdout]    --> src/bit/mod.rs:154:8
[INFO] [stdout]     |
[INFO] [stdout] 154 | pub fn binary_div(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `SetAll` is never used
[INFO] [stdout]  --> src/hash/mod.rs:1:7
[INFO] [stdout]   |
[INFO] [stdout] 1 | trait SetAll {
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_cover` is never used
[INFO] [stdout]  --> src/heap/mod.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_cover(lines: &Vec<[i32; 2]>) -> usize {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `F64` is never constructed
[INFO] [stdout]   --> src/heap/mod.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct F64(f64);
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/heap/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/link/mod.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `add_two_numbers` is never used
[INFO] [stdout]   --> src/link/mod.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn add_two_numbers(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_k_group` is never used
[INFO] [stdout]   --> src/link/mod.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn reverse_k_group(mut head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> src/link/mod.rs:71:8
[INFO] [stdout]    |
[INFO] [stdout] 71 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_days` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn min_days(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `schedule_course` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub fn schedule_course(courses: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_value` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:80:8
[INFO] [stdout]    |
[INFO] [stdout] 80 | pub fn max_value(n: i32, k: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_unsorted_subarray` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:96:8
[INFO] [stdout]    |
[INFO] [stdout] 96 | pub fn find_unsorted_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `power` is never used
[INFO] [stdout]  --> src/topics/greedy/utils.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn power(mut base: i32, mut exponent: i32, model: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 39 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.40s
[INFO] running `Command { std: "docker" "inspect" "dd492043e763509a80051025a47664220dfabdcfefb0c4eea8d6fd1dc2c96e67", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "dd492043e763509a80051025a47664220dfabdcfefb0c4eea8d6fd1dc2c96e67", kill_on_drop: false }`
[INFO] [stdout] dd492043e763509a80051025a47664220dfabdcfefb0c4eea8d6fd1dc2c96e67
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+b642703cf9526da1e72c0b6755753b939a9c6b6d" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 6596db49ca66c6970d3c8b0fe42680a581ac88131c9c48230f62b5ce6ce4cf16
[INFO] running `Command { std: "docker" "start" "-a" "6596db49ca66c6970d3c8b0fe42680a581ac88131c9c48230f62b5ce6ce4cf16", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithm v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: variable `sum` is assigned to, but never used
[INFO] [stdout]   --> src/link/mod.rs:25:17
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut sum = carry;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider using `_sum` instead
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `sum` is never read
[INFO] [stdout]   --> src/link/mod.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |             sum += node.val;
[INFO] [stdout]    |             ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/link/mod.rs:21:9
[INFO] [stdout]    |
[INFO] [stdout] 21 |     let mut tail = &mut head;
[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/link/mod.rs:22:9
[INFO] [stdout]    |
[INFO] [stdout] 22 |     let mut carry = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> src/array/mod.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn merge<T: PartialOrd + Copy>(array: &mut [T], l: usize, m: usize, r: usize) {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_insert` is never used
[INFO] [stdout]   --> src/array/mod.rs:44:4
[INFO] [stdout]    |
[INFO] [stdout] 44 | fn heap_insert<T: PartialOrd + Copy>(array: &mut [T], index: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]   --> src/array/mod.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn heapify<T: PartialOrd + Copy>(array: &mut [T], index: usize, size: usize) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `largest_number` is never used
[INFO] [stdout]  --> src/array/greedy/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn largest_number(nums: Vec<i32>) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_city_sched_cost` is never used
[INFO] [stdout]   --> src/array/greedy/mod.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_left` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn find_left<T: PartialOrd>(nums: &[T], target: T) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak_element` is never used
[INFO] [stdout]   --> src/array/search/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Sort` is never constructed
[INFO] [stdout]  --> src/array/sort/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Sort<'a, T>
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/array/sort/mod.rs:15:12
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<'a, T> Sort<'a, T>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd + Copy,
[INFO] [stdout]     | |_________________________- associated items in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 15  |       pub fn from(array: &'a mut [T]) -> Self {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19  |       fn swap(&mut self, a: usize, b: usize) {
[INFO] [stdout]     |          ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |       pub fn select_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45  |       pub fn bubble_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61  |       pub fn insert_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77  |       pub fn merge_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 100 |       pub fn merge_sort_recursion(&mut self, l: usize, r: usize) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 115 |       pub fn heap_sort(&mut self) -> &mut Self {
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_binary` is never used
[INFO] [stdout]  --> src/bit/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn print_binary(num: i32) {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `missing_number` is never used
[INFO] [stdout]   --> src/bit/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_i` is never used
[INFO] [stdout]   --> src/bit/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | pub fn single_number_i(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_ii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn single_number_ii(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_single_number_iii` is never used
[INFO] [stdout]   --> src/bit/mod.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn two_single_number_iii(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_power_of_two` is never used
[INFO] [stdout]   --> src/bit/mod.rs:95:8
[INFO] [stdout]    |
[INFO] [stdout] 95 | pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `range_bitwise_and` is never used
[INFO] [stdout]    --> src/bit/mod.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 103 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_bits` is never used
[INFO] [stdout]    --> src/bit/mod.rs:115:8
[INFO] [stdout]     |
[INFO] [stdout] 115 | pub fn reverse_bits(x: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_add` is never used
[INFO] [stdout]    --> src/bit/mod.rs:125:8
[INFO] [stdout]     |
[INFO] [stdout] 125 | pub fn binary_add(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_minus` is never used
[INFO] [stdout]    --> src/bit/mod.rs:135:8
[INFO] [stdout]     |
[INFO] [stdout] 135 | pub fn binary_minus(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_mul` is never used
[INFO] [stdout]    --> src/bit/mod.rs:142:8
[INFO] [stdout]     |
[INFO] [stdout] 142 | pub fn binary_mul(mut a: i32, mut b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_div` is never used
[INFO] [stdout]    --> src/bit/mod.rs:154:8
[INFO] [stdout]     |
[INFO] [stdout] 154 | pub fn binary_div(a: i32, b: i32) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `SetAll` is never used
[INFO] [stdout]  --> src/hash/mod.rs:1:7
[INFO] [stdout]   |
[INFO] [stdout] 1 | trait SetAll {
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_cover` is never used
[INFO] [stdout]  --> src/heap/mod.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn max_cover(lines: &Vec<[i32; 2]>) -> usize {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `F64` is never constructed
[INFO] [stdout]   --> src/heap/mod.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct F64(f64);
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/heap/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/link/mod.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `add_two_numbers` is never used
[INFO] [stdout]   --> src/link/mod.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn add_two_numbers(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_k_group` is never used
[INFO] [stdout]   --> src/link/mod.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | pub fn reverse_k_group(mut head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> src/link/mod.rs:71:8
[INFO] [stdout]    |
[INFO] [stdout] 71 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_days` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn min_days(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `schedule_course` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub fn schedule_course(courses: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_value` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:80:8
[INFO] [stdout]    |
[INFO] [stdout] 80 | pub fn max_value(n: i32, k: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_unsorted_subarray` is never used
[INFO] [stdout]   --> src/topics/greedy/mod.rs:96:8
[INFO] [stdout]    |
[INFO] [stdout] 96 | pub fn find_unsorted_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `power` is never used
[INFO] [stdout]  --> src/topics/greedy/utils.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn power(mut base: i32, mut exponent: i32, model: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 38 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.61s
[INFO] running `Command { std: "docker" "inspect" "6596db49ca66c6970d3c8b0fe42680a581ac88131c9c48230f62b5ce6ce4cf16", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6596db49ca66c6970d3c8b0fe42680a581ac88131c9c48230f62b5ce6ce4cf16", kill_on_drop: false }`
[INFO] [stdout] 6596db49ca66c6970d3c8b0fe42680a581ac88131c9c48230f62b5ce6ce4cf16
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:59a85a07ab18ca8720692f8e61effa1c651d9e2ca591e072c2b212bb91a6b8b5" "/opt/rustwide/cargo-home/bin/cargo" "+b642703cf9526da1e72c0b6755753b939a9c6b6d" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] bc806191376f99964820b8cc816d8fe9ea494bb48e7c2d555b13bfeb92167531
[INFO] running `Command { std: "docker" "start" "-a" "bc806191376f99964820b8cc816d8fe9ea494bb48e7c2d555b13bfeb92167531", kill_on_drop: false }`
[INFO] [stderr] warning: variable `sum` is assigned to, but never used
[INFO] [stderr]   --> src/link/mod.rs:25:17
[INFO] [stderr]    |
[INFO] [stderr] 25 |         let mut sum = carry;
[INFO] [stderr]    |                 ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: consider using `_sum` instead
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `sum` is never read
[INFO] [stderr]   --> src/link/mod.rs:31:13
[INFO] [stderr]    |
[INFO] [stderr] 31 |             sum += node.val;
[INFO] [stderr]    |             ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/link/mod.rs:21:9
[INFO] [stderr]    |
[INFO] [stderr] 21 |     let mut tail = &mut head;
[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/link/mod.rs:22:9
[INFO] [stderr]    |
[INFO] [stderr] 22 |     let mut carry = 0;
[INFO] [stderr]    |         ----^^^^^
[INFO] [stderr]    |         |
[INFO] [stderr]    |         help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: function `merge` is never used
[INFO] [stderr]  --> src/array/mod.rs:8:4
[INFO] [stderr]   |
[INFO] [stderr] 8 | fn merge<T: PartialOrd + Copy>(array: &mut [T], l: usize, m: usize, r: usize) {
[INFO] [stderr]   |    ^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `heap_insert` is never used
[INFO] [stderr]   --> src/array/mod.rs:44:4
[INFO] [stderr]    |
[INFO] [stderr] 44 | fn heap_insert<T: PartialOrd + Copy>(array: &mut [T], index: usize) {
[INFO] [stderr]    |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `heapify` is never used
[INFO] [stderr]   --> src/array/mod.rs:54:4
[INFO] [stderr]    |
[INFO] [stderr] 54 | fn heapify<T: PartialOrd + Copy>(array: &mut [T], index: usize, size: usize) {
[INFO] [stderr]    |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `largest_number` is never used
[INFO] [stderr]  --> src/array/greedy/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn largest_number(nums: Vec<i32>) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `two_city_sched_cost` is never used
[INFO] [stderr]   --> src/array/greedy/mod.rs:24:8
[INFO] [stderr]    |
[INFO] [stderr] 24 | pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_left` is never used
[INFO] [stderr]   --> src/array/search/mod.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 | pub fn find_left<T: PartialOrd>(nums: &[T], target: T) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_peak_element` is never used
[INFO] [stderr]   --> src/array/search/mod.rs:53:8
[INFO] [stderr]    |
[INFO] [stderr] 53 | pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Sort` is never constructed
[INFO] [stderr]  --> src/array/sort/mod.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub struct Sort<'a, T>
[INFO] [stderr]   |            ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/array/sort/mod.rs:15:12
[INFO] [stderr]     |
[INFO] [stderr] 10  | / impl<'a, T> Sort<'a, T>
[INFO] [stderr] 11  | | where
[INFO] [stderr] 12  | |     T: PartialOrd + Copy,
[INFO] [stderr]     | |_________________________- associated items in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 15  |       pub fn from(array: &'a mut [T]) -> Self {
[INFO] [stderr]     |              ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 19  |       fn swap(&mut self, a: usize, b: usize) {
[INFO] [stderr]     |          ^^^^
[INFO] [stderr] ...
[INFO] [stderr] 27  |       pub fn select_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45  |       pub fn bubble_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 61  |       pub fn insert_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 77  |       pub fn merge_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 100 |       pub fn merge_sort_recursion(&mut self, l: usize, r: usize) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 115 |       pub fn heap_sort(&mut self) -> &mut Self {
[INFO] [stderr]     |              ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `print_binary` is never used
[INFO] [stderr]  --> src/bit/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn print_binary(num: i32) {
[INFO] [stderr]   |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `missing_number` is never used
[INFO] [stderr]   --> src/bit/mod.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `single_number_i` is never used
[INFO] [stderr]   --> src/bit/mod.rs:39:8
[INFO] [stderr]    |
[INFO] [stderr] 39 | pub fn single_number_i(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `single_number_ii` is never used
[INFO] [stderr]   --> src/bit/mod.rs:53:8
[INFO] [stderr]    |
[INFO] [stderr] 53 | pub fn single_number_ii(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `two_single_number_iii` is never used
[INFO] [stderr]   --> src/bit/mod.rs:79:8
[INFO] [stderr]    |
[INFO] [stderr] 79 | pub fn two_single_number_iii(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_power_of_two` is never used
[INFO] [stderr]   --> src/bit/mod.rs:95:8
[INFO] [stderr]    |
[INFO] [stderr] 95 | pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `range_bitwise_and` is never used
[INFO] [stderr]    --> src/bit/mod.rs:103:8
[INFO] [stderr]     |
[INFO] [stderr] 103 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reverse_bits` is never used
[INFO] [stderr]    --> src/bit/mod.rs:115:8
[INFO] [stderr]     |
[INFO] [stderr] 115 | pub fn reverse_bits(x: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_add` is never used
[INFO] [stderr]    --> src/bit/mod.rs:125:8
[INFO] [stderr]     |
[INFO] [stderr] 125 | pub fn binary_add(mut a: i32, mut b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_minus` is never used
[INFO] [stderr]    --> src/bit/mod.rs:135:8
[INFO] [stderr]     |
[INFO] [stderr] 135 | pub fn binary_minus(a: i32, b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_mul` is never used
[INFO] [stderr]    --> src/bit/mod.rs:142:8
[INFO] [stderr]     |
[INFO] [stderr] 142 | pub fn binary_mul(mut a: i32, mut b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_div` is never used
[INFO] [stderr]    --> src/bit/mod.rs:154:8
[INFO] [stderr]     |
[INFO] [stderr] 154 | pub fn binary_div(a: i32, b: i32) -> i32 {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `SetAll` is never used
[INFO] [stderr]  --> src/hash/mod.rs:1:7
[INFO] [stderr]   |
[INFO] [stderr] 1 | trait SetAll {
[INFO] [stderr]   |       ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_cover` is never used
[INFO] [stderr]  --> src/heap/mod.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn max_cover(lines: &Vec<[i32; 2]>) -> usize {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `F64` is never constructed
[INFO] [stderr]   --> src/heap/mod.rs:32:8
[INFO] [stderr]    |
[INFO] [stderr] 32 | struct F64(f64);
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `halve_array` is never used
[INFO] [stderr]   --> src/heap/mod.rs:42:8
[INFO] [stderr]    |
[INFO] [stderr] 42 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/link/mod.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     #[inline]
[INFO] [stderr] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]   |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `add_two_numbers` is never used
[INFO] [stderr]   --> src/link/mod.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub fn add_two_numbers(
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reverse_k_group` is never used
[INFO] [stderr]   --> src/link/mod.rs:48:8
[INFO] [stderr]    |
[INFO] [stderr] 48 | pub fn reverse_k_group(mut head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_palindrome` is never used
[INFO] [stderr]   --> src/link/mod.rs:71:8
[INFO] [stderr]    |
[INFO] [stderr] 71 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `min_days` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | pub fn min_days(n: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `schedule_course` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:44:8
[INFO] [stderr]    |
[INFO] [stderr] 44 | pub fn schedule_course(courses: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_value` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:80:8
[INFO] [stderr]    |
[INFO] [stderr] 80 | pub fn max_value(n: i32, k: usize) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_unsorted_subarray` is never used
[INFO] [stderr]   --> src/topics/greedy/mod.rs:96:8
[INFO] [stderr]    |
[INFO] [stderr] 96 | pub fn find_unsorted_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `power` is never used
[INFO] [stderr]  --> src/topics/greedy/utils.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub fn power(mut base: i32, mut exponent: i32, model: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `algorithm` (bin "algorithm" test) generated 38 warnings (run `cargo fix --bin "algorithm" --tests` to apply 2 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.01s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/algorithm-211e73f80901f434)
[INFO] [stdout] 
[INFO] [stdout] running 3 tests
[INFO] [stdout] test tests::check_gcd ... ok
[INFO] [stdout] test tests::check_lcm ... ok
[INFO] [stdout] test tests::check_nth_magical_number has been running for over 60 seconds
[ERROR] error running command: no output for 300 seconds
[INFO] running `Command { std: "docker" "inspect" "bc806191376f99964820b8cc816d8fe9ea494bb48e7c2d555b13bfeb92167531", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "bc806191376f99964820b8cc816d8fe9ea494bb48e7c2d555b13bfeb92167531", kill_on_drop: false }`
[INFO] [stdout] bc806191376f99964820b8cc816d8fe9ea494bb48e7c2d555b13bfeb92167531
