[INFO] cloning repository https://github.com/marverlous811/100-days-rust-agorithms [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/marverlous811/100-days-rust-agorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] c4076129b8c28b929eb0419020952ebf8ef7d215 [INFO] testing marverlous811/100-days-rust-agorithms/c4076129b8c28b929eb0419020952ebf8ef7d215 against master#595316b4006932405a63862d8fe65f71a6356293 for pr-128254 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms" "/workspace/builds/worker-2-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/marverlous811/100-days-rust-agorithms on toolchain 595316b4006932405a63862d8fe65f71a6356293 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+595316b4006932405a63862d8fe65f71a6356293" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/marverlous811/100-days-rust-agorithms [INFO] finished tweaking git repo https://github.com/marverlous811/100-days-rust-agorithms [INFO] tweaked toml for git repo https://github.com/marverlous811/100-days-rust-agorithms written to /workspace/builds/worker-2-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/marverlous811/100-days-rust-agorithms 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" "+595316b4006932405a63862d8fe65f71a6356293" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+595316b4006932405a63862d8fe65f71a6356293" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 0b22945c20b16d3adccec9ee31acfe8a3e4e6124a49b9c8244fb95ae08e65b87 [INFO] running `Command { std: "docker" "start" "-a" "0b22945c20b16d3adccec9ee31acfe8a3e4e6124a49b9c8244fb95ae08e65b87", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "0b22945c20b16d3adccec9ee31acfe8a3e4e6124a49b9c8244fb95ae08e65b87", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "0b22945c20b16d3adccec9ee31acfe8a3e4e6124a49b9c8244fb95ae08e65b87", kill_on_drop: false }` [INFO] [stdout] 0b22945c20b16d3adccec9ee31acfe8a3e4e6124a49b9c8244fb95ae08e65b87 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+595316b4006932405a63862d8fe65f71a6356293" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 69c1f41e2b215f6f2fd6de28822fd5809d93a06ed3a857a58fff525af5c051bc [INFO] running `Command { std: "docker" "start" "-a" "69c1f41e2b215f6f2fd6de28822fd5809d93a06ed3a857a58fff525af5c051bc", kill_on_drop: false }` [INFO] [stderr] Compiling leetcode-100-days-challenge v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stdout] --> src/common/binary_tree.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/day_13/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::vec` [INFO] [stdout] --> src/day_16/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::vec; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/day_34/mod.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/day_39/mod.rs:1:26 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/day_34/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_38/mod.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: variable does not need to be mutable [INFO] [stdout] --> src/day_26/mod.rs:51:7 [INFO] [stdout] | [INFO] [stdout] 51 | let mut target = word.clone().chars().collect::>(); [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: value assigned to `res` is never read [INFO] [stdout] --> src/day_48/mod.rs:5:11 [INFO] [stdout] | [INFO] [stdout] 5 | let mut res = 1; [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 `binary_search` is never used [INFO] [stdout] --> src/common/search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `read_i32_input_from_file` is never used [INFO] [stdout] --> src/helper/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_insert` is never used [INFO] [stdout] --> src/day_1/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_profit` is never used [INFO] [stdout] --> src/day_10/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `two_sum` is never used [INFO] [stdout] --> src/day_11/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_two_lists` is never used [INFO] [stdout] --> src/day_12/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `has_cycle` is never used [INFO] [stdout] --> src/day_13/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn has_cycle(root: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_intersection_node` is never used [INFO] [stdout] --> src/day_14/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn get_intersection_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reserve_linked_list` is never used [INFO] [stdout] --> src/day_15/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn reserve_linked_list(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_palindrome` is never used [INFO] [stdout] --> src/day_16/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid` is never used [INFO] [stdout] --> src/day_17/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes` is never used [INFO] [stdout] --> src/day_18/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes_optz` is never used [INFO] [stdout] --> src/day_18/mod.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn move_zeroes_optz(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number` is never used [INFO] [stdout] --> src/day_19/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number_optz` is never used [INFO] [stdout] --> src/day_19/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn single_number_optz(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal_vec` is never used [INFO] [stdout] --> src/day_2/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal_vec(root: Option>>, data: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_2/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `ez_majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `letter_combinations` is never used [INFO] [stdout] --> src/day_21/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parenthesis_dfs` is never used [INFO] [stdout] --> src/day_22/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_parenthesis` is never used [INFO] [stdout] --> src/day_22/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generator` is never used [INFO] [stdout] --> src/day_23/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn generator(candidates: Vec, target: i32, start: i32, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `combination_sum` is never used [INFO] [stdout] --> src/day_23/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_24/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack(nums: &mut Vec, left: usize, right: usize, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `permute` is never used [INFO] [stdout] --> src/day_24/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_25/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn backtrack(nums: Vec, size: usize, start: usize, tmp: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subsets` is never used [INFO] [stdout] --> src/day_25/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_26/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exist` is never used [INFO] [stdout] --> src/day_26/mod.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_str_palindrome` is never used [INFO] [stdout] --> src/day_27/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_str_palindrome(s: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack_partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> src/day_28/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_28/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn find_pivot(nums: &Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/day_28/mod.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_range` is never used [INFO] [stdout] --> src/day_29/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_mirror` is never used [INFO] [stdout] --> src/day_3/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn is_mirror(left: Option>>, right: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_symmetric` is never used [INFO] [stdout] --> src/day_3/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_matrix` is never used [INFO] [stdout] --> src/day_30/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_31/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find_pivot(nums: &Vec, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min` is never used [INFO] [stdout] --> src/day_31/mod.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bst_dfs_validate` is never used [INFO] [stdout] --> src/day_32/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn bst_dfs_validate(root: Option>>, left: Option, right: Option) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid_bst` is never used [INFO] [stdout] --> src/day_32/mod.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_level_travesal` is never used [INFO] [stdout] --> src/day_33/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn dfs_level_travesal(root: Option>>, level: i32, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `level_order` is never used [INFO] [stdout] --> src/day_33/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static `PRE_IDX` is never used [INFO] [stdout] --> src/day_34/mod.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | static mut PRE_IDX: i32 = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_helper` is never used [INFO] [stdout] --> src/day_34/mod.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn build_tree_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree` is never used [INFO] [stdout] --> src/day_34/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder_traverse` is never used [INFO] [stdout] --> src/day_35/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn preorder_traverse(root: Option>>, v: &mut Vec>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `flatten` is never used [INFO] [stdout] --> src/day_35/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view_tranversal` is never used [INFO] [stdout] --> src/day_36/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn right_side_view_tranversal(root: Option>>, level: usize, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view` is never used [INFO] [stdout] --> src/day_36/mod.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_37/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal(root: Option>>, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `kth_smallest` is never used [INFO] [stdout] --> src/day_37/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_path` is never used [INFO] [stdout] --> src/day_38/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn find_path( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `debug_print` is never used [INFO] [stdout] --> src/day_38/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/day_38/mod.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_traversal` is never used [INFO] [stdout] --> src/day_39/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn sum_traversal(root: Option>>, target: i64, sum: &mut i64, res: &mut i32) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `path_sum` is never used [INFO] [stdout] --> src/day_39/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_depth` is never used [INFO] [stdout] --> src/day_4/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_palindrome` is never used [INFO] [stdout] --> src/day_40/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `number_unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_cost_path` is never used [INFO] [stdout] --> src/day_42/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn min_cost_path(grid: Vec>, m: i32, n: i32, memo: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_path_sum` is never used [INFO] [stdout] --> src/day_42/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `edit_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `word_break` is never used [INFO] [stdout] --> src/day_44/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_product` is never used [INFO] [stdout] --> src/day_45/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob_through` is never used [INFO] [stdout] --> src/day_46/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn rob_through(nums: &Vec, n: i32, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob` is never used [INFO] [stdout] --> src/day_46/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_squares` is never used [INFO] [stdout] --> src/day_47/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn num_squares(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recursive` is never used [INFO] [stdout] --> src/day_48/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `memoization` is never used [INFO] [stdout] --> src/day_48/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn memoization(nums: &Vec, idx: i32, prev_idx: i32, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_lis` is never used [INFO] [stdout] --> src/day_48/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `coin_change` is never used [INFO] [stdout] --> src/day_49/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst_helper` is never used [INFO] [stdout] --> src/day_5/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn sorted_array_to_bst_helper(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst` is never used [INFO] [stdout] --> src/day_5/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subset_sum` is never used [INFO] [stdout] --> src/day_50/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn subset_sum(nums: &Vec, target: i32, idx: i32, dp: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_partition` is never used [INFO] [stdout] --> src/day_50/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lcs` is never used [INFO] [stdout] --> src/day_51/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_subsequence` is never used [INFO] [stdout] --> src/day_51/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_safe` is never used [INFO] [stdout] --> src/day_52/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn is_safe(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/day_52/mod.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn dfs(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_islands` is never used [INFO] [stdout] --> src/day_52/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_cyclic` is never used [INFO] [stdout] --> src/day_53/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn is_cyclic(course: i32, graph: &HashMap>, visited: &mut Vec, rec_stack: &mut Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_finish` is never used [INFO] [stdout] --> src/day_53/mod.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `oranges_rotting` is never used [INFO] [stdout] --> src/day_54/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn oranges_rotting(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump_through` is never used [INFO] [stdout] --> src/day_55/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn jump_through(nums: &Vec, curr: usize, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump` is never used [INFO] [stdout] --> src/day_55/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `invert_tree` is never used [INFO] [stdout] --> src/day_6/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `diameter_of_binary_tree` is never used [INFO] [stdout] --> src/day_7/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `fibonachi` is never used [INFO] [stdout] --> src/day_8/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn fibonachi(n: i32, memo: &mut HashMap) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb_stairs` is never used [INFO] [stdout] --> src/day_8/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `next_vec` is never used [INFO] [stdout] --> src/day_9/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn next_vec(pre_vec: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate` is never used [INFO] [stdout] --> src/day_9/mod.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 106 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.20s [INFO] running `Command { std: "docker" "inspect" "69c1f41e2b215f6f2fd6de28822fd5809d93a06ed3a857a58fff525af5c051bc", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "69c1f41e2b215f6f2fd6de28822fd5809d93a06ed3a857a58fff525af5c051bc", kill_on_drop: false }` [INFO] [stdout] 69c1f41e2b215f6f2fd6de28822fd5809d93a06ed3a857a58fff525af5c051bc [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+595316b4006932405a63862d8fe65f71a6356293" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 8f3bef8094ae7538095ef0e6c40a5cd76091507e4a0c6cbdfa98c42a2570bf6b [INFO] running `Command { std: "docker" "start" "-a" "8f3bef8094ae7538095ef0e6c40a5cd76091507e4a0c6cbdfa98c42a2570bf6b", kill_on_drop: false }` [INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stdout] --> src/common/binary_tree.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/day_13/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::vec` [INFO] [stdout] --> src/day_16/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::vec; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/day_34/mod.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/day_39/mod.rs:1:26 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/day_34/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_38/mod.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: variable does not need to be mutable [INFO] [stdout] --> src/day_26/mod.rs:51:7 [INFO] [stdout] | [INFO] [stdout] 51 | let mut target = word.clone().chars().collect::>(); [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: value assigned to `res` is never read [INFO] [stdout] --> src/day_48/mod.rs:5:11 [INFO] [stdout] | [INFO] [stdout] 5 | let mut res = 1; [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 `binary_search` is never used [INFO] [stdout] --> src/common/search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `read_i32_input_from_file` is never used [INFO] [stdout] --> src/helper/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_insert` is never used [INFO] [stdout] --> src/day_1/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_profit` is never used [INFO] [stdout] --> src/day_10/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `two_sum` is never used [INFO] [stdout] --> src/day_11/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_two_lists` is never used [INFO] [stdout] --> src/day_12/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `has_cycle` is never used [INFO] [stdout] --> src/day_13/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn has_cycle(root: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_intersection_node` is never used [INFO] [stdout] --> src/day_14/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn get_intersection_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reserve_linked_list` is never used [INFO] [stdout] --> src/day_15/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn reserve_linked_list(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_palindrome` is never used [INFO] [stdout] --> src/day_16/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid` is never used [INFO] [stdout] --> src/day_17/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes` is never used [INFO] [stdout] --> src/day_18/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes_optz` is never used [INFO] [stdout] --> src/day_18/mod.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn move_zeroes_optz(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number` is never used [INFO] [stdout] --> src/day_19/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number_optz` is never used [INFO] [stdout] --> src/day_19/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn single_number_optz(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal_vec` is never used [INFO] [stdout] --> src/day_2/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal_vec(root: Option>>, data: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_2/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `ez_majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `letter_combinations` is never used [INFO] [stdout] --> src/day_21/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parenthesis_dfs` is never used [INFO] [stdout] --> src/day_22/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_parenthesis` is never used [INFO] [stdout] --> src/day_22/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generator` is never used [INFO] [stdout] --> src/day_23/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn generator(candidates: Vec, target: i32, start: i32, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `combination_sum` is never used [INFO] [stdout] --> src/day_23/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_24/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack(nums: &mut Vec, left: usize, right: usize, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `permute` is never used [INFO] [stdout] --> src/day_24/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_25/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn backtrack(nums: Vec, size: usize, start: usize, tmp: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subsets` is never used [INFO] [stdout] --> src/day_25/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_26/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exist` is never used [INFO] [stdout] --> src/day_26/mod.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_str_palindrome` is never used [INFO] [stdout] --> src/day_27/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_str_palindrome(s: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack_partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> src/day_28/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_28/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn find_pivot(nums: &Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/day_28/mod.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_range` is never used [INFO] [stdout] --> src/day_29/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_mirror` is never used [INFO] [stdout] --> src/day_3/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn is_mirror(left: Option>>, right: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_symmetric` is never used [INFO] [stdout] --> src/day_3/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_matrix` is never used [INFO] [stdout] --> src/day_30/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_31/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find_pivot(nums: &Vec, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min` is never used [INFO] [stdout] --> src/day_31/mod.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bst_dfs_validate` is never used [INFO] [stdout] --> src/day_32/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn bst_dfs_validate(root: Option>>, left: Option, right: Option) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid_bst` is never used [INFO] [stdout] --> src/day_32/mod.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_level_travesal` is never used [INFO] [stdout] --> src/day_33/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn dfs_level_travesal(root: Option>>, level: i32, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `level_order` is never used [INFO] [stdout] --> src/day_33/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static `PRE_IDX` is never used [INFO] [stdout] --> src/day_34/mod.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | static mut PRE_IDX: i32 = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_helper` is never used [INFO] [stdout] --> src/day_34/mod.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn build_tree_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree` is never used [INFO] [stdout] --> src/day_34/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder_traverse` is never used [INFO] [stdout] --> src/day_35/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn preorder_traverse(root: Option>>, v: &mut Vec>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `flatten` is never used [INFO] [stdout] --> src/day_35/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view_tranversal` is never used [INFO] [stdout] --> src/day_36/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn right_side_view_tranversal(root: Option>>, level: usize, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view` is never used [INFO] [stdout] --> src/day_36/mod.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_37/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal(root: Option>>, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `kth_smallest` is never used [INFO] [stdout] --> src/day_37/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_path` is never used [INFO] [stdout] --> src/day_38/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn find_path( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `debug_print` is never used [INFO] [stdout] --> src/day_38/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/day_38/mod.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_traversal` is never used [INFO] [stdout] --> src/day_39/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn sum_traversal(root: Option>>, target: i64, sum: &mut i64, res: &mut i32) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `path_sum` is never used [INFO] [stdout] --> src/day_39/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_depth` is never used [INFO] [stdout] --> src/day_4/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_palindrome` is never used [INFO] [stdout] --> src/day_40/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `number_unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_cost_path` is never used [INFO] [stdout] --> src/day_42/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn min_cost_path(grid: Vec>, m: i32, n: i32, memo: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_path_sum` is never used [INFO] [stdout] --> src/day_42/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `edit_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `word_break` is never used [INFO] [stdout] --> src/day_44/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_product` is never used [INFO] [stdout] --> src/day_45/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob_through` is never used [INFO] [stdout] --> src/day_46/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn rob_through(nums: &Vec, n: i32, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob` is never used [INFO] [stdout] --> src/day_46/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_squares` is never used [INFO] [stdout] --> src/day_47/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn num_squares(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recursive` is never used [INFO] [stdout] --> src/day_48/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `memoization` is never used [INFO] [stdout] --> src/day_48/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn memoization(nums: &Vec, idx: i32, prev_idx: i32, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_lis` is never used [INFO] [stdout] --> src/day_48/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `coin_change` is never used [INFO] [stdout] --> src/day_49/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst_helper` is never used [INFO] [stdout] --> src/day_5/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn sorted_array_to_bst_helper(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst` is never used [INFO] [stdout] --> src/day_5/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subset_sum` is never used [INFO] [stdout] --> src/day_50/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn subset_sum(nums: &Vec, target: i32, idx: i32, dp: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_partition` is never used [INFO] [stdout] --> src/day_50/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lcs` is never used [INFO] [stdout] --> src/day_51/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_subsequence` is never used [INFO] [stdout] --> src/day_51/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_safe` is never used [INFO] [stdout] --> src/day_52/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn is_safe(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/day_52/mod.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn dfs(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_islands` is never used [INFO] [stdout] --> src/day_52/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_cyclic` is never used [INFO] [stdout] --> src/day_53/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn is_cyclic(course: i32, graph: &HashMap>, visited: &mut Vec, rec_stack: &mut Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_finish` is never used [INFO] [stdout] --> src/day_53/mod.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `oranges_rotting` is never used [INFO] [stdout] --> src/day_54/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn oranges_rotting(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump_through` is never used [INFO] [stdout] --> src/day_55/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn jump_through(nums: &Vec, curr: usize, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump` is never used [INFO] [stdout] --> src/day_55/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `invert_tree` is never used [INFO] [stdout] --> src/day_6/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `diameter_of_binary_tree` is never used [INFO] [stdout] --> src/day_7/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `fibonachi` is never used [INFO] [stdout] --> src/day_8/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn fibonachi(n: i32, memo: &mut HashMap) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb_stairs` is never used [INFO] [stdout] --> src/day_8/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `next_vec` is never used [INFO] [stdout] --> src/day_9/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn next_vec(pre_vec: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling leetcode-100-days-challenge v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: function `generate` is never used [INFO] [stdout] --> src/day_9/mod.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 106 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stdout] --> src/common/binary_tree.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `env` and `path::Path` [INFO] [stdout] --> src/day_10/mod.rs:19:13 [INFO] [stdout] | [INFO] [stdout] 19 | use std::{env, fs::read_to_string, path::Path}; [INFO] [stdout] | ^^^ ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/day_13/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/day_34/mod.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/day_39/mod.rs:1:26 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_6/mod.rs:21:13 [INFO] [stdout] | [INFO] [stdout] 21 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/day_34/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_38/mod.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: variable does not need to be mutable [INFO] [stdout] --> src/day_26/mod.rs:51:7 [INFO] [stdout] | [INFO] [stdout] 51 | let mut target = word.clone().chars().collect::>(); [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: value assigned to `res` is never read [INFO] [stdout] --> src/day_48/mod.rs:5:11 [INFO] [stdout] | [INFO] [stdout] 5 | let mut res = 1; [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 `ez_majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `debug_print` is never used [INFO] [stdout] --> src/day_38/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recursive` is never used [INFO] [stdout] --> src/day_48/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lcs` is never used [INFO] [stdout] --> src/day_51/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 14 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.89s [INFO] running `Command { std: "docker" "inspect" "8f3bef8094ae7538095ef0e6c40a5cd76091507e4a0c6cbdfa98c42a2570bf6b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8f3bef8094ae7538095ef0e6c40a5cd76091507e4a0c6cbdfa98c42a2570bf6b", kill_on_drop: false }` [INFO] [stdout] 8f3bef8094ae7538095ef0e6c40a5cd76091507e4a0c6cbdfa98c42a2570bf6b [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+595316b4006932405a63862d8fe65f71a6356293" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 59ff1cb1a33a9a417bc1394542c95e8ee313f3bcfa402cdfb864a45701cbc728 [INFO] running `Command { std: "docker" "start" "-a" "59ff1cb1a33a9a417bc1394542c95e8ee313f3bcfa402cdfb864a45701cbc728", kill_on_drop: false }` [INFO] [stderr] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stderr] --> src/common/binary_tree.rs:1:11 [INFO] [stderr] | [INFO] [stderr] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::cell::RefCell` [INFO] [stderr] --> src/day_13/mod.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::cell::RefCell; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::vec` [INFO] [stderr] --> src/day_16/mod.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::vec; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::collections::HashSet` [INFO] [stderr] --> src/day_34/mod.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use std::collections::HashSet; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `collections::HashMap` [INFO] [stderr] --> src/day_39/mod.rs:1:26 [INFO] [stderr] | [INFO] [stderr] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::borrow::BorrowMut` [INFO] [stderr] --> src/day_34/mod.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::borrow::BorrowMut; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `borrow::Borrow` [INFO] [stderr] --> src/day_38/mod.rs:1:11 [INFO] [stderr] | [INFO] [stderr] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/day_26/mod.rs:51:7 [INFO] [stderr] | [INFO] [stderr] 51 | let mut target = word.clone().chars().collect::>(); [INFO] [stderr] | ----^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: value assigned to `res` is never read [INFO] [stderr] --> src/day_48/mod.rs:5:11 [INFO] [stderr] | [INFO] [stderr] 5 | let mut res = 1; [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `binary_search` is never used [INFO] [stderr] --> src/common/search.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn binary_search(nums: &Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `read_i32_input_from_file` is never used [INFO] [stderr] --> src/helper/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search_insert` is never used [INFO] [stderr] --> src/day_1/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `max_profit` is never used [INFO] [stderr] --> src/day_10/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `two_sum` is never used [INFO] [stderr] --> src/day_11/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `merge_two_lists` is never used [INFO] [stderr] --> src/day_12/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `has_cycle` is never used [INFO] [stderr] --> src/day_13/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn has_cycle(root: Option>) -> bool { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `get_intersection_node` is never used [INFO] [stderr] --> src/day_14/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn get_intersection_node( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `reserve_linked_list` is never used [INFO] [stderr] --> src/day_15/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn reserve_linked_list(root: Option>>) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_palindrome` is never used [INFO] [stderr] --> src/day_16/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_valid` is never used [INFO] [stderr] --> src/day_17/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn is_valid(s: String) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `move_zeroes` is never used [INFO] [stderr] --> src/day_18/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `move_zeroes_optz` is never used [INFO] [stderr] --> src/day_18/mod.rs:25:8 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn move_zeroes_optz(nums: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `single_number` is never used [INFO] [stderr] --> src/day_19/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `single_number_optz` is never used [INFO] [stderr] --> src/day_19/mod.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | pub fn single_number_optz(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `inorder_traversal_vec` is never used [INFO] [stderr] --> src/day_2/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn inorder_traversal_vec(root: Option>>, data: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `inorder_traversal` is never used [INFO] [stderr] --> src/day_2/mod.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `majority_element` is never used [INFO] [stderr] --> src/day_20/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `ez_majority_element` is never used [INFO] [stderr] --> src/day_20/mod.rs:32:4 [INFO] [stderr] | [INFO] [stderr] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `letter_combinations` is never used [INFO] [stderr] --> src/day_21/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `parenthesis_dfs` is never used [INFO] [stderr] --> src/day_22/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `generate_parenthesis` is never used [INFO] [stderr] --> src/day_22/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `generator` is never used [INFO] [stderr] --> src/day_23/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn generator(candidates: Vec, target: i32, start: i32, path: &mut Vec, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `combination_sum` is never used [INFO] [stderr] --> src/day_23/mod.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack` is never used [INFO] [stderr] --> src/day_24/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn backtrack(nums: &mut Vec, left: usize, right: usize, result: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `permute` is never used [INFO] [stderr] --> src/day_24/mod.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack` is never used [INFO] [stderr] --> src/day_25/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn backtrack(nums: Vec, size: usize, start: usize, tmp: &mut Vec, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `subsets` is never used [INFO] [stderr] --> src/day_25/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack` is never used [INFO] [stderr] --> src/day_26/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn backtrack( [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `exist` is never used [INFO] [stderr] --> src/day_26/mod.rs:50:8 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_str_palindrome` is never used [INFO] [stderr] --> src/day_27/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn is_str_palindrome(s: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack_partition` is never used [INFO] [stderr] --> src/day_27/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `partition` is never used [INFO] [stderr] --> src/day_27/mod.rs:35:8 [INFO] [stderr] | [INFO] [stderr] 35 | pub fn partition(s: String) -> Vec> { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `binary_search` is never used [INFO] [stderr] --> src/day_28/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn binary_search(nums: &Vec, target: i32, low: i32, high: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_pivot` is never used [INFO] [stderr] --> src/day_28/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn find_pivot(nums: &Vec, low: i32, high: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search` is never used [INFO] [stderr] --> src/day_28/mod.rs:43:8 [INFO] [stderr] | [INFO] [stderr] 43 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search_range` is never used [INFO] [stderr] --> src/day_29/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_mirror` is never used [INFO] [stderr] --> src/day_3/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn is_mirror(left: Option>>, right: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_symmetric` is never used [INFO] [stderr] --> src/day_3/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search_matrix` is never used [INFO] [stderr] --> src/day_30/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_pivot` is never used [INFO] [stderr] --> src/day_31/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn find_pivot(nums: &Vec, left: i32, right: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_min` is never used [INFO] [stderr] --> src/day_31/mod.rs:31:8 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `bst_dfs_validate` is never used [INFO] [stderr] --> src/day_32/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn bst_dfs_validate(root: Option>>, left: Option, right: Option) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_valid_bst` is never used [INFO] [stderr] --> src/day_32/mod.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `dfs_level_travesal` is never used [INFO] [stderr] --> src/day_33/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn dfs_level_travesal(root: Option>>, level: i32, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `level_order` is never used [INFO] [stderr] --> src/day_33/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: static `PRE_IDX` is never used [INFO] [stderr] --> src/day_34/mod.rs:7:12 [INFO] [stderr] | [INFO] [stderr] 7 | static mut PRE_IDX: i32 = 0; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `build_tree_helper` is never used [INFO] [stderr] --> src/day_34/mod.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | pub fn build_tree_helper( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `build_tree` is never used [INFO] [stderr] --> src/day_34/mod.rs:42:8 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `preorder_traverse` is never used [INFO] [stderr] --> src/day_35/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn preorder_traverse(root: Option>>, v: &mut Vec>>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `flatten` is never used [INFO] [stderr] --> src/day_35/mod.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn flatten(root: &mut Option>>) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `right_side_view_tranversal` is never used [INFO] [stderr] --> src/day_36/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn right_side_view_tranversal(root: Option>>, level: usize, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `right_side_view` is never used [INFO] [stderr] --> src/day_36/mod.rs:16:8 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `inorder_traversal` is never used [INFO] [stderr] --> src/day_37/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn inorder_traversal(root: Option>>, res: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `kth_smallest` is never used [INFO] [stderr] --> src/day_37/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_path` is never used [INFO] [stderr] --> src/day_38/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn find_path( [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `debug_print` is never used [INFO] [stderr] --> src/day_38/mod.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `lowest_common_ancestor` is never used [INFO] [stderr] --> src/day_38/mod.rs:46:8 [INFO] [stderr] | [INFO] [stderr] 46 | pub fn lowest_common_ancestor( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sum_traversal` is never used [INFO] [stderr] --> src/day_39/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn sum_traversal(root: Option>>, target: i64, sum: &mut i64, res: &mut i32) { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `path_sum` is never used [INFO] [stderr] --> src/day_39/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `max_depth` is never used [INFO] [stderr] --> src/day_4/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `longest_palindrome` is never used [INFO] [stderr] --> src/day_40/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn longest_palindrome(s: String) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `number_unique_paths` is never used [INFO] [stderr] --> src/day_41/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `unique_paths` is never used [INFO] [stderr] --> src/day_41/mod.rs:14:8 [INFO] [stderr] | [INFO] [stderr] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `min_cost_path` is never used [INFO] [stderr] --> src/day_42/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn min_cost_path(grid: Vec>, m: i32, n: i32, memo: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `min_path_sum` is never used [INFO] [stderr] --> src/day_42/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `edit_distance` is never used [INFO] [stderr] --> src/day_43/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `min_distance` is never used [INFO] [stderr] --> src/day_43/mod.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 30 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `word_break` is never used [INFO] [stderr] --> src/day_44/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `max_product` is never used [INFO] [stderr] --> src/day_45/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `rob_through` is never used [INFO] [stderr] --> src/day_46/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn rob_through(nums: &Vec, n: i32, dp: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `rob` is never used [INFO] [stderr] --> src/day_46/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn rob(nums: Vec) -> i32 { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `num_squares` is never used [INFO] [stderr] --> src/day_47/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn num_squares(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `recursive` is never used [INFO] [stderr] --> src/day_48/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `memoization` is never used [INFO] [stderr] --> src/day_48/mod.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn memoization(nums: &Vec, idx: i32, prev_idx: i32, dp: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `length_of_lis` is never used [INFO] [stderr] --> src/day_48/mod.rs:42:8 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `coin_change` is never used [INFO] [stderr] --> src/day_49/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sorted_array_to_bst_helper` is never used [INFO] [stderr] --> src/day_5/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn sorted_array_to_bst_helper(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sorted_array_to_bst` is never used [INFO] [stderr] --> src/day_5/mod.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `subset_sum` is never used [INFO] [stderr] --> src/day_50/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn subset_sum(nums: &Vec, target: i32, idx: i32, dp: &mut Vec>) -> bool { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `can_partition` is never used [INFO] [stderr] --> src/day_50/mod.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `lcs` is never used [INFO] [stderr] --> src/day_51/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `longest_common_subsequence` is never used [INFO] [stderr] --> src/day_51/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_safe` is never used [INFO] [stderr] --> src/day_52/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn is_safe(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) -> bool { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `dfs` is never used [INFO] [stderr] --> src/day_52/mod.rs:10:4 [INFO] [stderr] | [INFO] [stderr] 10 | fn dfs(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `num_islands` is never used [INFO] [stderr] --> src/day_52/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_cyclic` is never used [INFO] [stderr] --> src/day_53/mod.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn is_cyclic(course: i32, graph: &HashMap>, visited: &mut Vec, rec_stack: &mut Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `can_finish` is never used [INFO] [stderr] --> src/day_53/mod.rs:23:8 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `oranges_rotting` is never used [INFO] [stderr] --> src/day_54/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn oranges_rotting(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `jump_through` is never used [INFO] [stderr] --> src/day_55/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn jump_through(nums: &Vec, curr: usize, dp: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `jump` is never used [INFO] [stderr] --> src/day_55/mod.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | pub fn jump(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `invert_tree` is never used [INFO] [stderr] --> src/day_6/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `diameter_of_binary_tree` is never used [INFO] [stderr] --> src/day_7/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `fibonachi` is never used [INFO] [stderr] --> src/day_8/mod.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn fibonachi(n: i32, memo: &mut HashMap) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `climb_stairs` is never used [INFO] [stderr] --> src/day_8/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `next_vec` is never used [INFO] [stderr] --> src/day_9/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn next_vec(pre_vec: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `generate` is never used [INFO] [stderr] --> src/day_9/mod.rs:10:8 [INFO] [stderr] | [INFO] [stderr] 10 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `leetcode-100-days-challenge` (lib) generated 106 warnings (run `cargo fix --lib -p leetcode-100-days-challenge` to apply 6 suggestions) [INFO] [stderr] warning: unused imports: `env` and `path::Path` [INFO] [stderr] --> src/day_10/mod.rs:19:13 [INFO] [stderr] | [INFO] [stderr] 19 | use std::{env, fs::read_to_string, path::Path}; [INFO] [stderr] | ^^^ ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `borrow::Borrow` [INFO] [stderr] --> src/day_6/mod.rs:21:13 [INFO] [stderr] | [INFO] [stderr] 21 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `ez_majority_element` is never used [INFO] [stderr] --> src/day_20/mod.rs:32:4 [INFO] [stderr] | [INFO] [stderr] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `leetcode-100-days-challenge` (lib test) generated 14 warnings (11 duplicates) (run `cargo fix --lib -p leetcode-100-days-challenge --tests` to apply 2 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.01s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/leetcode_100_days_challenge-09351c2439b17593) [INFO] [stdout] [INFO] [stdout] running 164 tests [INFO] [stdout] test day_10::test::max_profit_example_1 ... ok [INFO] [stdout] test day_10::test::max_profit_example_2 ... ok [INFO] [stdout] test day_11::tests::example_2_two_sum ... ok [INFO] [stdout] test day_11::tests::example_1_two_sum ... ok [INFO] [stdout] test day_11::tests::example_3_two_sum ... ok [INFO] [stdout] test day_12::test::merge_two_lists_example_1 ... ok [INFO] [stdout] test day_12::test::merge_two_lists_example_2 ... ok [INFO] [stdout] test day_12::test::merge_two_lists_example_3 ... ok [INFO] [stdout] test day_13::test::has_cycle_example_1 ... ok [INFO] [stdout] test day_14::test::get_intersection_node_example_1 ... ok [INFO] [stdout] test day_14::test::get_intersection_node_example_2 ... ok [INFO] [stdout] test day_14::test::get_intersection_node_example_3 ... ok [INFO] [stdout] test day_13::test::has_cycle_example_3 ... ok [INFO] [stdout] test day_15::test::reserve_linked_list_test_2 ... ok [INFO] [stdout] test day_15::test::reserve_linked_list_test_3 ... ok [INFO] [stdout] test day_16::test::test_is_palindrome_1 ... ok [INFO] [stdout] test day_15::test::reserve_linked_list_test_1 ... ok [INFO] [stdout] test day_18::tests::test_move_zeroes_1 ... ok [INFO] [stdout] test day_17::test::test_is_valid ... ok [INFO] [stdout] test day_16::test::test_is_palindrome_2 ... ok [INFO] [stdout] test day_18::tests::test_move_zeroes_2 ... ok [INFO] [stdout] test day_19::test::single_number_test_1 ... ok [INFO] [stdout] test day_1::tests::example_1_search_insert ... ok [INFO] [stdout] test day_19::test::single_number_test_2 ... ok [INFO] [stdout] test day_1::tests::example_2_search_insert ... ok [INFO] [stdout] test day_1::tests::example_3_search_insert ... ok [INFO] [stdout] test day_19::test::single_number_test_3 ... ok [INFO] [stdout] test day_1::tests::example_5_search_insert ... ok [INFO] [stdout] test day_23::test::example_3 ... ok [INFO] [stdout] test day_20::test::majority_element_test ... ok [INFO] [stdout] test day_23::test::example_2 ... ok [INFO] [stdout] test day_1::tests::example_4_search_insert ... ok [INFO] [stdout] test day_23::test::example_1 ... ok [INFO] [stdout] test day_21::test::test_letter_combinations ... ok [INFO] [stdout] test day_22::test::test_generate_parenthesis ... ok [INFO] [stdout] test day_24::tests::test_permute_2 ... ok [INFO] [stdout] test day_24::tests::test_permute_1 ... ok [INFO] [stdout] test day_24::tests::test_permute_3 ... ok [INFO] [stdout] test day_25::test::test_subsets_2 ... ok [INFO] [stdout] test day_26::test::test_exist_1 ... ok [INFO] [stdout] test day_26::test::test_exist_2 ... ok [INFO] [stdout] test day_26::test::test_exist_3 ... ok [INFO] [stdout] test day_25::test::test_subsets ... ok [INFO] [stdout] test day_26::test::test_exist_4 ... ok [INFO] [stdout] test day_27::test::test_partition_1 ... ok [INFO] [stdout] test day_27::test::test_partition_2 ... ok [INFO] [stdout] test day_28::tests::test_search_2 ... ok [INFO] [stdout] test day_28::tests::test_search ... ok [INFO] [stdout] test day_28::tests::test_search_3 ... ok [INFO] [stdout] test day_28::tests::test_search_4 ... ok [INFO] [stdout] test day_28::tests::test_search_5 ... ok [INFO] [stdout] test day_2::test::example_1_inorder_traversal ... ok [INFO] [stdout] test day_2::test::example_2_inorder_traversal ... ok [INFO] [stdout] test day_2::test::example_3_inorder_traversal ... ok [INFO] [stdout] test day_29::test::test_search_range ... ok [INFO] [stdout] test day_30::test::test_search_matrix ... ok [INFO] [stdout] test day_30::test::test_search_matrix_4 ... ok [INFO] [stdout] test day_30::test::test_search_matrix_3 ... ok [INFO] [stdout] test day_31::test::test_find_min_2 ... ok [INFO] [stdout] test day_31::test::test_find_min ... ok [INFO] [stdout] test day_30::test::test_search_matrix_2 ... ok [INFO] [stdout] test day_31::test::test_find_min_3 ... ok [INFO] [stdout] test day_31::test::test_find_min_4 ... ok [INFO] [stdout] test day_31::test::test_find_min_5 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_2 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_3 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_4 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_5 ... ok [INFO] [stdout] test day_33::test::test_level_order ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst ... ok [INFO] [stdout] test day_33::test::test_level_order_3 ... ok [INFO] [stdout] test day_33::test::test_level_order_2 ... ok [INFO] [stdout] test day_35::test::test_flatten_2 ... ok [INFO] [stdout] test day_34::test::test_build_tree ... ok [INFO] [stdout] test day_35::test::test_flatten ... ok [INFO] [stdout] test day_36::test::example_2 ... ok [INFO] [stdout] test day_34::test::test_build_tree_2 ... ok [INFO] [stdout] test day_36::test::example_3 ... ok [INFO] [stdout] test day_35::test::test_flatten_3 ... ok [INFO] [stdout] test day_37::test::example_1 ... ok [INFO] [stdout] test day_37::test::example_2 ... ok [INFO] [stdout] test day_36::test::example_1 ... ok [INFO] [stdout] test day_38::test::example_2 ... ok [INFO] [stdout] test day_38::test::example_3 ... ok [INFO] [stdout] test day_39::test::example_1 ... ok [INFO] [stdout] test day_38::test::example_1 ... ok [INFO] [stdout] test day_36::test::example_4 ... ok [INFO] [stdout] test day_39::test::example_2 ... ok [INFO] [stdout] test day_40::test::example_1 ... ok [INFO] [stdout] test day_40::test::example_2 ... ok [INFO] [stdout] test day_40::test::example_4 ... ok [INFO] [stdout] test day_3::test::example_2_is_symmetric ... ok [INFO] [stdout] test day_40::test::exmaple_3 ... ok [INFO] [stdout] test day_3::test::example_1_is_symmetric ... ok [INFO] [stdout] test day_41::test::example_1 ... ok [INFO] [stdout] test day_41::test::example_3 ... ok [INFO] [stdout] test day_41::test::example_2 ... ok [INFO] [stdout] test day_39::test::example_3 ... ok [INFO] [stdout] test day_40::test::example_5 ... ok [INFO] [stdout] test day_42::test::test_min_path_sum ... ok [INFO] [stdout] test day_41::test::example_5 ... ok [INFO] [stdout] test day_43::test::test_min_distance ... ok [INFO] [stdout] test day_41::test::example_4 ... ok [INFO] [stdout] test day_42::test::test_min_path_sum_2 ... ok [INFO] [stdout] test day_43::test::test_min_distance_2 ... ok [INFO] [stdout] test day_44::test::example_1 ... ok [INFO] [stdout] test day_44::test::example_3 ... ok [INFO] [stdout] test day_45::test::example_1 ... ok [INFO] [stdout] test day_44::test::example_2 ... ok [INFO] [stdout] test day_45::test::example_2 ... ok [INFO] [stdout] test day_45::test::example_3 ... ok [INFO] [stdout] test day_46::test::example_1 ... ok [INFO] [stdout] test day_45::test::example_4 ... ok [INFO] [stdout] test day_46::test::example_2 ... ok [INFO] [stdout] test day_46::test::example_3 ... ok [INFO] [stdout] test day_46::test::example_4 ... ok [INFO] [stdout] test day_46::test::example_5 ... ok [INFO] [stdout] test day_43::test::test_min_distance_3 ... ok [INFO] [stdout] test day_42::test::test_min_path_sum_3 ... ok [INFO] [stdout] test day_45::test::example_6 ... ok [INFO] [stdout] test day_47::test::example_3 ... ok [INFO] [stdout] test day_47::test::example_1 ... ok [INFO] [stdout] test day_47::test::example_5 ... ok [INFO] [stdout] test day_48::test::example_1 ... ok [INFO] [stdout] test day_48::test::example_2 ... ok [INFO] [stdout] test day_47::test::example_4 ... ok [INFO] [stdout] test day_48::test::example_3 ... ok [INFO] [stdout] test day_49::test::example_1 ... ok [INFO] [stdout] test day_47::test::example_2 ... ok [INFO] [stdout] test day_49::test::example_3 ... ok [INFO] [stdout] test day_4::test::example_1_max_depth ... ok [INFO] [stdout] test day_49::test::example_4 ... ok [INFO] [stdout] test day_49::test::example_2 ... ok [INFO] [stdout] test day_50::tests::example_1 ... ok [INFO] [stdout] test day_4::test::example_2_max_depth ... ok [INFO] [stdout] test day_51::test::example_2 ... ok [INFO] [stdout] test day_51::test::example_3 ... ok [INFO] [stdout] test day_51::test::example_1 ... ok [INFO] [stdout] test day_50::tests::example_2 ... ok [INFO] [stdout] test day_52::test::example_1 ... ok [INFO] [stdout] test day_53::test::example_1 ... ok [INFO] [stdout] test day_52::test::example_3 ... ok [INFO] [stdout] test day_52::test::example_2 ... ok [INFO] [stdout] test day_54::test::example_1 ... ok [INFO] [stdout] test day_53::test::example_2 ... ok [INFO] [stdout] test day_54::test::example_3 ... ok [INFO] [stdout] test day_54::test::example_2 ... ok [INFO] [stdout] test day_55::test::example_1 ... ok [INFO] [stdout] test day_5::test::example_1_sorted_array_to_bst ... ok [INFO] [stdout] test day_5::test::example_2_sorted_array_to_bst ... ok [INFO] [stdout] test day_45::test::example_5 ... ok [INFO] [stdout] test day_55::test::example_2 ... ok [INFO] [stdout] test day_6::test::example_1_invert_tree ... ok [INFO] [stdout] test day_6::test::example_2_invert_tree ... ok [INFO] [stdout] test day_6::test::example_3_invert_tree ... ok [INFO] [stdout] test day_7::test::example_2 ... ok [INFO] [stdout] test day_7::test::example_1 ... ok [INFO] [stdout] test day_8::tests::test_climb_stairs ... ok [INFO] [stdout] test day_8::tests::test_climb_stairs_2 ... ok [INFO] [stdout] test day_9::test::test_1_generate ... ok [INFO] [stdout] test day_9::test::test_2_generate ... ok [INFO] [stdout] test day_10::test::max_profit_example_3 ... ok [INFO] [stdout] test day_48::test::example_4 ... ok [INFO] [stdout] test day_51::test::example_4 ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 164 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 40.81s [INFO] [stdout] [INFO] [stderr] Doc-tests leetcode_100_days_challenge [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "59ff1cb1a33a9a417bc1394542c95e8ee313f3bcfa402cdfb864a45701cbc728", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "59ff1cb1a33a9a417bc1394542c95e8ee313f3bcfa402cdfb864a45701cbc728", kill_on_drop: false }` [INFO] [stdout] 59ff1cb1a33a9a417bc1394542c95e8ee313f3bcfa402cdfb864a45701cbc728 [INFO] testing marverlous811/100-days-rust-agorithms/c4076129b8c28b929eb0419020952ebf8ef7d215 against try#5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b for pr-128254 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/marverlous811/100-days-rust-agorithms on toolchain 5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/marverlous811/100-days-rust-agorithms [INFO] finished tweaking git repo https://github.com/marverlous811/100-days-rust-agorithms [INFO] tweaked toml for git repo https://github.com/marverlous811/100-days-rust-agorithms written to /workspace/builds/worker-2-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/marverlous811/100-days-rust-agorithms 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" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 8205c0251c1721360c97dbc341c0f14358673356c1c8bb39e727543b00e748e4 [INFO] running `Command { std: "docker" "start" "-a" "8205c0251c1721360c97dbc341c0f14358673356c1c8bb39e727543b00e748e4", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "8205c0251c1721360c97dbc341c0f14358673356c1c8bb39e727543b00e748e4", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8205c0251c1721360c97dbc341c0f14358673356c1c8bb39e727543b00e748e4", kill_on_drop: false }` [INFO] [stdout] 8205c0251c1721360c97dbc341c0f14358673356c1c8bb39e727543b00e748e4 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] b06d8493e0dd353af759aaafa81fe71977e05eab3464919888632e459aaf0a1c [INFO] running `Command { std: "docker" "start" "-a" "b06d8493e0dd353af759aaafa81fe71977e05eab3464919888632e459aaf0a1c", kill_on_drop: false }` [INFO] [stderr] Compiling leetcode-100-days-challenge v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stdout] --> src/common/binary_tree.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/day_13/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::vec` [INFO] [stdout] --> src/day_16/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::vec; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/day_34/mod.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/day_39/mod.rs:1:26 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/day_34/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_38/mod.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: variable does not need to be mutable [INFO] [stdout] --> src/day_26/mod.rs:51:7 [INFO] [stdout] | [INFO] [stdout] 51 | let mut target = word.clone().chars().collect::>(); [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: value assigned to `res` is never read [INFO] [stdout] --> src/day_48/mod.rs:5:11 [INFO] [stdout] | [INFO] [stdout] 5 | let mut res = 1; [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 `binary_search` is never used [INFO] [stdout] --> src/common/search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `read_i32_input_from_file` is never used [INFO] [stdout] --> src/helper/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_insert` is never used [INFO] [stdout] --> src/day_1/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_profit` is never used [INFO] [stdout] --> src/day_10/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `two_sum` is never used [INFO] [stdout] --> src/day_11/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_two_lists` is never used [INFO] [stdout] --> src/day_12/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `has_cycle` is never used [INFO] [stdout] --> src/day_13/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn has_cycle(root: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_intersection_node` is never used [INFO] [stdout] --> src/day_14/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn get_intersection_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reserve_linked_list` is never used [INFO] [stdout] --> src/day_15/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn reserve_linked_list(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_palindrome` is never used [INFO] [stdout] --> src/day_16/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid` is never used [INFO] [stdout] --> src/day_17/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes` is never used [INFO] [stdout] --> src/day_18/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes_optz` is never used [INFO] [stdout] --> src/day_18/mod.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn move_zeroes_optz(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number` is never used [INFO] [stdout] --> src/day_19/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number_optz` is never used [INFO] [stdout] --> src/day_19/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn single_number_optz(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal_vec` is never used [INFO] [stdout] --> src/day_2/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal_vec(root: Option>>, data: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_2/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `ez_majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `letter_combinations` is never used [INFO] [stdout] --> src/day_21/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parenthesis_dfs` is never used [INFO] [stdout] --> src/day_22/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_parenthesis` is never used [INFO] [stdout] --> src/day_22/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generator` is never used [INFO] [stdout] --> src/day_23/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn generator(candidates: Vec, target: i32, start: i32, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `combination_sum` is never used [INFO] [stdout] --> src/day_23/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_24/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack(nums: &mut Vec, left: usize, right: usize, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `permute` is never used [INFO] [stdout] --> src/day_24/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_25/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn backtrack(nums: Vec, size: usize, start: usize, tmp: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subsets` is never used [INFO] [stdout] --> src/day_25/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_26/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exist` is never used [INFO] [stdout] --> src/day_26/mod.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_str_palindrome` is never used [INFO] [stdout] --> src/day_27/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_str_palindrome(s: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack_partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> src/day_28/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_28/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn find_pivot(nums: &Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/day_28/mod.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_range` is never used [INFO] [stdout] --> src/day_29/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_mirror` is never used [INFO] [stdout] --> src/day_3/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn is_mirror(left: Option>>, right: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_symmetric` is never used [INFO] [stdout] --> src/day_3/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_matrix` is never used [INFO] [stdout] --> src/day_30/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_31/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find_pivot(nums: &Vec, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min` is never used [INFO] [stdout] --> src/day_31/mod.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bst_dfs_validate` is never used [INFO] [stdout] --> src/day_32/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn bst_dfs_validate(root: Option>>, left: Option, right: Option) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid_bst` is never used [INFO] [stdout] --> src/day_32/mod.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_level_travesal` is never used [INFO] [stdout] --> src/day_33/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn dfs_level_travesal(root: Option>>, level: i32, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `level_order` is never used [INFO] [stdout] --> src/day_33/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static `PRE_IDX` is never used [INFO] [stdout] --> src/day_34/mod.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | static mut PRE_IDX: i32 = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_helper` is never used [INFO] [stdout] --> src/day_34/mod.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn build_tree_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree` is never used [INFO] [stdout] --> src/day_34/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder_traverse` is never used [INFO] [stdout] --> src/day_35/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn preorder_traverse(root: Option>>, v: &mut Vec>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `flatten` is never used [INFO] [stdout] --> src/day_35/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view_tranversal` is never used [INFO] [stdout] --> src/day_36/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn right_side_view_tranversal(root: Option>>, level: usize, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view` is never used [INFO] [stdout] --> src/day_36/mod.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_37/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal(root: Option>>, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `kth_smallest` is never used [INFO] [stdout] --> src/day_37/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_path` is never used [INFO] [stdout] --> src/day_38/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn find_path( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `debug_print` is never used [INFO] [stdout] --> src/day_38/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/day_38/mod.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_traversal` is never used [INFO] [stdout] --> src/day_39/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn sum_traversal(root: Option>>, target: i64, sum: &mut i64, res: &mut i32) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `path_sum` is never used [INFO] [stdout] --> src/day_39/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_depth` is never used [INFO] [stdout] --> src/day_4/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_palindrome` is never used [INFO] [stdout] --> src/day_40/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `number_unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_cost_path` is never used [INFO] [stdout] --> src/day_42/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn min_cost_path(grid: Vec>, m: i32, n: i32, memo: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_path_sum` is never used [INFO] [stdout] --> src/day_42/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `edit_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `word_break` is never used [INFO] [stdout] --> src/day_44/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_product` is never used [INFO] [stdout] --> src/day_45/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob_through` is never used [INFO] [stdout] --> src/day_46/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn rob_through(nums: &Vec, n: i32, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob` is never used [INFO] [stdout] --> src/day_46/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_squares` is never used [INFO] [stdout] --> src/day_47/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn num_squares(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recursive` is never used [INFO] [stdout] --> src/day_48/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `memoization` is never used [INFO] [stdout] --> src/day_48/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn memoization(nums: &Vec, idx: i32, prev_idx: i32, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_lis` is never used [INFO] [stdout] --> src/day_48/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `coin_change` is never used [INFO] [stdout] --> src/day_49/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst_helper` is never used [INFO] [stdout] --> src/day_5/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn sorted_array_to_bst_helper(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst` is never used [INFO] [stdout] --> src/day_5/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subset_sum` is never used [INFO] [stdout] --> src/day_50/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn subset_sum(nums: &Vec, target: i32, idx: i32, dp: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_partition` is never used [INFO] [stdout] --> src/day_50/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lcs` is never used [INFO] [stdout] --> src/day_51/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_subsequence` is never used [INFO] [stdout] --> src/day_51/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_safe` is never used [INFO] [stdout] --> src/day_52/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn is_safe(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/day_52/mod.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn dfs(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_islands` is never used [INFO] [stdout] --> src/day_52/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_cyclic` is never used [INFO] [stdout] --> src/day_53/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn is_cyclic(course: i32, graph: &HashMap>, visited: &mut Vec, rec_stack: &mut Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_finish` is never used [INFO] [stdout] --> src/day_53/mod.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `oranges_rotting` is never used [INFO] [stdout] --> src/day_54/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn oranges_rotting(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump_through` is never used [INFO] [stdout] --> src/day_55/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn jump_through(nums: &Vec, curr: usize, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump` is never used [INFO] [stdout] --> src/day_55/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `invert_tree` is never used [INFO] [stdout] --> src/day_6/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `diameter_of_binary_tree` is never used [INFO] [stdout] --> src/day_7/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `fibonachi` is never used [INFO] [stdout] --> src/day_8/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn fibonachi(n: i32, memo: &mut HashMap) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb_stairs` is never used [INFO] [stdout] --> src/day_8/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `next_vec` is never used [INFO] [stdout] --> src/day_9/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn next_vec(pre_vec: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate` is never used [INFO] [stdout] --> src/day_9/mod.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 106 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.17s [INFO] running `Command { std: "docker" "inspect" "b06d8493e0dd353af759aaafa81fe71977e05eab3464919888632e459aaf0a1c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "b06d8493e0dd353af759aaafa81fe71977e05eab3464919888632e459aaf0a1c", kill_on_drop: false }` [INFO] [stdout] b06d8493e0dd353af759aaafa81fe71977e05eab3464919888632e459aaf0a1c [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 558231b5ee52e71daa047c70f3321cbd7c6568945635fcdae6e07ff6ac945c19 [INFO] running `Command { std: "docker" "start" "-a" "558231b5ee52e71daa047c70f3321cbd7c6568945635fcdae6e07ff6ac945c19", kill_on_drop: false }` [INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stdout] --> src/common/binary_tree.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/day_13/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::vec` [INFO] [stdout] --> src/day_16/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::vec; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/day_34/mod.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/day_39/mod.rs:1:26 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/day_34/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_38/mod.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: variable does not need to be mutable [INFO] [stdout] --> src/day_26/mod.rs:51:7 [INFO] [stdout] | [INFO] [stdout] 51 | let mut target = word.clone().chars().collect::>(); [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: value assigned to `res` is never read [INFO] [stdout] --> src/day_48/mod.rs:5:11 [INFO] [stdout] | [INFO] [stdout] 5 | let mut res = 1; [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 `binary_search` is never used [INFO] [stdout] --> src/common/search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `read_i32_input_from_file` is never used [INFO] [stdout] --> src/helper/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_insert` is never used [INFO] [stdout] --> src/day_1/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_profit` is never used [INFO] [stdout] --> src/day_10/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `two_sum` is never used [INFO] [stdout] --> src/day_11/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_two_lists` is never used [INFO] [stdout] --> src/day_12/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `has_cycle` is never used [INFO] [stdout] --> src/day_13/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn has_cycle(root: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_intersection_node` is never used [INFO] [stdout] --> src/day_14/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn get_intersection_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reserve_linked_list` is never used [INFO] [stdout] --> src/day_15/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn reserve_linked_list(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_palindrome` is never used [INFO] [stdout] --> src/day_16/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid` is never used [INFO] [stdout] --> src/day_17/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes` is never used [INFO] [stdout] --> src/day_18/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_zeroes_optz` is never used [INFO] [stdout] --> src/day_18/mod.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn move_zeroes_optz(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number` is never used [INFO] [stdout] --> src/day_19/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `single_number_optz` is never used [INFO] [stdout] --> src/day_19/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn single_number_optz(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal_vec` is never used [INFO] [stdout] --> src/day_2/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal_vec(root: Option>>, data: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_2/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `ez_majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `letter_combinations` is never used [INFO] [stdout] --> src/day_21/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parenthesis_dfs` is never used [INFO] [stdout] --> src/day_22/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_parenthesis` is never used [INFO] [stdout] --> src/day_22/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generator` is never used [INFO] [stdout] --> src/day_23/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn generator(candidates: Vec, target: i32, start: i32, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `combination_sum` is never used [INFO] [stdout] --> src/day_23/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_24/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack(nums: &mut Vec, left: usize, right: usize, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `permute` is never used [INFO] [stdout] --> src/day_24/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_25/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn backtrack(nums: Vec, size: usize, start: usize, tmp: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subsets` is never used [INFO] [stdout] --> src/day_25/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/day_26/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exist` is never used [INFO] [stdout] --> src/day_26/mod.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_str_palindrome` is never used [INFO] [stdout] --> src/day_27/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_str_palindrome(s: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack_partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/day_27/mod.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> src/day_28/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn binary_search(nums: &Vec, target: i32, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_28/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn find_pivot(nums: &Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/day_28/mod.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_range` is never used [INFO] [stdout] --> src/day_29/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_mirror` is never used [INFO] [stdout] --> src/day_3/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn is_mirror(left: Option>>, right: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_symmetric` is never used [INFO] [stdout] --> src/day_3/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_matrix` is never used [INFO] [stdout] --> src/day_30/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_pivot` is never used [INFO] [stdout] --> src/day_31/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find_pivot(nums: &Vec, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min` is never used [INFO] [stdout] --> src/day_31/mod.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bst_dfs_validate` is never used [INFO] [stdout] --> src/day_32/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn bst_dfs_validate(root: Option>>, left: Option, right: Option) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid_bst` is never used [INFO] [stdout] --> src/day_32/mod.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_level_travesal` is never used [INFO] [stdout] --> src/day_33/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn dfs_level_travesal(root: Option>>, level: i32, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `level_order` is never used [INFO] [stdout] --> src/day_33/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static `PRE_IDX` is never used [INFO] [stdout] --> src/day_34/mod.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | static mut PRE_IDX: i32 = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_helper` is never used [INFO] [stdout] --> src/day_34/mod.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn build_tree_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree` is never used [INFO] [stdout] --> src/day_34/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder_traverse` is never used [INFO] [stdout] --> src/day_35/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn preorder_traverse(root: Option>>, v: &mut Vec>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `flatten` is never used [INFO] [stdout] --> src/day_35/mod.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view_tranversal` is never used [INFO] [stdout] --> src/day_36/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn right_side_view_tranversal(root: Option>>, level: usize, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_side_view` is never used [INFO] [stdout] --> src/day_36/mod.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder_traversal` is never used [INFO] [stdout] --> src/day_37/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn inorder_traversal(root: Option>>, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `kth_smallest` is never used [INFO] [stdout] --> src/day_37/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_path` is never used [INFO] [stdout] --> src/day_38/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn find_path( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `debug_print` is never used [INFO] [stdout] --> src/day_38/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/day_38/mod.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_traversal` is never used [INFO] [stdout] --> src/day_39/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn sum_traversal(root: Option>>, target: i64, sum: &mut i64, res: &mut i32) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `path_sum` is never used [INFO] [stdout] --> src/day_39/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_depth` is never used [INFO] [stdout] --> src/day_4/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_palindrome` is never used [INFO] [stdout] --> src/day_40/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `number_unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `unique_paths` is never used [INFO] [stdout] --> src/day_41/mod.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_cost_path` is never used [INFO] [stdout] --> src/day_42/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn min_cost_path(grid: Vec>, m: i32, n: i32, memo: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_path_sum` is never used [INFO] [stdout] --> src/day_42/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `edit_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_distance` is never used [INFO] [stdout] --> src/day_43/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `word_break` is never used [INFO] [stdout] --> src/day_44/mod.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_product` is never used [INFO] [stdout] --> src/day_45/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob_through` is never used [INFO] [stdout] --> src/day_46/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn rob_through(nums: &Vec, n: i32, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob` is never used [INFO] [stdout] --> src/day_46/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_squares` is never used [INFO] [stdout] --> src/day_47/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn num_squares(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recursive` is never used [INFO] [stdout] --> src/day_48/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `memoization` is never used [INFO] [stdout] --> src/day_48/mod.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn memoization(nums: &Vec, idx: i32, prev_idx: i32, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_lis` is never used [INFO] [stdout] --> src/day_48/mod.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `coin_change` is never used [INFO] [stdout] --> src/day_49/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst_helper` is never used [INFO] [stdout] --> src/day_5/mod.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn sorted_array_to_bst_helper(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_array_to_bst` is never used [INFO] [stdout] --> src/day_5/mod.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subset_sum` is never used [INFO] [stdout] --> src/day_50/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn subset_sum(nums: &Vec, target: i32, idx: i32, dp: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_partition` is never used [INFO] [stdout] --> src/day_50/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lcs` is never used [INFO] [stdout] --> src/day_51/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_subsequence` is never used [INFO] [stdout] --> src/day_51/mod.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_safe` is never used [INFO] [stdout] --> src/day_52/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn is_safe(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/day_52/mod.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn dfs(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num_islands` is never used [INFO] [stdout] --> src/day_52/mod.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_cyclic` is never used [INFO] [stdout] --> src/day_53/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn is_cyclic(course: i32, graph: &HashMap>, visited: &mut Vec, rec_stack: &mut Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_finish` is never used [INFO] [stdout] --> src/day_53/mod.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `oranges_rotting` is never used [INFO] [stdout] --> src/day_54/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn oranges_rotting(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump_through` is never used [INFO] [stdout] --> src/day_55/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn jump_through(nums: &Vec, curr: usize, dp: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `jump` is never used [INFO] [stdout] --> src/day_55/mod.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `invert_tree` is never used [INFO] [stdout] --> src/day_6/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling leetcode-100-days-challenge v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: function `diameter_of_binary_tree` is never used [INFO] [stdout] --> src/day_7/mod.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `fibonachi` is never used [INFO] [stdout] --> src/day_8/mod.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn fibonachi(n: i32, memo: &mut HashMap) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb_stairs` is never used [INFO] [stdout] --> src/day_8/mod.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `next_vec` is never used [INFO] [stdout] --> src/day_9/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn next_vec(pre_vec: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate` is never used [INFO] [stdout] --> src/day_9/mod.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 106 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stdout] --> src/common/binary_tree.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `env` and `path::Path` [INFO] [stdout] --> src/day_10/mod.rs:19:13 [INFO] [stdout] | [INFO] [stdout] 19 | use std::{env, fs::read_to_string, path::Path}; [INFO] [stdout] | ^^^ ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/day_13/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/day_34/mod.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/day_39/mod.rs:1:26 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_6/mod.rs:21:13 [INFO] [stdout] | [INFO] [stdout] 21 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/day_34/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/day_38/mod.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: variable does not need to be mutable [INFO] [stdout] --> src/day_26/mod.rs:51:7 [INFO] [stdout] | [INFO] [stdout] 51 | let mut target = word.clone().chars().collect::>(); [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: value assigned to `res` is never read [INFO] [stdout] --> src/day_48/mod.rs:5:11 [INFO] [stdout] | [INFO] [stdout] 5 | let mut res = 1; [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 `ez_majority_element` is never used [INFO] [stdout] --> src/day_20/mod.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `debug_print` is never used [INFO] [stdout] --> src/day_38/mod.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recursive` is never used [INFO] [stdout] --> src/day_48/mod.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lcs` is never used [INFO] [stdout] --> src/day_51/mod.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 14 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.70s [INFO] running `Command { std: "docker" "inspect" "558231b5ee52e71daa047c70f3321cbd7c6568945635fcdae6e07ff6ac945c19", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "558231b5ee52e71daa047c70f3321cbd7c6568945635fcdae6e07ff6ac945c19", kill_on_drop: false }` [INFO] [stdout] 558231b5ee52e71daa047c70f3321cbd7c6568945635fcdae6e07ff6ac945c19 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] f954f7d22825356ce3d01581c2c32ea7757690fe1c56a709083227dba649dc89 [INFO] running `Command { std: "docker" "start" "-a" "f954f7d22825356ce3d01581c2c32ea7757690fe1c56a709083227dba649dc89", kill_on_drop: false }` [INFO] [stderr] warning: unused imports: `borrow::Borrow` and `clone` [INFO] [stderr] --> src/common/binary_tree.rs:1:11 [INFO] [stderr] | [INFO] [stderr] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^ ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::cell::RefCell` [INFO] [stderr] --> src/day_13/mod.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::cell::RefCell; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::vec` [INFO] [stderr] --> src/day_16/mod.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::vec; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::collections::HashSet` [INFO] [stderr] --> src/day_34/mod.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use std::collections::HashSet; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `collections::HashMap` [INFO] [stderr] --> src/day_39/mod.rs:1:26 [INFO] [stderr] | [INFO] [stderr] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::borrow::BorrowMut` [INFO] [stderr] --> src/day_34/mod.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::borrow::BorrowMut; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `borrow::Borrow` [INFO] [stderr] --> src/day_38/mod.rs:1:11 [INFO] [stderr] | [INFO] [stderr] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/day_26/mod.rs:51:7 [INFO] [stderr] | [INFO] [stderr] 51 | let mut target = word.clone().chars().collect::>(); [INFO] [stderr] | ----^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: value assigned to `res` is never read [INFO] [stderr] --> src/day_48/mod.rs:5:11 [INFO] [stderr] | [INFO] [stderr] 5 | let mut res = 1; [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `binary_search` is never used [INFO] [stderr] --> src/common/search.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn binary_search(nums: &Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `read_i32_input_from_file` is never used [INFO] [stderr] --> src/helper/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search_insert` is never used [INFO] [stderr] --> src/day_1/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `max_profit` is never used [INFO] [stderr] --> src/day_10/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `two_sum` is never used [INFO] [stderr] --> src/day_11/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `merge_two_lists` is never used [INFO] [stderr] --> src/day_12/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `has_cycle` is never used [INFO] [stderr] --> src/day_13/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn has_cycle(root: Option>) -> bool { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `get_intersection_node` is never used [INFO] [stderr] --> src/day_14/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn get_intersection_node( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `reserve_linked_list` is never used [INFO] [stderr] --> src/day_15/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn reserve_linked_list(root: Option>>) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_palindrome` is never used [INFO] [stderr] --> src/day_16/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_valid` is never used [INFO] [stderr] --> src/day_17/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn is_valid(s: String) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `move_zeroes` is never used [INFO] [stderr] --> src/day_18/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `move_zeroes_optz` is never used [INFO] [stderr] --> src/day_18/mod.rs:25:8 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn move_zeroes_optz(nums: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `single_number` is never used [INFO] [stderr] --> src/day_19/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `single_number_optz` is never used [INFO] [stderr] --> src/day_19/mod.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | pub fn single_number_optz(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `inorder_traversal_vec` is never used [INFO] [stderr] --> src/day_2/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn inorder_traversal_vec(root: Option>>, data: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `inorder_traversal` is never used [INFO] [stderr] --> src/day_2/mod.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `majority_element` is never used [INFO] [stderr] --> src/day_20/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `ez_majority_element` is never used [INFO] [stderr] --> src/day_20/mod.rs:32:4 [INFO] [stderr] | [INFO] [stderr] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `letter_combinations` is never used [INFO] [stderr] --> src/day_21/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `parenthesis_dfs` is never used [INFO] [stderr] --> src/day_22/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `generate_parenthesis` is never used [INFO] [stderr] --> src/day_22/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `generator` is never used [INFO] [stderr] --> src/day_23/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn generator(candidates: Vec, target: i32, start: i32, path: &mut Vec, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `combination_sum` is never used [INFO] [stderr] --> src/day_23/mod.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack` is never used [INFO] [stderr] --> src/day_24/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn backtrack(nums: &mut Vec, left: usize, right: usize, result: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `permute` is never used [INFO] [stderr] --> src/day_24/mod.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack` is never used [INFO] [stderr] --> src/day_25/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn backtrack(nums: Vec, size: usize, start: usize, tmp: &mut Vec, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `subsets` is never used [INFO] [stderr] --> src/day_25/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack` is never used [INFO] [stderr] --> src/day_26/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn backtrack( [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `exist` is never used [INFO] [stderr] --> src/day_26/mod.rs:50:8 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_str_palindrome` is never used [INFO] [stderr] --> src/day_27/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn is_str_palindrome(s: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `backtrack_partition` is never used [INFO] [stderr] --> src/day_27/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `partition` is never used [INFO] [stderr] --> src/day_27/mod.rs:35:8 [INFO] [stderr] | [INFO] [stderr] 35 | pub fn partition(s: String) -> Vec> { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `binary_search` is never used [INFO] [stderr] --> src/day_28/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn binary_search(nums: &Vec, target: i32, low: i32, high: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_pivot` is never used [INFO] [stderr] --> src/day_28/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn find_pivot(nums: &Vec, low: i32, high: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search` is never used [INFO] [stderr] --> src/day_28/mod.rs:43:8 [INFO] [stderr] | [INFO] [stderr] 43 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search_range` is never used [INFO] [stderr] --> src/day_29/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_mirror` is never used [INFO] [stderr] --> src/day_3/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn is_mirror(left: Option>>, right: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_symmetric` is never used [INFO] [stderr] --> src/day_3/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `search_matrix` is never used [INFO] [stderr] --> src/day_30/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_pivot` is never used [INFO] [stderr] --> src/day_31/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn find_pivot(nums: &Vec, left: i32, right: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_min` is never used [INFO] [stderr] --> src/day_31/mod.rs:31:8 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `bst_dfs_validate` is never used [INFO] [stderr] --> src/day_32/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn bst_dfs_validate(root: Option>>, left: Option, right: Option) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_valid_bst` is never used [INFO] [stderr] --> src/day_32/mod.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `dfs_level_travesal` is never used [INFO] [stderr] --> src/day_33/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn dfs_level_travesal(root: Option>>, level: i32, res: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `level_order` is never used [INFO] [stderr] --> src/day_33/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: static `PRE_IDX` is never used [INFO] [stderr] --> src/day_34/mod.rs:7:12 [INFO] [stderr] | [INFO] [stderr] 7 | static mut PRE_IDX: i32 = 0; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `build_tree_helper` is never used [INFO] [stderr] --> src/day_34/mod.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | pub fn build_tree_helper( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `build_tree` is never used [INFO] [stderr] --> src/day_34/mod.rs:42:8 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `preorder_traverse` is never used [INFO] [stderr] --> src/day_35/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn preorder_traverse(root: Option>>, v: &mut Vec>>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `flatten` is never used [INFO] [stderr] --> src/day_35/mod.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn flatten(root: &mut Option>>) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `right_side_view_tranversal` is never used [INFO] [stderr] --> src/day_36/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn right_side_view_tranversal(root: Option>>, level: usize, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `right_side_view` is never used [INFO] [stderr] --> src/day_36/mod.rs:16:8 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `inorder_traversal` is never used [INFO] [stderr] --> src/day_37/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn inorder_traversal(root: Option>>, res: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `kth_smallest` is never used [INFO] [stderr] --> src/day_37/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_path` is never used [INFO] [stderr] --> src/day_38/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn find_path( [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `debug_print` is never used [INFO] [stderr] --> src/day_38/mod.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 30 | pub fn debug_print(test: &Vec>>>) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `lowest_common_ancestor` is never used [INFO] [stderr] --> src/day_38/mod.rs:46:8 [INFO] [stderr] | [INFO] [stderr] 46 | pub fn lowest_common_ancestor( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sum_traversal` is never used [INFO] [stderr] --> src/day_39/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn sum_traversal(root: Option>>, target: i64, sum: &mut i64, res: &mut i32) { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `path_sum` is never used [INFO] [stderr] --> src/day_39/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `max_depth` is never used [INFO] [stderr] --> src/day_4/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `longest_palindrome` is never used [INFO] [stderr] --> src/day_40/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn longest_palindrome(s: String) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `number_unique_paths` is never used [INFO] [stderr] --> src/day_41/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `unique_paths` is never used [INFO] [stderr] --> src/day_41/mod.rs:14:8 [INFO] [stderr] | [INFO] [stderr] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `min_cost_path` is never used [INFO] [stderr] --> src/day_42/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn min_cost_path(grid: Vec>, m: i32, n: i32, memo: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `min_path_sum` is never used [INFO] [stderr] --> src/day_42/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `edit_distance` is never used [INFO] [stderr] --> src/day_43/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `min_distance` is never used [INFO] [stderr] --> src/day_43/mod.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 30 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `word_break` is never used [INFO] [stderr] --> src/day_44/mod.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `max_product` is never used [INFO] [stderr] --> src/day_45/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `rob_through` is never used [INFO] [stderr] --> src/day_46/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn rob_through(nums: &Vec, n: i32, dp: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `rob` is never used [INFO] [stderr] --> src/day_46/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn rob(nums: Vec) -> i32 { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `num_squares` is never used [INFO] [stderr] --> src/day_47/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn num_squares(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `recursive` is never used [INFO] [stderr] --> src/day_48/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn recursive(nums: &Vec, end: usize, max: &mut i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `memoization` is never used [INFO] [stderr] --> src/day_48/mod.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn memoization(nums: &Vec, idx: i32, prev_idx: i32, dp: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `length_of_lis` is never used [INFO] [stderr] --> src/day_48/mod.rs:42:8 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `coin_change` is never used [INFO] [stderr] --> src/day_49/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sorted_array_to_bst_helper` is never used [INFO] [stderr] --> src/day_5/mod.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn sorted_array_to_bst_helper(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sorted_array_to_bst` is never used [INFO] [stderr] --> src/day_5/mod.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `subset_sum` is never used [INFO] [stderr] --> src/day_50/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn subset_sum(nums: &Vec, target: i32, idx: i32, dp: &mut Vec>) -> bool { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `can_partition` is never used [INFO] [stderr] --> src/day_50/mod.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `lcs` is never used [INFO] [stderr] --> src/day_51/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `longest_common_subsequence` is never used [INFO] [stderr] --> src/day_51/mod.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_safe` is never used [INFO] [stderr] --> src/day_52/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn is_safe(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) -> bool { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `dfs` is never used [INFO] [stderr] --> src/day_52/mod.rs:10:4 [INFO] [stderr] | [INFO] [stderr] 10 | fn dfs(grid: &Vec>, row: i32, col: i32, visited: &mut Vec>) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `num_islands` is never used [INFO] [stderr] --> src/day_52/mod.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `is_cyclic` is never used [INFO] [stderr] --> src/day_53/mod.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn is_cyclic(course: i32, graph: &HashMap>, visited: &mut Vec, rec_stack: &mut Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `can_finish` is never used [INFO] [stderr] --> src/day_53/mod.rs:23:8 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `oranges_rotting` is never used [INFO] [stderr] --> src/day_54/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn oranges_rotting(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `jump_through` is never used [INFO] [stderr] --> src/day_55/mod.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn jump_through(nums: &Vec, curr: usize, dp: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `jump` is never used [INFO] [stderr] --> src/day_55/mod.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | pub fn jump(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `invert_tree` is never used [INFO] [stderr] --> src/day_6/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `diameter_of_binary_tree` is never used [INFO] [stderr] --> src/day_7/mod.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `fibonachi` is never used [INFO] [stderr] --> src/day_8/mod.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn fibonachi(n: i32, memo: &mut HashMap) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `climb_stairs` is never used [INFO] [stderr] --> src/day_8/mod.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `next_vec` is never used [INFO] [stderr] --> src/day_9/mod.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn next_vec(pre_vec: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `generate` is never used [INFO] [stderr] --> src/day_9/mod.rs:10:8 [INFO] [stderr] | [INFO] [stderr] 10 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `leetcode-100-days-challenge` (lib) generated 106 warnings (run `cargo fix --lib -p leetcode-100-days-challenge` to apply 6 suggestions) [INFO] [stderr] warning: unused imports: `env` and `path::Path` [INFO] [stderr] --> src/day_10/mod.rs:19:13 [INFO] [stderr] | [INFO] [stderr] 19 | use std::{env, fs::read_to_string, path::Path}; [INFO] [stderr] | ^^^ ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `borrow::Borrow` [INFO] [stderr] --> src/day_6/mod.rs:21:13 [INFO] [stderr] | [INFO] [stderr] 21 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `ez_majority_element` is never used [INFO] [stderr] --> src/day_20/mod.rs:32:4 [INFO] [stderr] | [INFO] [stderr] 32 | fn ez_majority_element(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `leetcode-100-days-challenge` (lib test) generated 14 warnings (11 duplicates) (run `cargo fix --lib -p leetcode-100-days-challenge --tests` to apply 2 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.01s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/leetcode_100_days_challenge-09351c2439b17593) [INFO] [stdout] [INFO] [stdout] running 164 tests [INFO] [stdout] test day_10::test::max_profit_example_2 ... ok [INFO] [stdout] test day_10::test::max_profit_example_1 ... ok [INFO] [stdout] test day_11::tests::example_1_two_sum ... ok [INFO] [stdout] test day_11::tests::example_2_two_sum ... ok [INFO] [stdout] test day_11::tests::example_3_two_sum ... ok [INFO] [stdout] test day_12::test::merge_two_lists_example_1 ... ok [INFO] [stdout] test day_12::test::merge_two_lists_example_2 ... ok [INFO] [stdout] test day_14::test::get_intersection_node_example_2 ... ok [INFO] [stdout] test day_14::test::get_intersection_node_example_3 ... ok [INFO] [stdout] test day_13::test::has_cycle_example_1 ... ok [INFO] [stdout] test day_12::test::merge_two_lists_example_3 ... ok [INFO] [stdout] test day_13::test::has_cycle_example_3 ... ok [INFO] [stdout] test day_15::test::reserve_linked_list_test_2 ... ok [INFO] [stdout] test day_16::test::test_is_palindrome_1 ... ok [INFO] [stdout] test day_15::test::reserve_linked_list_test_3 ... ok [INFO] [stdout] test day_16::test::test_is_palindrome_2 ... ok [INFO] [stdout] test day_17::test::test_is_valid ... ok [INFO] [stdout] test day_15::test::reserve_linked_list_test_1 ... ok [INFO] [stdout] test day_14::test::get_intersection_node_example_1 ... ok [INFO] [stdout] test day_19::test::single_number_test_3 ... ok [INFO] [stdout] test day_19::test::single_number_test_2 ... ok [INFO] [stdout] test day_18::tests::test_move_zeroes_2 ... ok [INFO] [stdout] test day_1::tests::example_2_search_insert ... ok [INFO] [stdout] test day_1::tests::example_1_search_insert ... ok [INFO] [stdout] test day_18::tests::test_move_zeroes_1 ... ok [INFO] [stdout] test day_19::test::single_number_test_1 ... ok [INFO] [stdout] test day_20::test::majority_element_test ... ok [INFO] [stdout] test day_1::tests::example_3_search_insert ... ok [INFO] [stdout] test day_1::tests::example_5_search_insert ... ok [INFO] [stdout] test day_21::test::test_letter_combinations ... ok [INFO] [stdout] test day_22::test::test_generate_parenthesis ... ok [INFO] [stdout] test day_23::test::example_2 ... ok [INFO] [stdout] test day_24::tests::test_permute_3 ... ok [INFO] [stdout] test day_24::tests::test_permute_1 ... ok [INFO] [stdout] test day_23::test::example_3 ... ok [INFO] [stdout] test day_25::test::test_subsets ... ok [INFO] [stdout] test day_1::tests::example_4_search_insert ... ok [INFO] [stdout] test day_24::tests::test_permute_2 ... ok [INFO] [stdout] test day_26::test::test_exist_4 ... ok [INFO] [stdout] test day_23::test::example_1 ... ok [INFO] [stdout] test day_26::test::test_exist_1 ... ok [INFO] [stdout] test day_26::test::test_exist_2 ... ok [INFO] [stdout] test day_26::test::test_exist_3 ... ok [INFO] [stdout] test day_25::test::test_subsets_2 ... ok [INFO] [stdout] test day_27::test::test_partition_1 ... ok [INFO] [stdout] test day_27::test::test_partition_2 ... ok [INFO] [stdout] test day_28::tests::test_search_2 ... ok [INFO] [stdout] test day_28::tests::test_search_4 ... ok [INFO] [stdout] test day_28::tests::test_search_5 ... ok [INFO] [stdout] test day_28::tests::test_search_3 ... ok [INFO] [stdout] test day_2::test::example_1_inorder_traversal ... ok [INFO] [stdout] test day_29::test::test_search_range ... ok [INFO] [stdout] test day_28::tests::test_search ... ok [INFO] [stdout] test day_2::test::example_3_inorder_traversal ... ok [INFO] [stdout] test day_2::test::example_2_inorder_traversal ... ok [INFO] [stdout] test day_30::test::test_search_matrix ... ok [INFO] [stdout] test day_31::test::test_find_min ... ok [INFO] [stdout] test day_30::test::test_search_matrix_2 ... ok [INFO] [stdout] test day_31::test::test_find_min_2 ... ok [INFO] [stdout] test day_31::test::test_find_min_5 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_2 ... ok [INFO] [stdout] test day_31::test::test_find_min_4 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_3 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_4 ... ok [INFO] [stdout] test day_30::test::test_search_matrix_4 ... ok [INFO] [stdout] test day_31::test::test_find_min_3 ... ok [INFO] [stdout] test day_30::test::test_search_matrix_3 ... ok [INFO] [stdout] test day_32::test::test_is_valid_bst_5 ... ok [INFO] [stdout] test day_33::test::test_level_order_2 ... ok [INFO] [stdout] test day_33::test::test_level_order ... ok [INFO] [stdout] test day_33::test::test_level_order_3 ... ok [INFO] [stdout] test day_34::test::test_build_tree_2 ... ok [INFO] [stdout] test day_35::test::test_flatten ... ok [INFO] [stdout] test day_36::test::example_1 ... ok [INFO] [stdout] test day_36::test::example_2 ... ok [INFO] [stdout] test day_35::test::test_flatten_3 ... ok [INFO] [stdout] test day_35::test::test_flatten_2 ... ok [INFO] [stdout] test day_36::test::example_3 ... ok [INFO] [stdout] test day_37::test::example_1 ... ok [INFO] [stdout] test day_36::test::example_4 ... ok [INFO] [stdout] test day_37::test::example_2 ... ok [INFO] [stdout] test day_38::test::example_3 ... ok [INFO] [stdout] test day_39::test::example_1 ... ok [INFO] [stdout] test day_39::test::example_2 ... ok [INFO] [stdout] test day_38::test::example_1 ... ok [INFO] [stdout] test day_39::test::example_3 ... ok [INFO] [stdout] test day_38::test::example_2 ... ok [INFO] [stdout] test day_3::test::example_1_is_symmetric ... ok [INFO] [stdout] test day_3::test::example_2_is_symmetric ... ok [INFO] [stdout] test day_40::test::example_1 ... ok [INFO] [stdout] test day_40::test::exmaple_3 ... ok [INFO] [stdout] test day_40::test::example_4 ... ok [INFO] [stdout] test day_40::test::example_2 ... ok [INFO] [stdout] test day_41::test::example_3 ... ok [INFO] [stdout] test day_40::test::example_5 ... ok [INFO] [stdout] test day_41::test::example_1 ... ok [INFO] [stdout] test day_41::test::example_2 ... ok [INFO] [stdout] test day_42::test::test_min_path_sum_2 ... ok [INFO] [stdout] test day_41::test::example_5 ... ok [INFO] [stdout] test day_43::test::test_min_distance ... ok [INFO] [stdout] test day_41::test::example_4 ... ok [INFO] [stdout] test day_44::test::example_1 ... ok [INFO] [stdout] test day_44::test::example_3 ... ok [INFO] [stdout] test day_45::test::example_1 ... ok [INFO] [stdout] test day_45::test::example_2 ... ok [INFO] [stdout] test day_44::test::example_2 ... ok [INFO] [stdout] test day_45::test::example_3 ... ok [INFO] [stdout] test day_45::test::example_4 ... ok [INFO] [stdout] test day_42::test::test_min_path_sum ... ok [INFO] [stdout] test day_43::test::test_min_distance_3 ... ok [INFO] [stdout] test day_45::test::example_6 ... ok [INFO] [stdout] test day_46::test::example_1 ... ok [INFO] [stdout] test day_42::test::test_min_path_sum_3 ... ok [INFO] [stdout] test day_43::test::test_min_distance_2 ... ok [INFO] [stdout] test day_46::test::example_5 ... ok [INFO] [stdout] test day_46::test::example_3 ... ok [INFO] [stdout] test day_46::test::example_2 ... ok [INFO] [stdout] test day_46::test::example_4 ... ok [INFO] [stdout] test day_47::test::example_2 ... ok [INFO] [stdout] test day_47::test::example_1 ... ok [INFO] [stdout] test day_47::test::example_4 ... ok [INFO] [stdout] test day_47::test::example_5 ... ok [INFO] [stdout] test day_48::test::example_2 ... ok [INFO] [stdout] test day_47::test::example_3 ... ok [INFO] [stdout] test day_48::test::example_3 ... ok [INFO] [stdout] test day_48::test::example_1 ... ok [INFO] [stdout] test day_49::test::example_1 ... ok [INFO] [stdout] test day_49::test::example_2 ... ok [INFO] [stdout] test day_4::test::example_1_max_depth ... ok [INFO] [stdout] test day_49::test::example_4 ... ok [INFO] [stdout] test day_49::test::example_3 ... ok [INFO] [stdout] test day_50::tests::example_2 ... ok [INFO] [stdout] test day_51::test::example_1 ... ok [INFO] [stdout] test day_51::test::example_3 ... ok [INFO] [stdout] test day_51::test::example_2 ... ok [INFO] [stdout] test day_50::tests::example_1 ... ok [INFO] [stdout] test day_4::test::example_2_max_depth ... ok [INFO] [stdout] test day_45::test::example_5 ... ok [INFO] [stdout] test day_52::test::example_2 ... ok [INFO] [stdout] test day_52::test::example_1 ... ok [INFO] [stdout] test day_52::test::example_3 ... ok [INFO] [stdout] test day_53::test::example_1 ... ok [INFO] [stdout] test day_53::test::example_2 ... ok [INFO] [stdout] test day_54::test::example_2 ... ok [INFO] [stdout] test day_54::test::example_3 ... ok [INFO] [stdout] test day_55::test::example_2 ... ok [INFO] [stdout] test day_54::test::example_1 ... ok [INFO] [stdout] test day_10::test::max_profit_example_3 ... ok [INFO] [stdout] test day_55::test::example_1 ... ok [INFO] [stdout] test day_5::test::example_1_sorted_array_to_bst ... ok [INFO] [stdout] test day_6::test::example_2_invert_tree ... ok [INFO] [stdout] test day_5::test::example_2_sorted_array_to_bst ... ok [INFO] [stdout] test day_7::test::example_2 ... ok [INFO] [stdout] test day_7::test::example_1 ... ok [INFO] [stdout] test day_6::test::example_3_invert_tree ... ok [INFO] [stdout] test day_6::test::example_1_invert_tree ... ok [INFO] [stdout] test day_8::tests::test_climb_stairs ... ok [INFO] [stdout] test day_8::tests::test_climb_stairs_2 ... ok [INFO] [stdout] test day_9::test::test_1_generate ... ok [INFO] [stdout] test day_9::test::test_2_generate ... ok [INFO] [stdout] test day_34::test::test_build_tree ... FAILED [INFO] [stdout] test day_48::test::example_4 ... ok [INFO] [stdout] test day_51::test::example_4 ... ok [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] [INFO] [stdout] ---- day_34::test::test_build_tree stdout ---- [INFO] [stdout] thread 'day_34::test::test_build_tree' panicked at src/day_34/mod.rs:65:5: [INFO] [stdout] assertion `left == right` failed [INFO] [stdout] left: Some(RefCell { value: TreeNode { val: 3, left: Some(RefCell { value: TreeNode { val: 9, left: None, right: None } }), right: Some(RefCell { value: TreeNode { val: 20, left: Some(RefCell { value: TreeNode { val: 9, left: None, right: None } }), right: Some(RefCell { value: TreeNode { val: 20, left: None, right: Some(RefCell { value: TreeNode { val: 15, left: None, right: Some(RefCell { value: TreeNode { val: 7, left: None, right: None } }) } }) } }) } }) } }) [INFO] [stdout] right: Some(RefCell { value: TreeNode { val: 3, left: Some(RefCell { value: TreeNode { val: 9, left: None, right: None } }), right: Some(RefCell { value: TreeNode { val: 20, left: Some(RefCell { value: TreeNode { val: 15, left: None, right: None } }), right: Some(RefCell { value: TreeNode { val: 7, left: None, right: None } }) } }) } }) [INFO] [stdout] stack backtrace: [INFO] [stdout] 0: 0x55d5c537be45 - std::backtrace_rs::backtrace::libunwind::trace::h68acc96dd29bfb25 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/../../backtrace/src/backtrace/libunwind.rs:116:5 [INFO] [stdout] 1: 0x55d5c537be45 - std::backtrace_rs::backtrace::trace_unsynchronized::hc833f810d39d5258 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5 [INFO] [stdout] 2: 0x55d5c537be45 - std::sys::backtrace::_print_fmt::h5f23caa5b7652308 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/sys/backtrace.rs:66:9 [INFO] [stdout] 3: 0x55d5c537be45 - ::fmt::hc81f55a2b3efffd1 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/sys/backtrace.rs:39:26 [INFO] [stdout] 4: 0x55d5c53a317b - core::fmt::rt::Argument::fmt::h731d8ba6b9c446d6 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/fmt/rt.rs:173:76 [INFO] [stdout] 5: 0x55d5c53a317b - core::fmt::write::h6e5816e68b47f713 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/fmt/mod.rs:1178:21 [INFO] [stdout] 6: 0x55d5c537920f - std::io::Write::write_fmt::h3726facc0aa8eb67 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/io/mod.rs:1823:15 [INFO] [stdout] 7: 0x55d5c537d661 - std::sys::backtrace::BacktraceLock::print::hb98272574ac3b700 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/sys/backtrace.rs:42:9 [INFO] [stdout] 8: 0x55d5c537d661 - std::panicking::default_hook::{{closure}}::h979aa01ca70f7f8f [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:266:22 [INFO] [stdout] 9: 0x55d5c537d208 - std::panicking::default_hook::h17e52f086133e6fd [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:290:9 [INFO] [stdout] 10: 0x55d5c5348bfa - as core::ops::function::Fn>::call::h4e1615f02d9f709a [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/alloc/src/boxed.rs:2162:9 [INFO] [stdout] 11: 0x55d5c5348bfa - test::test_main::{{closure}}::hc8df444856fcb257 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/test/src/lib.rs:132:21 [INFO] [stdout] 12: 0x55d5c537df6f - as core::ops::function::Fn>::call::hac606c4d68b970a6 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/alloc/src/boxed.rs:2162:9 [INFO] [stdout] 13: 0x55d5c537df6f - std::panicking::rust_panic_with_hook::h694bfcec6451de5a [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:805:13 [INFO] [stdout] 14: 0x55d5c537db97 - std::panicking::begin_panic_handler::{{closure}}::hbd9f22f307951c96 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:671:13 [INFO] [stdout] 15: 0x55d5c537c309 - std::sys::backtrace::__rust_end_short_backtrace::h6e4502eb3c3e7834 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/sys/backtrace.rs:170:18 [INFO] [stdout] 16: 0x55d5c537d824 - rust_begin_unwind [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:662:5 [INFO] [stdout] 17: 0x55d5c53a1a93 - core::panicking::panic_fmt::ha6b90685af50061f [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/panicking.rs:74:14 [INFO] [stdout] 18: 0x55d5c53a1e5e - core::panicking::assert_failed_inner::h04f590ce609aabea [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/panicking.rs:412:17 [INFO] [stdout] 19: 0x55d5c52d02ae - core::panicking::assert_failed::h7dac49886d5f25ef [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/panicking.rs:367:5 [INFO] [stdout] 20: 0x55d5c52d868c - leetcode_100_days_challenge::day_34::test::test_build_tree::h795c9718c8cfa2a9 [INFO] [stdout] at /opt/rustwide/workdir/src/day_34/mod.rs:65:5 [INFO] [stdout] 21: 0x55d5c52d81a7 - leetcode_100_days_challenge::day_34::test::test_build_tree::{{closure}}::h6e0f220030448683 [INFO] [stdout] at /opt/rustwide/workdir/src/day_34/mod.rs:52:23 [INFO] [stdout] 22: 0x55d5c53033c6 - core::ops::function::FnOnce::call_once::hd65a90f6b04988f0 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 23: 0x55d5c534d77b - core::ops::function::FnOnce::call_once::h321fab3f659b8f1c [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 24: 0x55d5c534d77b - test::__rust_begin_short_backtrace::h7bcdd7ef45d5d11d [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/test/src/lib.rs:620:18 [INFO] [stdout] 25: 0x55d5c534cf95 - test::run_test_in_process::{{closure}}::h7e5c4c77b843c962 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/test/src/lib.rs:643:60 [INFO] [stdout] 26: 0x55d5c534cf95 - as core::ops::function::FnOnce<()>>::call_once::h9465365bda0c96e1 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 27: 0x55d5c534cf95 - std::panicking::try::do_call::h464859d60fe36ac8 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:554:40 [INFO] [stdout] 28: 0x55d5c534cf95 - std::panicking::try::h10bb685f1ad0ff38 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:518:19 [INFO] [stdout] 29: 0x55d5c534cf95 - std::panic::catch_unwind::hf3392dbe1556c5c7 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panic.rs:345:14 [INFO] [stdout] 30: 0x55d5c534cf95 - test::run_test_in_process::hc7c0ab6dab190e49 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/test/src/lib.rs:643:27 [INFO] [stdout] 31: 0x55d5c534cf95 - test::run_test::{{closure}}::hdb2183b5de946a08 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/test/src/lib.rs:564:43 [INFO] [stdout] 32: 0x55d5c5312864 - test::run_test::{{closure}}::h8dcd9e4e5e3fbe5f [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/test/src/lib.rs:594:41 [INFO] [stdout] 33: 0x55d5c5312864 - std::sys::backtrace::__rust_begin_short_backtrace::h41bf17e9b9ace8bc [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/sys/backtrace.rs:154:18 [INFO] [stdout] 34: 0x55d5c5316032 - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::h63bd96fcdd52032f [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/thread/mod.rs:524:17 [INFO] [stdout] 35: 0x55d5c5316032 - as core::ops::function::FnOnce<()>>::call_once::ha8ff5ca2e19c8b3f [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 36: 0x55d5c5316032 - std::panicking::try::do_call::h2c72967242944c46 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:554:40 [INFO] [stdout] 37: 0x55d5c5316032 - std::panicking::try::h84beb938f6030c53 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panicking.rs:518:19 [INFO] [stdout] 38: 0x55d5c5316032 - std::panic::catch_unwind::hca4383a7a644e749 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/panic.rs:345:14 [INFO] [stdout] 39: 0x55d5c5316032 - std::thread::Builder::spawn_unchecked_::{{closure}}::h88915884a74f8e2a [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/thread/mod.rs:523:30 [INFO] [stdout] 40: 0x55d5c5316032 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h4c032c9efdb7212a [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 41: 0x55d5c53820cb - as core::ops::function::FnOnce>::call_once::h809cb44187f4e360 [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/alloc/src/boxed.rs:2148:9 [INFO] [stdout] 42: 0x55d5c53820cb - as core::ops::function::FnOnce>::call_once::h670f08f0ab61db1b [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/alloc/src/boxed.rs:2148:9 [INFO] [stdout] 43: 0x55d5c53820cb - std::sys::pal::unix::thread::Thread::new::thread_start::hee2b0396d7ed5bcb [INFO] [stdout] at /rustc/5e89635d7bf1d3033c2eb20378b7b3cbe2dd1a9b/library/std/src/sys/pal/unix/thread.rs:105:17 [INFO] [stdout] 44: 0x7f533df2dac3 - [INFO] [stdout] 45: 0x7f533dfbea04 - clone [INFO] [stdout] 46: 0x0 - [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] day_34::test::test_build_tree [INFO] [stdout] [INFO] [stdout] test result: FAILED. 163 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 40.31s [INFO] [stdout] [INFO] [stderr] error: test failed, to rerun pass `--lib` [INFO] running `Command { std: "docker" "inspect" "f954f7d22825356ce3d01581c2c32ea7757690fe1c56a709083227dba649dc89", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "f954f7d22825356ce3d01581c2c32ea7757690fe1c56a709083227dba649dc89", kill_on_drop: false }` [INFO] [stdout] f954f7d22825356ce3d01581c2c32ea7757690fe1c56a709083227dba649dc89