[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] checking marverlous811/100-days-rust-agorithms against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/marverlous811/100-days-rust-agorithms on toolchain 1f12b9b0fdbe735968ac002792a720f0ba4faca6 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/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-7-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" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 8d11385c976909ac45e0461756896c945896e7220edb0cae97fb5487c410815c [INFO] running `Command { std: "docker" "start" "-a" "8d11385c976909ac45e0461756896c945896e7220edb0cae97fb5487c410815c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "8d11385c976909ac45e0461756896c945896e7220edb0cae97fb5487c410815c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8d11385c976909ac45e0461756896c945896e7220edb0cae97fb5487c410815c", kill_on_drop: false }` [INFO] [stdout] 8d11385c976909ac45e0461756896c945896e7220edb0cae97fb5487c410815c [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] fe2471a3936a1fcdacef66960987079280105c7915cb0b1f39b27b58eaba2f0e [INFO] running `Command { std: "docker" "start" "-a" "fe2471a3936a1fcdacef66960987079280105c7915cb0b1f39b27b58eaba2f0e", kill_on_drop: false }` [INFO] [stderr] Checking 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 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 `array_to_bst` is never used [INFO] [stdout] --> src/common/binary_tree.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn array_to_bst(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `new_with_children`, `from_arr`, and `to_arr` are never used [INFO] [stdout] --> src/common/binary_tree.rs:25:10 [INFO] [stdout] | [INFO] [stdout] 23 | impl TreeNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 24 | #[inline] [INFO] [stdout] 25 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn new_with_children( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn from_arr(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn to_arr(&self, data: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, `add_node`, and `to_vec` are never used [INFO] [stdout] --> src/common/link_list.rs:8:10 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 8 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | pub fn new_with_next(val: i32, next: Option>) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn from_vec(vals: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn add_node(&mut self, node: Option>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn to_vec(&self) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, and `to_vec` are never used [INFO] [stdout] --> src/common/linked_list.rs:10:10 [INFO] [stdout] | [INFO] [stdout] 9 | impl LinkedListNode { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 10 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn new_with_next(val: i32, next: Option>>) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn from_vec(vals: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn to_vec(&self, acc: &mut Vec) { [INFO] [stdout] | ^^^^^^ [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] [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: 110 warnings emitted [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 `array_to_bst` is never used [INFO] [stdout] --> src/common/binary_tree.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn array_to_bst(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `from_arr` is never used [INFO] [stdout] --> src/common/binary_tree.rs:41:10 [INFO] [stdout] | [INFO] [stdout] 23 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn from_arr(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new_with_next` and `to_vec` are never used [INFO] [stdout] --> src/common/linked_list.rs:14:10 [INFO] [stdout] | [INFO] [stdout] 9 | impl LinkedListNode { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn new_with_next(val: i32, next: Option>>) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn to_vec(&self, acc: &mut Vec) { [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 `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: 17 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.32s [INFO] running `Command { std: "docker" "inspect" "fe2471a3936a1fcdacef66960987079280105c7915cb0b1f39b27b58eaba2f0e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "fe2471a3936a1fcdacef66960987079280105c7915cb0b1f39b27b58eaba2f0e", kill_on_drop: false }` [INFO] [stdout] fe2471a3936a1fcdacef66960987079280105c7915cb0b1f39b27b58eaba2f0e [INFO] checking marverlous811/100-days-rust-agorithms against try#f9935d29d867449445ee008640ccca1bf1ae0889+rustflags=-Dtail_expr_drop_order for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms" "/workspace/builds/worker-7-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/marverlous811/100-days-rust-agorithms on toolchain f9935d29d867449445ee008640ccca1bf1ae0889 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/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-7-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" "+f9935d29d867449445ee008640ccca1bf1ae0889" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] ae95bb0836101a5f3517e42369e2eb41405d050f54a00193aaa38171fd6c4c59 [INFO] running `Command { std: "docker" "start" "-a" "ae95bb0836101a5f3517e42369e2eb41405d050f54a00193aaa38171fd6c4c59", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "ae95bb0836101a5f3517e42369e2eb41405d050f54a00193aaa38171fd6c4c59", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "ae95bb0836101a5f3517e42369e2eb41405d050f54a00193aaa38171fd6c4c59", kill_on_drop: false }` [INFO] [stdout] ae95bb0836101a5f3517e42369e2eb41405d050f54a00193aaa38171fd6c4c59 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Dtail_expr_drop_order" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 5c5e821864c93f32ae4dbd3cd03890a62d246f179c051a9fd725a754e832b7be [INFO] running `Command { std: "docker" "start" "-a" "5c5e821864c93f32ae4dbd3cd03890a62d246f179c051a9fd725a754e832b7be", kill_on_drop: false }` [INFO] [stderr] Checking 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 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 `array_to_bst` is never used [INFO] [stdout] --> src/common/binary_tree.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn array_to_bst(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `new_with_children`, `from_arr`, and `to_arr` are never used [INFO] [stdout] --> src/common/binary_tree.rs:25:10 [INFO] [stdout] | [INFO] [stdout] 23 | impl TreeNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 24 | #[inline] [INFO] [stdout] 25 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn new_with_children( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn from_arr(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn to_arr(&self, data: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, `add_node`, and `to_vec` are never used [INFO] [stdout] --> src/common/link_list.rs:8:10 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 8 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | pub fn new_with_next(val: i32, next: Option>) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn from_vec(vals: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn add_node(&mut self, node: Option>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn to_vec(&self) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, and `to_vec` are never used [INFO] [stdout] --> src/common/linked_list.rs:10:10 [INFO] [stdout] | [INFO] [stdout] 9 | impl LinkedListNode { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 10 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn new_with_next(val: i32, next: Option>>) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn from_vec(vals: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn to_vec(&self, acc: &mut Vec) { [INFO] [stdout] | ^^^^^^ [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] [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] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/day_34/mod.rs:34:52 [INFO] [stdout] | [INFO] [stdout] 34 | let in_index = inorder.iter().position(|&x| x == node.as_ref().borrow().val).unwrap() as i32; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] = note: requested on the command line with `-D tail-expr-drop-order` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 1 previous error; 110 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] error: could not compile `leetcode-100-days-challenge` (lib) due to 2 previous errors; 110 warnings emitted [INFO] [stderr] warning: build failed, waiting for other jobs to finish... [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 `array_to_bst` is never used [INFO] [stdout] --> src/common/binary_tree.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn array_to_bst(nums: Vec, start: usize, end: usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `from_arr` is never used [INFO] [stdout] --> src/common/binary_tree.rs:41:10 [INFO] [stdout] | [INFO] [stdout] 23 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn from_arr(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new_with_next` and `to_vec` are never used [INFO] [stdout] --> src/common/linked_list.rs:14:10 [INFO] [stdout] | [INFO] [stdout] 9 | impl LinkedListNode { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn new_with_next(val: i32, next: Option>>) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn to_vec(&self, acc: &mut Vec) { [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 `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] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/day_34/mod.rs:34:52 [INFO] [stdout] | [INFO] [stdout] 34 | let in_index = inorder.iter().position(|&x| x == node.as_ref().borrow().val).unwrap() as i32; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] = note: requested on the command line with `-D tail-expr-drop-order` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 1 previous error; 17 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] error: could not compile `leetcode-100-days-challenge` (lib test) due to 2 previous errors; 17 warnings emitted [INFO] running `Command { std: "docker" "inspect" "5c5e821864c93f32ae4dbd3cd03890a62d246f179c051a9fd725a754e832b7be", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5c5e821864c93f32ae4dbd3cd03890a62d246f179c051a9fd725a754e832b7be", kill_on_drop: false }` [INFO] [stdout] 5c5e821864c93f32ae4dbd3cd03890a62d246f179c051a9fd725a754e832b7be