[INFO] cloning repository https://github.com/rjlacanlaled/rust-dsa
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/rjlacanlaled/rust-dsa" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frjlacanlaled%2Frust-dsa", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frjlacanlaled%2Frust-dsa'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 9a011379141d78f54105ad49b3d6dea4058fd22d
[INFO] checking rjlacanlaled/rust-dsa against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frjlacanlaled%2Frust-dsa" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/rjlacanlaled/rust-dsa 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/rjlacanlaled/rust-dsa
[INFO] finished tweaking git repo https://github.com/rjlacanlaled/rust-dsa
[INFO] tweaked toml for git repo https://github.com/rjlacanlaled/rust-dsa written to /workspace/builds/worker-0-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/rjlacanlaled/rust-dsa 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] 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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 56701db2cbcec20c2abe3a5335f199273ae19f804c9ba9614e02fb09458e268d
[INFO] running `Command { std: "docker" "start" "-a" "56701db2cbcec20c2abe3a5335f199273ae19f804c9ba9614e02fb09458e268d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "56701db2cbcec20c2abe3a5335f199273ae19f804c9ba9614e02fb09458e268d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "56701db2cbcec20c2abe3a5335f199273ae19f804c9ba9614e02fb09458e268d", kill_on_drop: false }`
[INFO] [stdout] 56701db2cbcec20c2abe3a5335f199273ae19f804c9ba9614e02fb09458e268d
[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=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] 02993635ea97ba10423b922e44a3dcd2c86b7c01f6f09a7240cfd56f5b3a67d5
[INFO] running `Command { std: "docker" "start" "-a" "02993635ea97ba10423b922e44a3dcd2c86b7c01f6f09a7240cfd56f5b3a67d5", kill_on_drop: false }`
[INFO] [stderr]     Checking rust-dsa v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::f32::INFINITY`
[INFO] [stdout]  --> src/dynamic_programming/minimum_path_sum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::f32::INFINITY;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::BorrowMut` and `ops::DerefMut`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:2:11
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::{borrow::BorrowMut, ops::DerefMut};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]    --> src/main.rs:163:5
[INFO] [stdout]     |
[INFO] [stdout] 163 | use std::borrow::BorrowMut;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::current`
[INFO] [stdout]    --> src/main.rs:268:5
[INFO] [stdout]     |
[INFO] [stdout] 268 | use std::thread::current;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::f32::INFINITY`
[INFO] [stdout]  --> src/dynamic_programming/minimum_path_sum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::f32::INFINITY;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::BorrowMut` and `ops::DerefMut`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:2:11
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::{borrow::BorrowMut, ops::DerefMut};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]    --> src/main.rs:163:5
[INFO] [stdout]     |
[INFO] [stdout] 163 | use std::borrow::BorrowMut;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::current`
[INFO] [stdout]    --> src/main.rs:268:5
[INFO] [stdout]     |
[INFO] [stdout] 268 | use std::thread::current;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `text1`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:35
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                   ^^^^^ help: if this is intentional, prefix it with an underscore: `_text1`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `text2`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:50
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                                  ^^^^^ help: if this is intentional, prefix it with an underscore: `_text2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `basket`
[INFO] [stdout]   --> src/main.rs:82:13
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_basket`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `max_fruits`
[INFO] [stdout]   --> src/main.rs:86:13
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `fruits`
[INFO] [stdout]   --> src/main.rs:81:20
[INFO] [stdout]    |
[INFO] [stdout] 81 | pub fn total_fruit(fruits: Vec<i32>) -> i32 {
[INFO] [stdout]    |                    ^^^^^^ help: if this is intentional, prefix it with an underscore: `_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |         ----^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:84:9
[INFO] [stdout]    |
[INFO] [stdout] 84 |     let mut left = 0;
[INFO] [stdout]    |         ----^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:85:9
[INFO] [stdout]    |
[INFO] [stdout] 85 |     let mut right = 1;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:86:9
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |         ----^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solutions` is never constructed
[INFO] [stdout]    --> src/main.rs:238:8
[INFO] [stdout]     |
[INFO] [stdout] 238 | struct Solutions;
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `is_symmetric_helper` are never used
[INFO] [stdout]    --> src/main.rs:240:12
[INFO] [stdout]     |
[INFO] [stdout] 239 | impl Solutions {
[INFO] [stdout]     | -------------- associated functions in this implementation
[INFO] [stdout] 240 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 249 |     fn is_symmetric_helper(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_duplicate` is never used
[INFO] [stdout]  --> src/arrays/contains_duplicate.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `product_except_self` is never used
[INFO] [stdout]  --> src/arrays/product_except_self.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/arrays/max_sub_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/arrays/max_profit.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_product` is never used
[INFO] [stdout]  --> src/arrays/max_product_sub_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min` is never used
[INFO] [stdout]  --> src/arrays/min_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/arrays/search_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]  --> src/arrays/three_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]  --> src/arrays/two_sum_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area` is never used
[INFO] [stdout]  --> src/arrays/container_with_most_water.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum_closest` is never used
[INFO] [stdout]  --> src/arrays/three_sum_closest.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_duplicates` is never used
[INFO] [stdout]   --> src/arrays/three_sum_closest.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/arrays/longest_substring_without_repeating_characters.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/arrays/longest_substring_without_repeating_characters.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/arrays/roman_to_integer.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `roman_to_int` is never used
[INFO] [stdout]  --> src/arrays/roman_to_integer.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]  --> src/sorting/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn insertion_sort(arr: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/insertion_sort.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/sorting/merge_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(arr: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/sorting/merge_sort.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn merge(left: &mut [i32], right: &mut [i32], arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]  --> src/sorting/quick_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn quick_sort(arr: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/quick_sort.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_sum` is never used
[INFO] [stdout]  --> src/binary/sum_of_two_integers.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn get_sum(a: i32, b: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hamming_weight` is never used
[INFO] [stdout]  --> src/binary/hamming_weight.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hamming_weight(n: u32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: static `DP` is never used
[INFO] [stdout]  --> src/dynamic_programming/climbing_stairs.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | static mut DP: [i32; 45] = [0; 45];
[INFO] [stdout]   |            ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> src/dynamic_programming/climbing_stairs.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/dynamic_programming/coin_change.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]   --> src/dynamic_programming/longest_increasing_subsequence.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_subsequence` is never used
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_path_sum` is never used
[INFO] [stdout]  --> src/dynamic_programming/minimum_path_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths` is never used
[INFO] [stdout]  --> src/dynamic_programming/unique_paths.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/add_two_numbers.rs:13:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |   #[inline]
[INFO] [stdout] 13 |   fn new(val: i32) -> Self {
[INFO] [stdout]    |      ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_lists/add_two_numbers.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/linked_lists/add_two_numbers.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/search/search_insert_position.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/search/search_insert_position.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 52 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `text1`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:35
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                   ^^^^^ help: if this is intentional, prefix it with an underscore: `_text1`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `text2`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:50
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                                  ^^^^^ help: if this is intentional, prefix it with an underscore: `_text2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `basket`
[INFO] [stdout]   --> src/main.rs:82:13
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_basket`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `max_fruits`
[INFO] [stdout]   --> src/main.rs:86:13
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `fruits`
[INFO] [stdout]   --> src/main.rs:81:20
[INFO] [stdout]    |
[INFO] [stdout] 81 | pub fn total_fruit(fruits: Vec<i32>) -> i32 {
[INFO] [stdout]    |                    ^^^^^^ help: if this is intentional, prefix it with an underscore: `_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |         ----^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:84:9
[INFO] [stdout]    |
[INFO] [stdout] 84 |     let mut left = 0;
[INFO] [stdout]    |         ----^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:85:9
[INFO] [stdout]    |
[INFO] [stdout] 85 |     let mut right = 1;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:86:9
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |         ----^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solutions` is never constructed
[INFO] [stdout]    --> src/main.rs:238:8
[INFO] [stdout]     |
[INFO] [stdout] 238 | struct Solutions;
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `is_symmetric_helper` are never used
[INFO] [stdout]    --> src/main.rs:240:12
[INFO] [stdout]     |
[INFO] [stdout] 239 | impl Solutions {
[INFO] [stdout]     | -------------- associated functions in this implementation
[INFO] [stdout] 240 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 249 |     fn is_symmetric_helper(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/arrays/max_profit.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_product` is never used
[INFO] [stdout]  --> src/arrays/max_product_sub_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]  --> src/arrays/three_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_duplicates` is never used
[INFO] [stdout]   --> src/arrays/three_sum_closest.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hamming_weight` is never used
[INFO] [stdout]  --> src/binary/hamming_weight.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hamming_weight(n: u32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_subsequence` is never used
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 22 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.23s
[INFO] running `Command { std: "docker" "inspect" "02993635ea97ba10423b922e44a3dcd2c86b7c01f6f09a7240cfd56f5b3a67d5", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "02993635ea97ba10423b922e44a3dcd2c86b7c01f6f09a7240cfd56f5b3a67d5", kill_on_drop: false }`
[INFO] [stdout] 02993635ea97ba10423b922e44a3dcd2c86b7c01f6f09a7240cfd56f5b3a67d5
[INFO] checking rjlacanlaled/rust-dsa 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%2Frjlacanlaled%2Frust-dsa" "/workspace/builds/worker-0-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/rjlacanlaled/rust-dsa 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/rjlacanlaled/rust-dsa
[INFO] finished tweaking git repo https://github.com/rjlacanlaled/rust-dsa
[INFO] tweaked toml for git repo https://github.com/rjlacanlaled/rust-dsa written to /workspace/builds/worker-0-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/rjlacanlaled/rust-dsa 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] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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] 5cd52272b229f9368db715f9e08119bfb98c0c7664002b855a6dbd15dbdfbe00
[INFO] running `Command { std: "docker" "start" "-a" "5cd52272b229f9368db715f9e08119bfb98c0c7664002b855a6dbd15dbdfbe00", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "5cd52272b229f9368db715f9e08119bfb98c0c7664002b855a6dbd15dbdfbe00", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "5cd52272b229f9368db715f9e08119bfb98c0c7664002b855a6dbd15dbdfbe00", kill_on_drop: false }`
[INFO] [stdout] 5cd52272b229f9368db715f9e08119bfb98c0c7664002b855a6dbd15dbdfbe00
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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] 632efe6d1376492e3f5e66131f69c29e44327457e358a43a0ca3a8323f81346c
[INFO] running `Command { std: "docker" "start" "-a" "632efe6d1376492e3f5e66131f69c29e44327457e358a43a0ca3a8323f81346c", kill_on_drop: false }`
[INFO] [stderr]     Checking rust-dsa v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::f32::INFINITY`
[INFO] [stdout]  --> src/dynamic_programming/minimum_path_sum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::f32::INFINITY;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::BorrowMut` and `ops::DerefMut`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:2:11
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::{borrow::BorrowMut, ops::DerefMut};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]    --> src/main.rs:163:5
[INFO] [stdout]     |
[INFO] [stdout] 163 | use std::borrow::BorrowMut;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::current`
[INFO] [stdout]    --> src/main.rs:268:5
[INFO] [stdout]     |
[INFO] [stdout] 268 | use std::thread::current;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::f32::INFINITY`
[INFO] [stdout]  --> src/dynamic_programming/minimum_path_sum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::f32::INFINITY;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::BorrowMut` and `ops::DerefMut`
[INFO] [stdout]  --> src/linked_lists/add_two_numbers.rs:2:11
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::{borrow::BorrowMut, ops::DerefMut};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]    --> src/main.rs:163:5
[INFO] [stdout]     |
[INFO] [stdout] 163 | use std::borrow::BorrowMut;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::current`
[INFO] [stdout]    --> src/main.rs:268:5
[INFO] [stdout]     |
[INFO] [stdout] 268 | use std::thread::current;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `text1`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:35
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                   ^^^^^ help: if this is intentional, prefix it with an underscore: `_text1`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `text2`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:50
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                                  ^^^^^ help: if this is intentional, prefix it with an underscore: `_text2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `basket`
[INFO] [stdout]   --> src/main.rs:82:13
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_basket`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `max_fruits`
[INFO] [stdout]   --> src/main.rs:86:13
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `fruits`
[INFO] [stdout]   --> src/main.rs:81:20
[INFO] [stdout]    |
[INFO] [stdout] 81 | pub fn total_fruit(fruits: Vec<i32>) -> i32 {
[INFO] [stdout]    |                    ^^^^^^ help: if this is intentional, prefix it with an underscore: `_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |         ----^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:84:9
[INFO] [stdout]    |
[INFO] [stdout] 84 |     let mut left = 0;
[INFO] [stdout]    |         ----^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:85:9
[INFO] [stdout]    |
[INFO] [stdout] 85 |     let mut right = 1;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:86:9
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |         ----^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solutions` is never constructed
[INFO] [stdout]    --> src/main.rs:238:8
[INFO] [stdout]     |
[INFO] [stdout] 238 | struct Solutions;
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `is_symmetric_helper` are never used
[INFO] [stdout]    --> src/main.rs:240:12
[INFO] [stdout]     |
[INFO] [stdout] 239 | impl Solutions {
[INFO] [stdout]     | -------------- associated functions in this implementation
[INFO] [stdout] 240 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 249 |     fn is_symmetric_helper(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_duplicate` is never used
[INFO] [stdout]  --> src/arrays/contains_duplicate.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `product_except_self` is never used
[INFO] [stdout]  --> src/arrays/product_except_self.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/arrays/max_sub_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/arrays/max_profit.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_product` is never used
[INFO] [stdout]  --> src/arrays/max_product_sub_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min` is never used
[INFO] [stdout]  --> src/arrays/min_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/arrays/search_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]  --> src/arrays/three_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]  --> src/arrays/two_sum_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area` is never used
[INFO] [stdout]  --> src/arrays/container_with_most_water.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum_closest` is never used
[INFO] [stdout]  --> src/arrays/three_sum_closest.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_duplicates` is never used
[INFO] [stdout]   --> src/arrays/three_sum_closest.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/arrays/longest_substring_without_repeating_characters.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/arrays/longest_substring_without_repeating_characters.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/arrays/roman_to_integer.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `roman_to_int` is never used
[INFO] [stdout]  --> src/arrays/roman_to_integer.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insertion_sort` is never used
[INFO] [stdout]  --> src/sorting/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn insertion_sort(arr: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/insertion_sort.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]  --> src/sorting/merge_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn merge_sort(arr: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]   --> src/sorting/merge_sort.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn merge(left: &mut [i32], right: &mut [i32], arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]  --> src/sorting/quick_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn quick_sort(arr: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]   --> src/sorting/quick_sort.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_sum` is never used
[INFO] [stdout]  --> src/binary/sum_of_two_integers.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn get_sum(a: i32, b: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hamming_weight` is never used
[INFO] [stdout]  --> src/binary/hamming_weight.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hamming_weight(n: u32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: static `DP` is never used
[INFO] [stdout]  --> src/dynamic_programming/climbing_stairs.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | static mut DP: [i32; 45] = [0; 45];
[INFO] [stdout]   |            ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> src/dynamic_programming/climbing_stairs.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/dynamic_programming/coin_change.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]   --> src/dynamic_programming/longest_increasing_subsequence.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_subsequence` is never used
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_path_sum` is never used
[INFO] [stdout]  --> src/dynamic_programming/minimum_path_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths` is never used
[INFO] [stdout]  --> src/dynamic_programming/unique_paths.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_lists/add_two_numbers.rs:13:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |   #[inline]
[INFO] [stdout] 13 |   fn new(val: i32) -> Self {
[INFO] [stdout]    |      ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/linked_lists/add_two_numbers.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/linked_lists/add_two_numbers.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/search/search_insert_position.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/search/search_insert_position.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[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/linked_lists/add_two_numbers.rs:25:15
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                            -------------------------  ------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout]    |                            |
[INFO] [stdout]    |                            these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 25 |         match (l1, l2) {
[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: aborting due to 1 previous error; 52 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `rust-dsa` (bin "rust-dsa") due to 2 previous errors; 52 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stdout] warning: unused variable: `text1`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:35
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                   ^^^^^ help: if this is intentional, prefix it with an underscore: `_text1`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `text2`
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:50
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]   |                                                  ^^^^^ help: if this is intentional, prefix it with an underscore: `_text2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `basket`
[INFO] [stdout]   --> src/main.rs:82:13
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_basket`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `max_fruits`
[INFO] [stdout]   --> src/main.rs:86:13
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `fruits`
[INFO] [stdout]   --> src/main.rs:81:20
[INFO] [stdout]    |
[INFO] [stdout] 81 | pub fn total_fruit(fruits: Vec<i32>) -> i32 {
[INFO] [stdout]    |                    ^^^^^^ help: if this is intentional, prefix it with an underscore: `_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let mut basket: HashMap<i32, i32> = HashMap::new();
[INFO] [stdout]    |         ----^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:84:9
[INFO] [stdout]    |
[INFO] [stdout] 84 |     let mut left = 0;
[INFO] [stdout]    |         ----^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:85:9
[INFO] [stdout]    |
[INFO] [stdout] 85 |     let mut right = 1;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/main.rs:86:9
[INFO] [stdout]    |
[INFO] [stdout] 86 |     let mut max_fruits = 0;
[INFO] [stdout]    |         ----^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solutions` is never constructed
[INFO] [stdout]    --> src/main.rs:238:8
[INFO] [stdout]     |
[INFO] [stdout] 238 | struct Solutions;
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `is_symmetric_helper` are never used
[INFO] [stdout]    --> src/main.rs:240:12
[INFO] [stdout]     |
[INFO] [stdout] 239 | impl Solutions {
[INFO] [stdout]     | -------------- associated functions in this implementation
[INFO] [stdout] 240 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 249 |     fn is_symmetric_helper(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/arrays/max_profit.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_product` is never used
[INFO] [stdout]  --> src/arrays/max_product_sub_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]  --> src/arrays/three_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_duplicates` is never used
[INFO] [stdout]   --> src/arrays/three_sum_closest.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `hamming_weight` is never used
[INFO] [stdout]  --> src/binary/hamming_weight.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn hamming_weight(n: u32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_subsequence` is never used
[INFO] [stdout]  --> src/dynamic_programming/longest_common_subsequence.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[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/linked_lists/add_two_numbers.rs:25:15
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                            -------------------------  ------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout]    |                            |
[INFO] [stdout]    |                            these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 25 |         match (l1, l2) {
[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: aborting due to 1 previous error; 22 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `rust-dsa` (bin "rust-dsa" test) due to 2 previous errors; 22 warnings emitted
[INFO] running `Command { std: "docker" "inspect" "632efe6d1376492e3f5e66131f69c29e44327457e358a43a0ca3a8323f81346c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "632efe6d1376492e3f5e66131f69c29e44327457e358a43a0ca3a8323f81346c", kill_on_drop: false }`
[INFO] [stdout] 632efe6d1376492e3f5e66131f69c29e44327457e358a43a0ca3a8323f81346c