[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] checking guolei1204/rust_lee against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fguolei1204%2Frust_lee" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/guolei1204/rust_lee on toolchain 1f12b9b0fdbe735968ac002792a720f0ba4faca6
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[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-1-tc1/source/Cargo.toml
[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" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded num_threads v0.1.3
[INFO] [stderr]   Downloaded time v0.3.7
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 485390dbfaea459aad0e6ac8b3069d583e48d5f77af89645fa9e21cfc18d3cab
[INFO] running `Command { std: "docker" "start" "-a" "485390dbfaea459aad0e6ac8b3069d583e48d5f77af89645fa9e21cfc18d3cab", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "485390dbfaea459aad0e6ac8b3069d583e48d5f77af89645fa9e21cfc18d3cab", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "485390dbfaea459aad0e6ac8b3069d583e48d5f77af89645fa9e21cfc18d3cab", kill_on_drop: false }`
[INFO] [stdout] 485390dbfaea459aad0e6ac8b3069d583e48d5f77af89645fa9e21cfc18d3cab
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] ecbf17a9a3efb3a0b85f7ccddfe97f8c710da284ea0d7fbedf92bdc76a6e66c4
[INFO] running `Command { std: "docker" "start" "-a" "ecbf17a9a3efb3a0b85f7ccddfe97f8c710da284ea0d7fbedf92bdc76a6e66c4", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.119
[INFO] [stderr]     Checking num_threads v0.1.3
[INFO] [stderr]     Checking num_cpus v1.13.1
[INFO] [stderr]     Checking time v0.3.7
[INFO] [stderr]     Checking threadpool v1.8.1
[INFO] [stderr]     Checking 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)]` 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)]` 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 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)]` 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)]` 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)]` 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)]` 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: 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: 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)]` on by default
[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 `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)]` 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: 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: 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: 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] [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: 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] [stdout] warning: 28 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 28 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 1.16s
[INFO] running `Command { std: "docker" "inspect" "ecbf17a9a3efb3a0b85f7ccddfe97f8c710da284ea0d7fbedf92bdc76a6e66c4", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "ecbf17a9a3efb3a0b85f7ccddfe97f8c710da284ea0d7fbedf92bdc76a6e66c4", kill_on_drop: false }`
[INFO] [stdout] ecbf17a9a3efb3a0b85f7ccddfe97f8c710da284ea0d7fbedf92bdc76a6e66c4
[INFO] checking guolei1204/rust_lee against try#f9935d29d867449445ee008640ccca1bf1ae0889+rustflags=-Dtail_expr_drop_order for crater-rollup-uwu
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fguolei1204%2Frust_lee" "/workspace/builds/worker-1-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/guolei1204/rust_lee on toolchain f9935d29d867449445ee008640ccca1bf1ae0889
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[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-1-tc2/source/Cargo.toml
[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" "+f9935d29d867449445ee008640ccca1bf1ae0889" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] ba77662423de7de5910b5a6327a90b0d456399580ca7721fdc42af87ac87f357
[INFO] running `Command { std: "docker" "start" "-a" "ba77662423de7de5910b5a6327a90b0d456399580ca7721fdc42af87ac87f357", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "ba77662423de7de5910b5a6327a90b0d456399580ca7721fdc42af87ac87f357", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "ba77662423de7de5910b5a6327a90b0d456399580ca7721fdc42af87ac87f357", kill_on_drop: false }`
[INFO] [stdout] ba77662423de7de5910b5a6327a90b0d456399580ca7721fdc42af87ac87f357
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Dtail_expr_drop_order" "-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] a58eb2a5ab2601254aa6f6a28db92311d0777713380800de87b8f5c9d45130f5
[INFO] running `Command { std: "docker" "start" "-a" "a58eb2a5ab2601254aa6f6a28db92311d0777713380800de87b8f5c9d45130f5", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.119
[INFO] [stderr]     Checking num_threads v0.1.3
[INFO] [stderr]     Checking num_cpus v1.13.1
[INFO] [stderr]     Checking time v0.3.7
[INFO] [stderr]     Checking threadpool v1.8.1
[INFO] [stderr]     Checking 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)]` 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)]` 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 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)]` 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)]` 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)]` on by default
[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)]` 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)]` 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)]` 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: 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: 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 `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: 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: 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: 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 `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 `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 `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 `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 `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 `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 `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: 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: 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 `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 `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: 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: 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: 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: 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: 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 `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 `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 `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: 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] [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] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021
[INFO] [stdout]    --> src/main.rs:196:15
[INFO] [stdout]     |
[INFO] [stdout] 193 |         list1: Option<Box<ListNode>>,
[INFO] [stdout]     |         ---------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 194 |         list2: Option<Box<ListNode>>,
[INFO] [stdout]     |         ---------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 195 |     ) -> Option<Box<ListNode>> {
[INFO] [stdout] 196 |         match (list1, list2) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #123739 <https://github.com/rust-lang/rust/issues/123739>
[INFO] [stdout]     = note: requested on the command line with `-D tail-expr-drop-order`
[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] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021
[INFO] [stdout]    --> src/main.rs:233:9
[INFO] [stdout]     |
[INFO] [stdout] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |                                --------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 215 |         let mut dummy = Some(Box::new(ListNode { val: 0, next: None }));
[INFO] [stdout]     |                 ----- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] ...
[INFO] [stdout] 231 |         let next = new_cur.as_mut().unwrap().next.as_mut().unwrap().next.take();
[INFO] [stdout]     |             ---- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 232 |         new_cur.as_mut().unwrap().next = next;
[INFO] [stdout] 233 |         dummy.unwrap().next
[INFO] [stdout]     |         ^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #123739 <https://github.com/rust-lang/rust/issues/123739>
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021
[INFO] [stdout]    --> src/main.rs:196:15
[INFO] [stdout]     |
[INFO] [stdout] 193 |         list1: Option<Box<ListNode>>,
[INFO] [stdout]     |         ---------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 194 |         list2: Option<Box<ListNode>>,
[INFO] [stdout]     |         ---------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 195 |     ) -> Option<Box<ListNode>> {
[INFO] [stdout] 196 |         match (list1, list2) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #123739 <https://github.com/rust-lang/rust/issues/123739>
[INFO] [stdout]     = note: requested on the command line with `-D tail-expr-drop-order`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021
[INFO] [stdout]    --> src/main.rs:233:9
[INFO] [stdout]     |
[INFO] [stdout] 214 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |                                --------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 215 |         let mut dummy = Some(Box::new(ListNode { val: 0, next: None }));
[INFO] [stdout]     |                 ----- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] ...
[INFO] [stdout] 231 |         let next = new_cur.as_mut().unwrap().next.as_mut().unwrap().next.take();
[INFO] [stdout]     |             ---- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 232 |         new_cur.as_mut().unwrap().next = next;
[INFO] [stdout] 233 |         dummy.unwrap().next
[INFO] [stdout]     |         ^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #123739 <https://github.com/rust-lang/rust/issues/123739>
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 2 previous errors; 28 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 2 previous errors; 28 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `lee_demo` (bin "lee_demo" test) due to 3 previous errors; 28 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stderr] error: could not compile `lee_demo` (bin "lee_demo") due to 3 previous errors; 28 warnings emitted
[INFO] running `Command { std: "docker" "inspect" "a58eb2a5ab2601254aa6f6a28db92311d0777713380800de87b8f5c9d45130f5", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a58eb2a5ab2601254aa6f6a28db92311d0777713380800de87b8f5c9d45130f5", kill_on_drop: false }`
[INFO] [stdout] a58eb2a5ab2601254aa6f6a28db92311d0777713380800de87b8f5c9d45130f5