[INFO] cloning repository https://github.com/guolei1204/rust_lee
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/guolei1204/rust_lee" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fguolei1204%2Frust_lee", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fguolei1204%2Frust_lee'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 7aacdd08becdbdd13fa83a82ec2a99e36f7bd6aa
[INFO] testing guolei1204/rust_lee against 1.95.0 for beta-1.96-2
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fguolei1204%2Frust_lee" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/guolei1204/rust_lee
[INFO] finished tweaking git repo https://github.com/guolei1204/rust_lee
[INFO] tweaked toml for git repo https://github.com/guolei1204/rust_lee written to /workspace/builds/worker-0-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/guolei1204/rust_lee on toolchain 1.95.0
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.95.0" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/guolei1204/rust_lee already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.95.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded num_threads v0.1.3
[INFO] [stderr]   Downloaded time v0.3.7
[INFO] [stderr]   Downloaded libc v0.2.119
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+1.95.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 30f0d181234afa04acb7cd811e26cf6c5357f784693d6a4439f561fe8b86b987
[INFO] running `Command { std: "docker" "start" "-a" "30f0d181234afa04acb7cd811e26cf6c5357f784693d6a4439f561fe8b86b987", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "30f0d181234afa04acb7cd811e26cf6c5357f784693d6a4439f561fe8b86b987", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "30f0d181234afa04acb7cd811e26cf6c5357f784693d6a4439f561fe8b86b987", kill_on_drop: false }`
[INFO] [stdout] 30f0d181234afa04acb7cd811e26cf6c5357f784693d6a4439f561fe8b86b987
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+1.95.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 4b13e2926ce977080a16d544606403df1425001f2ed9781b64a552cead513470
[INFO] running `Command { std: "docker" "start" "-a" "4b13e2926ce977080a16d544606403df1425001f2ed9781b64a552cead513470", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.119
[INFO] [stderr]    Compiling num_threads v0.1.3
[INFO] [stderr]    Compiling num_cpus v1.13.1
[INFO] [stderr]    Compiling time v0.3.7
[INFO] [stderr]    Compiling threadpool v1.8.1
[INFO] [stderr]    Compiling lee_demo v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `arch::x86_64::_mm_broadcastd_epi32`
[INFO] [stdout]  --> src/n_queens.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{arch::x86_64::_mm_broadcastd_epi32, vec};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/n_queens.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 |         if (board[up_row as usize][column as usize] == 'Q') {
[INFO] [stdout]    |            ^                                              ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 38 -         if (board[up_row as usize][column as usize] == 'Q') {
[INFO] [stdout] 38 +         if board[up_row as usize][column as usize] == 'Q'  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `LinkedList`
[INFO] [stdout]   --> src/main.rs:11:28
[INFO] [stdout]    |
[INFO] [stdout] 11 |     collections::{HashMap, LinkedList, VecDeque},
[INFO] [stdout]    |                            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `build_heap_down_up` and `insert`
[INFO] [stdout]   --> src/main.rs:17:21
[INFO] [stdout]    |
[INFO] [stdout] 17 | use crate::heap_r::{build_heap_down_up, insert};
[INFO] [stdout]    |                     ^^^^^^^^^^^^^^^^^^  ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]    --> src/main.rs:214:32
[INFO] [stdout]     |
[INFO] [stdout] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `push` is never used
[INFO] [stdout]   --> src/main.rs:79:4
[INFO] [stdout]    |
[INFO] [stdout] 79 | fn push(deque: &mut VecDeque<i32>, n: 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 `pop` is never used
[INFO] [stdout]   --> src/main.rs:87:4
[INFO] [stdout]    |
[INFO] [stdout] 87 | fn pop(deque: &mut VecDeque<i32>, n: i32) {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max` is never used
[INFO] [stdout]   --> src/main.rs:93:4
[INFO] [stdout]    |
[INFO] [stdout] 93 | fn max(deque: &VecDeque<i32>) -> i32 {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated functions are never used
[INFO] [stdout]    --> src/main.rs:98:12
[INFO] [stdout]     |
[INFO] [stdout]  97 | impl Solution {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout]  98 |     pub fn move_zeros(nums: &mut Vec<i32>) {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 113 |     pub fn remove_dumplications(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 131 |     pub fn max_sliding_window(nums: &mut Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 152 |     pub fn two_sum(nums: &mut Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 168 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 182 |     pub fn middle_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 192 |     pub fn merge_two_list(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `b_search` is never used
[INFO] [stdout]  --> src/binary_search.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn b_search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `climb_stairs` is never used
[INFO] [stdout]  --> src/climb_r.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursion` is never used
[INFO] [stdout]  --> src/climb_r.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn recursion(n: usize, memo: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap_down_up` is never used
[INFO] [stdout]  --> src/heap_r.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn build_heap_down_up(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify_down_up` is never used
[INFO] [stdout]  --> src/heap_r.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn heapify_down_up(nums: &mut Vec<i32>, idx: usize) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap_up_down` is never used
[INFO] [stdout]   --> src/heap_r.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn build_heap_up_down(nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify_up_down` is never used
[INFO] [stdout]   --> src/heap_r.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn heapify_up_down(nums: &mut Vec<i32>, idx: usize, num_len: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert` is never used
[INFO] [stdout]   --> src/heap_r.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn insert(nums: &mut Vec<i32>, x: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_max` is never used
[INFO] [stdout]   --> src/heap_r.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | pub fn remove_max(nums: &mut Vec<i32>) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_list` is never used
[INFO] [stdout]   --> src/linked_list.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn to_list(vec: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `solve_n_queues` is never used
[INFO] [stdout]  --> src/n_queens.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn solve_n_queues(n: i32) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrace` is never used
[INFO] [stdout]   --> src/n_queens.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn backtrace(board: &mut Vec<Vec<char>>, solution: &mut Vec<Vec<String>>, n: i32, row: i32) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `collision` is never used
[INFO] [stdout]   --> src/n_queens.rs:33:4
[INFO] [stdout]    |
[INFO] [stdout] 33 | fn collision(board: &Vec<Vec<char>>, n: i32, row: i32, column: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `bubble_sort`, `insert_sort`, `selection_sort`, `heap_sort`, and `merge_sort` are never used
[INFO] [stdout]   --> src/sorts.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn bubble_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn insert_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn selection_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     pub fn heap_sort(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79 |     pub fn merge_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort_recursion` is never used
[INFO] [stdout]    --> src/sorts.rs:122:4
[INFO] [stdout]     |
[INFO] [stdout] 122 | fn merge_sort_recursion(nums: &mut Vec<i32>, left: usize, right: usize) {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]    --> src/sorts.rs:134:4
[INFO] [stdout]     |
[INFO] [stdout] 134 | fn merge(nums: &mut Vec<i32>, left: usize, middle: usize, right: usize) {
[INFO] [stdout]     |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap` is never used
[INFO] [stdout]    --> src/sorts.rs:167:4
[INFO] [stdout]     |
[INFO] [stdout] 167 | fn build_heap(nums: &mut Vec<i32>) {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]    --> src/sorts.rs:173:4
[INFO] [stdout]     |
[INFO] [stdout] 173 | fn heapify(nums: &mut Vec<i32>, idx: usize, len: usize) {
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 2.55s
[INFO] running `Command { std: "docker" "inspect" "4b13e2926ce977080a16d544606403df1425001f2ed9781b64a552cead513470", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4b13e2926ce977080a16d544606403df1425001f2ed9781b64a552cead513470", kill_on_drop: false }`
[INFO] [stdout] 4b13e2926ce977080a16d544606403df1425001f2ed9781b64a552cead513470
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+1.95.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f55370513cfa9c69d478ac2383400dd02f7ab46567aba32eebc8b1dadd8ec68c
[INFO] running `Command { std: "docker" "start" "-a" "f55370513cfa9c69d478ac2383400dd02f7ab46567aba32eebc8b1dadd8ec68c", kill_on_drop: false }`
[INFO] [stderr]    Compiling lee_demo v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `arch::x86_64::_mm_broadcastd_epi32`
[INFO] [stdout]  --> src/n_queens.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{arch::x86_64::_mm_broadcastd_epi32, vec};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/n_queens.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 |         if (board[up_row as usize][column as usize] == 'Q') {
[INFO] [stdout]    |            ^                                              ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 38 -         if (board[up_row as usize][column as usize] == 'Q') {
[INFO] [stdout] 38 +         if board[up_row as usize][column as usize] == 'Q'  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `LinkedList`
[INFO] [stdout]   --> src/main.rs:11:28
[INFO] [stdout]    |
[INFO] [stdout] 11 |     collections::{HashMap, LinkedList, VecDeque},
[INFO] [stdout]    |                            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `build_heap_down_up` and `insert`
[INFO] [stdout]   --> src/main.rs:17:21
[INFO] [stdout]    |
[INFO] [stdout] 17 | use crate::heap_r::{build_heap_down_up, insert};
[INFO] [stdout]    |                     ^^^^^^^^^^^^^^^^^^  ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]    --> src/main.rs:214:32
[INFO] [stdout]     |
[INFO] [stdout] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `push` is never used
[INFO] [stdout]   --> src/main.rs:79:4
[INFO] [stdout]    |
[INFO] [stdout] 79 | fn push(deque: &mut VecDeque<i32>, n: 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 `pop` is never used
[INFO] [stdout]   --> src/main.rs:87:4
[INFO] [stdout]    |
[INFO] [stdout] 87 | fn pop(deque: &mut VecDeque<i32>, n: i32) {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max` is never used
[INFO] [stdout]   --> src/main.rs:93:4
[INFO] [stdout]    |
[INFO] [stdout] 93 | fn max(deque: &VecDeque<i32>) -> i32 {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated functions are never used
[INFO] [stdout]    --> src/main.rs:98:12
[INFO] [stdout]     |
[INFO] [stdout]  97 | impl Solution {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout]  98 |     pub fn move_zeros(nums: &mut Vec<i32>) {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 113 |     pub fn remove_dumplications(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 131 |     pub fn max_sliding_window(nums: &mut Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 152 |     pub fn two_sum(nums: &mut Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 168 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 182 |     pub fn middle_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 192 |     pub fn merge_two_list(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `b_search` is never used
[INFO] [stdout]  --> src/binary_search.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn b_search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `climb_stairs` is never used
[INFO] [stdout]  --> src/climb_r.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursion` is never used
[INFO] [stdout]  --> src/climb_r.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn recursion(n: usize, memo: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap_down_up` is never used
[INFO] [stdout]  --> src/heap_r.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn build_heap_down_up(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify_down_up` is never used
[INFO] [stdout]  --> src/heap_r.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn heapify_down_up(nums: &mut Vec<i32>, idx: usize) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap_up_down` is never used
[INFO] [stdout]   --> src/heap_r.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn build_heap_up_down(nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify_up_down` is never used
[INFO] [stdout]   --> src/heap_r.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn heapify_up_down(nums: &mut Vec<i32>, idx: usize, num_len: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert` is never used
[INFO] [stdout]   --> src/heap_r.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn insert(nums: &mut Vec<i32>, x: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_max` is never used
[INFO] [stdout]   --> src/heap_r.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | pub fn remove_max(nums: &mut Vec<i32>) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/linked_list.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_list` is never used
[INFO] [stdout]   --> src/linked_list.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn to_list(vec: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `solve_n_queues` is never used
[INFO] [stdout]  --> src/n_queens.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn solve_n_queues(n: i32) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrace` is never used
[INFO] [stdout]   --> src/n_queens.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn backtrace(board: &mut Vec<Vec<char>>, solution: &mut Vec<Vec<String>>, n: i32, row: i32) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `collision` is never used
[INFO] [stdout]   --> src/n_queens.rs:33:4
[INFO] [stdout]    |
[INFO] [stdout] 33 | fn collision(board: &Vec<Vec<char>>, n: i32, row: i32, column: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `bubble_sort`, `insert_sort`, `selection_sort`, `heap_sort`, and `merge_sort` are never used
[INFO] [stdout]   --> src/sorts.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn bubble_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn insert_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn selection_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     pub fn heap_sort(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79 |     pub fn merge_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort_recursion` is never used
[INFO] [stdout]    --> src/sorts.rs:122:4
[INFO] [stdout]     |
[INFO] [stdout] 122 | fn merge_sort_recursion(nums: &mut Vec<i32>, left: usize, right: usize) {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]    --> src/sorts.rs:134:4
[INFO] [stdout]     |
[INFO] [stdout] 134 | fn merge(nums: &mut Vec<i32>, left: usize, middle: usize, right: usize) {
[INFO] [stdout]     |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap` is never used
[INFO] [stdout]    --> src/sorts.rs:167:4
[INFO] [stdout]     |
[INFO] [stdout] 167 | fn build_heap(nums: &mut Vec<i32>) {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]    --> src/sorts.rs:173:4
[INFO] [stdout]     |
[INFO] [stdout] 173 | fn heapify(nums: &mut Vec<i32>, idx: usize, len: usize) {
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.54s
[INFO] running `Command { std: "docker" "inspect" "f55370513cfa9c69d478ac2383400dd02f7ab46567aba32eebc8b1dadd8ec68c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f55370513cfa9c69d478ac2383400dd02f7ab46567aba32eebc8b1dadd8ec68c", kill_on_drop: false }`
[INFO] [stdout] f55370513cfa9c69d478ac2383400dd02f7ab46567aba32eebc8b1dadd8ec68c
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+1.95.0" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] a607fb96af84c2105d61e3a0f170868b06f19f75cf4a28e6723826dd8609778c
[INFO] running `Command { std: "docker" "start" "-a" "a607fb96af84c2105d61e3a0f170868b06f19f75cf4a28e6723826dd8609778c", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `arch::x86_64::_mm_broadcastd_epi32`
[INFO] [stderr]  --> src/n_queens.rs:1:11
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{arch::x86_64::_mm_broadcastd_epi32, vec};
[INFO] [stderr]   |           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/n_queens.rs:38:12
[INFO] [stderr]    |
[INFO] [stderr] 38 |         if (board[up_row as usize][column as usize] == 'Q') {
[INFO] [stderr]    |            ^                                              ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr] 38 -         if (board[up_row as usize][column as usize] == 'Q') {
[INFO] [stderr] 38 +         if board[up_row as usize][column as usize] == 'Q'  {
[INFO] [stderr]    |
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `LinkedList`
[INFO] [stderr]   --> src/main.rs:11:28
[INFO] [stderr]    |
[INFO] [stderr] 11 |     collections::{HashMap, LinkedList, VecDeque},
[INFO] [stderr]    |                            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `build_heap_down_up` and `insert`
[INFO] [stderr]   --> src/main.rs:17:21
[INFO] [stderr]    |
[INFO] [stderr] 17 | use crate::heap_r::{build_heap_down_up, insert};
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^  ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `head`
[INFO] [stderr]    --> src/main.rs:214:32
[INFO] [stderr]     |
[INFO] [stderr] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]     |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `push` is never used
[INFO] [stderr]   --> src/main.rs:79:4
[INFO] [stderr]    |
[INFO] [stderr] 79 | fn push(deque: &mut VecDeque<i32>, n: i32) {
[INFO] [stderr]    |    ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `pop` is never used
[INFO] [stderr]   --> src/main.rs:87:4
[INFO] [stderr]    |
[INFO] [stderr] 87 | fn pop(deque: &mut VecDeque<i32>, n: i32) {
[INFO] [stderr]    |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max` is never used
[INFO] [stderr]   --> src/main.rs:93:4
[INFO] [stderr]    |
[INFO] [stderr] 93 | fn max(deque: &VecDeque<i32>) -> i32 {
[INFO] [stderr]    |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated functions are never used
[INFO] [stderr]    --> src/main.rs:98:12
[INFO] [stderr]     |
[INFO] [stderr]  97 | impl Solution {
[INFO] [stderr]     | ------------- associated functions in this implementation
[INFO] [stderr]  98 |     pub fn move_zeros(nums: &mut Vec<i32>) {
[INFO] [stderr]     |            ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 113 |     pub fn remove_dumplications(nums: &mut Vec<i32>) -> i32 {
[INFO] [stderr]     |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 131 |     pub fn max_sliding_window(nums: &mut Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stderr]     |            ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 152 |     pub fn two_sum(nums: &mut Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]     |            ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 168 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]     |            ^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 182 |     pub fn middle_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]     |            ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 192 |     pub fn merge_two_list(
[INFO] [stderr]     |            ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stderr]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `b_search` is never used
[INFO] [stderr]  --> src/binary_search.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn b_search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `climb_stairs` is never used
[INFO] [stderr]  --> src/climb_r.rs:3:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 3 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stderr]   |            ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `recursion` is never used
[INFO] [stderr]  --> src/climb_r.rs:9:4
[INFO] [stderr]   |
[INFO] [stderr] 9 | fn recursion(n: usize, memo: &mut Vec<i32>) -> i32 {
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `build_heap_down_up` is never used
[INFO] [stderr]  --> src/heap_r.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn build_heap_down_up(nums: &mut Vec<i32>) {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `heapify_down_up` is never used
[INFO] [stderr]  --> src/heap_r.rs:7:4
[INFO] [stderr]   |
[INFO] [stderr] 7 | fn heapify_down_up(nums: &mut Vec<i32>, idx: usize) {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `build_heap_up_down` is never used
[INFO] [stderr]   --> src/heap_r.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn build_heap_up_down(nums: &mut Vec<i32>) {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `heapify_up_down` is never used
[INFO] [stderr]   --> src/heap_r.rs:27:4
[INFO] [stderr]    |
[INFO] [stderr] 27 | fn heapify_up_down(nums: &mut Vec<i32>, idx: usize, num_len: usize) {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `insert` is never used
[INFO] [stderr]   --> src/heap_r.rs:50:8
[INFO] [stderr]    |
[INFO] [stderr] 50 | pub fn insert(nums: &mut Vec<i32>, x: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `remove_max` is never used
[INFO] [stderr]   --> src/heap_r.rs:58:8
[INFO] [stderr]    |
[INFO] [stderr] 58 | pub fn remove_max(nums: &mut Vec<i32>) -> Option<i32> {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/linked_list.rs:2:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]  --> src/linked_list.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | impl ListNode {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 8 |     fn new(val: i32) -> Self {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `to_list` is never used
[INFO] [stderr]   --> src/linked_list.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn to_list(vec: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `solve_n_queues` is never used
[INFO] [stderr]  --> src/n_queens.rs:6:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 6 |     pub fn solve_n_queues(n: i32) -> Vec<Vec<String>> {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `backtrace` is never used
[INFO] [stderr]   --> src/n_queens.rs:16:4
[INFO] [stderr]    |
[INFO] [stderr] 16 | fn backtrace(board: &mut Vec<Vec<char>>, solution: &mut Vec<Vec<String>>, n: i32, row: i32) {
[INFO] [stderr]    |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `collision` is never used
[INFO] [stderr]   --> src/n_queens.rs:33:4
[INFO] [stderr]    |
[INFO] [stderr] 33 | fn collision(board: &Vec<Vec<char>>, n: i32, row: i32, column: i32) -> bool {
[INFO] [stderr]    |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `bubble_sort`, `insert_sort`, `selection_sort`, `heap_sort`, and `merge_sort` are never used
[INFO] [stderr]   --> src/sorts.rs:6:12
[INFO] [stderr]    |
[INFO] [stderr]  5 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  6 |     pub fn bubble_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 29 |     pub fn insert_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 50 |     pub fn selection_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 70 |     pub fn heap_sort(nums: &mut Vec<i32>) {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 79 |     pub fn merge_sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `merge_sort_recursion` is never used
[INFO] [stderr]    --> src/sorts.rs:122:4
[INFO] [stderr]     |
[INFO] [stderr] 122 | fn merge_sort_recursion(nums: &mut Vec<i32>, left: usize, right: usize) {
[INFO] [stderr]     |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `merge` is never used
[INFO] [stderr]    --> src/sorts.rs:134:4
[INFO] [stderr]     |
[INFO] [stderr] 134 | fn merge(nums: &mut Vec<i32>, left: usize, middle: usize, right: usize) {
[INFO] [stderr]     |    ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `build_heap` is never used
[INFO] [stderr]    --> src/sorts.rs:167:4
[INFO] [stderr]     |
[INFO] [stderr] 167 | fn build_heap(nums: &mut Vec<i32>) {
[INFO] [stderr]     |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `heapify` is never used
[INFO] [stderr]    --> src/sorts.rs:173:4
[INFO] [stderr]     |
[INFO] [stderr] 173 | fn heapify(nums: &mut Vec<i32>, idx: usize, len: usize) {
[INFO] [stderr]     |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `lee_demo` (bin "lee_demo" test) generated 29 warnings (run `cargo fix --bin "lee_demo" -p lee_demo --tests` to apply 5 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.16s
[INFO] [stderr]      Running unittests src/main.rs (/opt/rustwide/target/debug/deps/lee_demo-ce612b0739ef1bff)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "a607fb96af84c2105d61e3a0f170868b06f19f75cf4a28e6723826dd8609778c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a607fb96af84c2105d61e3a0f170868b06f19f75cf4a28e6723826dd8609778c", kill_on_drop: false }`
[INFO] [stdout] a607fb96af84c2105d61e3a0f170868b06f19f75cf4a28e6723826dd8609778c
