[INFO] cloning repository https://github.com/dyylan99/algorithm_in_rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/dyylan99/algorithm_in_rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdyylan99%2Falgorithm_in_rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdyylan99%2Falgorithm_in_rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 798728c227945eda5dfdd40410f5376f73efc7be
[INFO] building dyylan99/algorithm_in_rust against master#11663cd3bfefef7d34e8f0892c250bf698049392+rustflags=-Dtail-expr-drop-order for pr-134523
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdyylan99%2Falgorithm_in_rust" "/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/dyylan99/algorithm_in_rust on toolchain 11663cd3bfefef7d34e8f0892c250bf698049392
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/dyylan99/algorithm_in_rust
[INFO] finished tweaking git repo https://github.com/dyylan99/algorithm_in_rust
[INFO] tweaked toml for git repo https://github.com/dyylan99/algorithm_in_rust written to /workspace/builds/worker-1-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/dyylan99/algorithm_in_rust already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 2afaabb3b0202d5ff39f3ada99abb0ebae84450a154fd82da5a27897d98fbf31
[INFO] running `Command { std: "docker" "start" "-a" "2afaabb3b0202d5ff39f3ada99abb0ebae84450a154fd82da5a27897d98fbf31", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "2afaabb3b0202d5ff39f3ada99abb0ebae84450a154fd82da5a27897d98fbf31", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "2afaabb3b0202d5ff39f3ada99abb0ebae84450a154fd82da5a27897d98fbf31", kill_on_drop: false }`
[INFO] [stdout] 2afaabb3b0202d5ff39f3ada99abb0ebae84450a154fd82da5a27897d98fbf31
[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 -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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 2d3ce811a2ab576942975d0829bf215c2a446d3d8f48697aae5c39f603d4c6ae
[INFO] running `Command { std: "docker" "start" "-a" "2d3ce811a2ab576942975d0829bf215c2a446d3d8f48697aae5c39f603d4c6ae", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithm v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `hash_map`
[INFO] [stdout]  --> src/string/group_anagrams.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{hash_map, HashMap};
[INFO] [stdout]   |                        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::hash`
[INFO] [stdout]  --> src/array/subarray_sum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::hash;
[INFO] [stdout]   |     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `hash::Hash`
[INFO] [stdout]  --> src/array/subarray_sum.rs:2:33
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::{collections::HashMap, hash::Hash};
[INFO] [stdout]   |                                 ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::Borrow`, `cell::RefCell`, and `rc::Rc`
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^  ^^^^^^^^^^^^^  ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::TreeNodeRef`
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::TreeNodeRef;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::tree_node::TreeNode`
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use super::tree_node::TreeNode;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/tree/sort_array.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/string/can_permute_palindrome.rs:19:25
[INFO] [stdout]    |
[INFO] [stdout] 19 |     map.iter().filter(|(k,v)| *v%2==1).count()<=1
[INFO] [stdout]    |                         ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `res` is never read
[INFO] [stdout]  --> src/array/max_sub_array.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |     let mut res=0;
[INFO] [stdout]   |             ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pond_sizes` is never used
[INFO] [stdout]  --> src/graph/pond_sizes.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn pond_sizes(land: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs` is never used
[INFO] [stdout]   --> src/graph/pond_sizes.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn dfs(land: &mut Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]  --> src/hashtable/two_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn two_sum(nums:Vec<i32>,target:i32)->Vec<i32>{
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_consecutive` is never used
[INFO] [stdout]  --> src/hashtable/longest_consecutive.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_permute_palindrome` is never used
[INFO] [stdout]   --> src/string/can_permute_palindrome.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn can_permute_palindrome(s:String)->bool{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_permutation` is never used
[INFO] [stdout]  --> src/string/check_permutation.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn check_permutation(s1: String, s2: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `one_edit_away` is never used
[INFO] [stdout]  --> src/string/one_edit_away.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn one_edit_away(first : String,second:String)->bool{
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `replace_spaces` is never used
[INFO] [stdout]  --> src/string/replace_spaces.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn replace_spaces(s: String, length: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/string/group_anagrams.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/string/length_of_longest_substring.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> src/string/is_palindrome.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_duplicate` is never used
[INFO] [stdout]   --> src/array/find_duplicate.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn find_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subarray_sum` is never used
[INFO] [stdout]  --> src/array/subarray_sum.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_zeroes` is never used
[INFO] [stdout]  --> src/array/move_zeroes.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/array/max_sub_array.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/dynamic/max_sub_array.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `level_order` is never used
[INFO] [stdout]   --> src/tree/level_order.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct Solution{
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `TreeNodeRef` is never used
[INFO] [stdout]  --> src/tree/flatten.rs:7:6
[INFO] [stdout]   |
[INFO] [stdout] 7 | type TreeNodeRef = Rc<RefCell<TreeNode>>;
[INFO] [stdout]   |      ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `flatten` is never used
[INFO] [stdout]  --> src/tree/flatten.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn flatten(root: &mut Option<TreeNodeRef>) {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/pond_sizes.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 |     if i < 0 || j < 0 || i >= land.len() || j >= land[0].len() || land[i][j] != 0 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/pond_sizes.rs:25:17
[INFO] [stdout]    |
[INFO] [stdout] 25 |     if i < 0 || j < 0 || i >= land.len() || j >= land[0].len() || land[i][j] != 0 {
[INFO] [stdout]    |                 ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `is_valid_BST` should have a snake case name
[INFO] [stdout]  --> src/tree/mod.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | mod is_valid_BST;
[INFO] [stdout]   |     ^^^^^^^^^^^^ help: convert the identifier to snake case: `is_valid_bst`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `heapSize` should have a snake case name
[INFO] [stdout]   --> src/tree/sort_array.rs:16:37
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn sift_down(nums:&mut Vec<i32>,heapSize:usize,mut k:usize){
[INFO] [stdout]    |                                     ^^^^^^^^ help: convert the identifier to snake case: `heap_size`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapSort` should have a snake case name
[INFO] [stdout]   --> src/tree/sort_array.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub fn heapSort( nums:&mut Vec<i32>){
[INFO] [stdout]    |        ^^^^^^^^ help: convert the identifier to snake case: `heap_sort`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.34s
[INFO] running `Command { std: "docker" "inspect" "2d3ce811a2ab576942975d0829bf215c2a446d3d8f48697aae5c39f603d4c6ae", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "2d3ce811a2ab576942975d0829bf215c2a446d3d8f48697aae5c39f603d4c6ae", kill_on_drop: false }`
[INFO] [stdout] 2d3ce811a2ab576942975d0829bf215c2a446d3d8f48697aae5c39f603d4c6ae
[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 -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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] eaf07d5682805b43352accc1dc1a631d07790474f6010511ad61c44dd5026f20
[INFO] running `Command { std: "docker" "start" "-a" "eaf07d5682805b43352accc1dc1a631d07790474f6010511ad61c44dd5026f20", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithm v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `hash_map`
[INFO] [stdout]  --> src/string/group_anagrams.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{hash_map, HashMap};
[INFO] [stdout]   |                        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::hash`
[INFO] [stdout]  --> src/array/subarray_sum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::hash;
[INFO] [stdout]   |     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `hash::Hash`
[INFO] [stdout]  --> src/array/subarray_sum.rs:2:33
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::{collections::HashMap, hash::Hash};
[INFO] [stdout]   |                                 ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::Borrow`, `cell::RefCell`, and `rc::Rc`
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^  ^^^^^^^^^^^^^  ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::TreeNodeRef`
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::TreeNodeRef;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::tree_node::TreeNode`
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use super::tree_node::TreeNode;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/tree/sort_array.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/string/can_permute_palindrome.rs:19:25
[INFO] [stdout]    |
[INFO] [stdout] 19 |     map.iter().filter(|(k,v)| *v%2==1).count()<=1
[INFO] [stdout]    |                         ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `res` is never read
[INFO] [stdout]  --> src/array/max_sub_array.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |     let mut res=0;
[INFO] [stdout]   |             ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `res`
[INFO] [stdout]   --> src/dynamic/can_partition.rs:27:9
[INFO] [stdout]    |
[INFO] [stdout] 27 |     let res=can_partition(nums);
[INFO] [stdout]    |         ^^^ help: if this is intentional, prefix it with an underscore: `_res`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]  --> src/hashtable/two_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn two_sum(nums:Vec<i32>,target:i32)->Vec<i32>{
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_permute_palindrome` is never used
[INFO] [stdout]   --> src/string/can_permute_palindrome.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn can_permute_palindrome(s:String)->bool{
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `one_edit_away` is never used
[INFO] [stdout]  --> src/string/one_edit_away.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn one_edit_away(first : String,second:String)->bool{
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> src/string/is_palindrome.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_duplicate` is never used
[INFO] [stdout]   --> src/array/find_duplicate.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn find_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_zeroes` is never used
[INFO] [stdout]  --> src/array/move_zeroes.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/array/max_sub_array.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/dynamic/max_sub_array.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/tree/is_valid_BST.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct Solution{
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `TreeNodeRef` is never used
[INFO] [stdout]  --> src/tree/flatten.rs:7:6
[INFO] [stdout]   |
[INFO] [stdout] 7 | type TreeNodeRef = Rc<RefCell<TreeNode>>;
[INFO] [stdout]   |      ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `flatten` is never used
[INFO] [stdout]  --> src/tree/flatten.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn flatten(root: &mut Option<TreeNodeRef>) {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/pond_sizes.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 |     if i < 0 || j < 0 || i >= land.len() || j >= land[0].len() || land[i][j] != 0 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/graph/pond_sizes.rs:25:17
[INFO] [stdout]    |
[INFO] [stdout] 25 |     if i < 0 || j < 0 || i >= land.len() || j >= land[0].len() || land[i][j] != 0 {
[INFO] [stdout]    |                 ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `is_valid_BST` should have a snake case name
[INFO] [stdout]  --> src/tree/mod.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | mod is_valid_BST;
[INFO] [stdout]   |     ^^^^^^^^^^^^ help: convert the identifier to snake case: `is_valid_bst`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `heapSize` should have a snake case name
[INFO] [stdout]   --> src/tree/sort_array.rs:16:37
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn sift_down(nums:&mut Vec<i32>,heapSize:usize,mut k:usize){
[INFO] [stdout]    |                                     ^^^^^^^^ help: convert the identifier to snake case: `heap_size`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapSort` should have a snake case name
[INFO] [stdout]   --> src/tree/sort_array.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub fn heapSort( nums:&mut Vec<i32>){
[INFO] [stdout]    |        ^^^^^^^^ help: convert the identifier to snake case: `heap_sort`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.99s
[INFO] running `Command { std: "docker" "inspect" "eaf07d5682805b43352accc1dc1a631d07790474f6010511ad61c44dd5026f20", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "eaf07d5682805b43352accc1dc1a631d07790474f6010511ad61c44dd5026f20", kill_on_drop: false }`
[INFO] [stdout] eaf07d5682805b43352accc1dc1a631d07790474f6010511ad61c44dd5026f20