[INFO] cloning repository https://github.com/0xFloop/leet_rs [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/0xFloop/leet_rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F0xFloop%2Fleet_rs", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F0xFloop%2Fleet_rs'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] b0ac90684cf8c9beff7dd02c56b9962b655e77a1 [INFO] linting 0xFloop/leet_rs against nightly for clippy-nonminimal_bool-denied [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F0xFloop%2Fleet_rs" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/0xFloop/leet_rs [INFO] finished tweaking git repo https://github.com/0xFloop/leet_rs [INFO] tweaked toml for git repo https://github.com/0xFloop/leet_rs written to /workspace/builds/worker-3-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/0xFloop/leet_rs on toolchain nightly [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+nightly" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/0xFloop/leet_rs 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" "+nightly" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+nightly" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 54be445d9df073505a4feebc6b9e32ed70a94c5dc731f0213307194848b60612 [INFO] running `Command { std: "docker" "start" "-a" "54be445d9df073505a4feebc6b9e32ed70a94c5dc731f0213307194848b60612", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "54be445d9df073505a4feebc6b9e32ed70a94c5dc731f0213307194848b60612", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "54be445d9df073505a4feebc6b9e32ed70a94c5dc731f0213307194848b60612", kill_on_drop: false }` [INFO] [stdout] 54be445d9df073505a4feebc6b9e32ed70a94c5dc731f0213307194848b60612 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+nightly" "clippy" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] e1155ff3abed5cb8ce805256ec12a19f30bc4900d7ba52afdc6c7d615f9573e9 [INFO] running `Command { std: "docker" "start" "-a" "e1155ff3abed5cb8ce805256ec12a19f30bc4900d7ba52afdc6c7d615f9573e9", kill_on_drop: false }` [INFO] [stderr] Checking leetcode-rs v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `slice::ChunksMut` [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:1:34 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, rc::Rc, slice::ChunksMut}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `slice::ChunksMut` [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:1:34 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cell::RefCell, rc::Rc, slice::ChunksMut}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Borrow` [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:19:19 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Borrow` [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:19:19 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/problems/easy/majority_element.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/problems/easy/majority_element.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/remove_elements.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/remove_elements.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:23:20 [INFO] [stdout] | [INFO] [stdout] 23 | let left = (curr.is_none() || curr.unwrap() <= &target); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - let left = (curr.is_none() || curr.unwrap() <= &target); [INFO] [stdout] 23 + let left = curr.is_none() || curr.unwrap() <= &target ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:24:21 [INFO] [stdout] | [INFO] [stdout] 24 | let right = (next.is_none() || next.unwrap() >= &target); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 24 - let right = (next.is_none() || next.unwrap() >= &target); [INFO] [stdout] 24 + let right = next.is_none() || next.unwrap() >= &target ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:23:20 [INFO] [stdout] | [INFO] [stdout] 23 | let left = (curr.is_none() || curr.unwrap() <= &target); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - let left = (curr.is_none() || curr.unwrap() <= &target); [INFO] [stdout] 23 + let left = curr.is_none() || curr.unwrap() <= &target ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:24:21 [INFO] [stdout] | [INFO] [stdout] 24 | let right = (next.is_none() || next.unwrap() >= &target); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 24 - let right = (next.is_none() || next.unwrap() >= &target); [INFO] [stdout] 24 + let right = next.is_none() || next.unwrap() >= &target ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::panic` [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::panic; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Add` [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::ops::Add; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::panic` [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::panic; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Add` [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::ops::Add; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/problems/medium/longest_substring.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/problems/medium/longest_substring.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::mem` [INFO] [stdout] --> src/problems/medium/next_permutation.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::mem; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::mem` [INFO] [stdout] --> src/problems/medium/next_permutation.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::mem; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashMap` [INFO] [stdout] --> src/problems/medium/three_sum.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap` and `HashSet` [INFO] [stdout] --> src/problems/medium/three_sum_closest.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashMap` [INFO] [stdout] --> src/problems/medium/three_sum.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap` and `HashSet` [INFO] [stdout] --> src/problems/medium/three_sum_closest.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/problems/easy/add_digits.rs:14:5 [INFO] [stdout] | [INFO] [stdout] 3 | / loop { [INFO] [stdout] 4 | | let digits: Vec = num.to_string().chars().map(|c| c as u32 - 48).collect(); [INFO] [stdout] 5 | | let mut curr_sum = 0; [INFO] [stdout] 6 | | for digit in &digits { [INFO] [stdout] ... | [INFO] [stdout] 12 | | num = curr_sum; [INFO] [stdout] 13 | | } [INFO] [stdout] | |_____- any code following this expression is unreachable [INFO] [stdout] 14 | 0 [INFO] [stdout] | ^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/problems/easy/add_digits.rs:14:5 [INFO] [stdout] | [INFO] [stdout] 3 | / loop { [INFO] [stdout] 4 | | let digits: Vec = num.to_string().chars().map(|c| c as u32 - 48).collect(); [INFO] [stdout] 5 | | let mut curr_sum = 0; [INFO] [stdout] 6 | | for digit in &digits { [INFO] [stdout] ... | [INFO] [stdout] 12 | | num = curr_sum; [INFO] [stdout] 13 | | } [INFO] [stdout] | |_____- any code following this expression is unreachable [INFO] [stdout] 14 | 0 [INFO] [stdout] | ^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/count_nodes.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BorrowMut` [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:19:27 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:22:5 [INFO] [stdout] | [INFO] [stdout] 22 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/is_symetric.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/max_depth.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/path_sum.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root_2` [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:25:9 [INFO] [stdout] | [INFO] [stdout] 25 | let root_2 = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_root_2` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow::Borrow` [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/count_nodes.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BorrowMut` [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:19:27 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:22:5 [INFO] [stdout] | [INFO] [stdout] 22 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/is_symetric.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/max_depth.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/problems/easy/path_sum.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problems/easy/convert_to_title.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | let mut column_number = 2147483647; [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root_2` [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:25:9 [INFO] [stdout] | [INFO] [stdout] 25 | let root_2 = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_root_2` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problems/easy/convert_to_title.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | let mut column_number = 2147483647; [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `c` [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:12:50 [INFO] [stdout] | [INFO] [stdout] 12 | first_word.chars().enumerate().find_map(|(i, c)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_c` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/problems/easy/merge_sorted_arr.rs:5:9 [INFO] [stdout] | [INFO] [stdout] 5 | let n = 5; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `c` [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:12:50 [INFO] [stdout] | [INFO] [stdout] 12 | first_word.chars().enumerate().find_map(|(i, c)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_c` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/problems/easy/merge_sorted_arr.rs:5:9 [INFO] [stdout] | [INFO] [stdout] 5 | let n = 5; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problems/easy/plus_one.rs:6:10 [INFO] [stdout] | [INFO] [stdout] 6 | for (i, digit) in digits.iter_mut().rev().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problems/easy/plus_one.rs:6:10 [INFO] [stdout] | [INFO] [stdout] 6 | for (i, digit) in digits.iter_mut().rev().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problems/easy/title_to_number.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | let mut column_title = String::from("FXSHRXW"); [INFO] [stdout] | ----^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problems/easy/title_to_number.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | let mut column_title = String::from("FXSHRXW"); [INFO] [stdout] | ----^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/add_binary.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/add_digits.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_height` is never used [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:90:4 [INFO] [stdout] | [INFO] [stdout] 90 | fn get_height(curr_node: &Option>>) -> Result { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `traverse` is never used [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn traverse( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/buy_and_sell_stocks.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/climbing_stairs.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb` is never used [INFO] [stdout] --> src/problems/easy/climbing_stairs.rs:8:4 [INFO] [stdout] | [INFO] [stdout] 8 | fn climb(steps_left: i32, memo: &mut HashMap) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/contains_duplicates.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/contains_nearby_duplicates.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/convert_to_title.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/convert_to_title.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn recurse(val: u32, s: &mut String) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/count_nodes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_missing` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:66:4 [INFO] [stdout] | [INFO] [stdout] 66 | fn count_missing( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_height` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn get_height(node: &Option>>, height: &mut i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `naive_solve` is never used [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn naive_solve() -> Option> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/hamming_weight.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_node` is never used [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn search_node(curr_node: &Rc>, tracker_vec: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn solve() -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse_reverse` is never used [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:59:4 [INFO] [stdout] | [INFO] [stdout] 59 | fn recurse_reverse(node: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_happy.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_isomorphic.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `WrappedTreeNode` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 20 | type WrappedTreeNode = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `compare_trees` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:48:4 [INFO] [stdout] | [INFO] [stdout] 48 | fn compare_trees(p: &WrappedTreeNode, q: &WrappedTreeNode) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/is_symetric.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `WrappedTreeNode` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 20 | type WrappedTreeNode = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cmp_nodes` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:60:4 [INFO] [stdout] | [INFO] [stdout] 60 | fn cmp_nodes(l_node: &WrappedTreeNode, r_node: &WrappedTreeNode) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/kata_machine.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> [i32; 10] { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/length_of_the_last_word.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/majority_element.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/max_depth.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `WrappedTreeNode` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 20 | type WrappedTreeNode = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn search(node: &WrappedTreeNode) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/merge_sorted_arr.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/merge_two_sorted_lists.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/merge_two_sorted_lists.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/merge_two_sorted_lists.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:54:4 [INFO] [stdout] | [INFO] [stdout] 54 | fn recurse(curr_node: &Option>>, curr_depth: &mut i32, shortest: &mut i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/my_sqrt.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `naive_solve` is never used [INFO] [stdout] --> src/problems/easy/my_sqrt.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn naive_solve() -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyStack` is never constructed [INFO] [stdout] --> src/problems/easy/my_stack.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct MyStack { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used [INFO] [stdout] --> src/problems/easy/my_stack.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 10 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/my_stack.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn solve() { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/palindrome_linked_list.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/palindrome_linked_list.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/palindrome_linked_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/palindrome_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/pascals_trianble_2.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/pascals_triangle.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/path_sum.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/path_sum.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/path_sum.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/path_sum.rs:71:4 [INFO] [stdout] | [INFO] [stdout] 71 | fn recurse(curr_node: &Option>>, curr_sum: &mut i32, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/plus_one.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn recurse(node: &Option>>, order: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/power_of_two.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn recurse(node: &Option>>, order: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 12 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn peek(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/remove_duplicates.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/remove_element.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/remove_elements.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/remove_elements.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/remove_elements.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/reverse_bits.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/reverse_list.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/reverse_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/reverse_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/roman_to_integer.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/single_number.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn solve() -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn recurse(nums: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/str_in_str.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/title_to_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/two_sum.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/valid_anagram.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/valid_palindrome.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/valid_parentheses.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse` is never used [INFO] [stdout] --> src/problems/easy/valid_parentheses.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn reverse(c: char) -> char { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/hard/find_median_sorted_arrays.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> f64 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | fn new(val: i32, next: Option>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/divide_two_integers.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/generate_parenthesis.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/medium/generate_parenthesis.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn recurse(s: String, all_strings: &mut Vec, num_open: i32, num_closed: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/int_to_roman.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/letter_combinations.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/medium/letter_combinations.rs:14:4 [INFO] [stdout] | [INFO] [stdout] 14 | fn recurse( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_letters` is never used [INFO] [stdout] --> src/problems/medium/letter_combinations.rs:35:4 [INFO] [stdout] | [INFO] [stdout] 35 | fn get_letters(digit: char) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/longest_palindrome.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `palindrome_odd` is never used [INFO] [stdout] --> src/problems/medium/longest_palindrome.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn palindrome_odd(s: &str, curr_longest: &mut VecDeque) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `palindrome_even` is never used [INFO] [stdout] --> src/problems/medium/longest_palindrome.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn palindrome_even(s: &str, curr_longest: &mut VecDeque) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/longest_substring.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/max_area.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/my_atoi.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/reverse_integer.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/medium/swap_nodes.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/medium/swap_nodes.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/swap_nodes.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/three_sum.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/three_sum_closest.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/zigzag_conversion.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/add_binary.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/add_digits.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_height` is never used [INFO] [stdout] --> src/problems/easy/balanced_binary_tree.rs:90:4 [INFO] [stdout] | [INFO] [stdout] 90 | fn get_height(curr_node: &Option>>) -> Result { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `traverse` is never used [INFO] [stdout] --> src/problems/easy/binary_tree_paths.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn traverse( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/buy_and_sell_stocks.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/climbing_stairs.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb` is never used [INFO] [stdout] --> src/problems/easy/climbing_stairs.rs:8:4 [INFO] [stdout] | [INFO] [stdout] 8 | fn climb(steps_left: i32, memo: &mut HashMap) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/contains_duplicates.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/contains_nearby_duplicates.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/convert_to_title.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/convert_to_title.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn recurse(val: u32, s: &mut String) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/count_nodes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_missing` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:66:4 [INFO] [stdout] | [INFO] [stdout] 66 | fn count_missing( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_height` is never used [INFO] [stdout] --> src/problems/easy/count_nodes.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn get_height(node: &Option>>, height: &mut i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `naive_solve` is never used [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn naive_solve() -> Option> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/hamming_weight.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_node` is never used [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn search_node(curr_node: &Rc>, tracker_vec: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn solve() -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse_reverse` is never used [INFO] [stdout] --> src/problems/easy/invert_binary_tree.rs:59:4 [INFO] [stdout] | [INFO] [stdout] 59 | fn recurse_reverse(node: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_happy.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_isomorphic.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `WrappedTreeNode` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 20 | type WrappedTreeNode = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `compare_trees` is never used [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:48:4 [INFO] [stdout] | [INFO] [stdout] 48 | fn compare_trees(p: &WrappedTreeNode, q: &WrappedTreeNode) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/is_symetric.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `WrappedTreeNode` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 20 | type WrappedTreeNode = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cmp_nodes` is never used [INFO] [stdout] --> src/problems/easy/is_symetric.rs:60:4 [INFO] [stdout] | [INFO] [stdout] 60 | fn cmp_nodes(l_node: &WrappedTreeNode, r_node: &WrappedTreeNode) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/kata_machine.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> [i32; 10] { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/length_of_the_last_word.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/majority_element.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/max_depth.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `WrappedTreeNode` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 20 | type WrappedTreeNode = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/problems/easy/max_depth.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn search(node: &WrappedTreeNode) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/merge_sorted_arr.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/merge_two_sorted_lists.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/merge_two_sorted_lists.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/merge_two_sorted_lists.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:54:4 [INFO] [stdout] | [INFO] [stdout] 54 | fn recurse(curr_node: &Option>>, curr_depth: &mut i32, shortest: &mut i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/my_sqrt.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `naive_solve` is never used [INFO] [stdout] --> src/problems/easy/my_sqrt.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn naive_solve() -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyStack` is never constructed [INFO] [stdout] --> src/problems/easy/my_stack.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct MyStack { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used [INFO] [stdout] --> src/problems/easy/my_stack.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 10 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/my_stack.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn solve() { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/palindrome_linked_list.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/palindrome_linked_list.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/palindrome_linked_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/palindrome_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/pascals_trianble_2.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/pascals_triangle.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/path_sum.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/path_sum.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/path_sum.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/path_sum.rs:71:4 [INFO] [stdout] | [INFO] [stdout] 71 | fn recurse(curr_node: &Option>>, curr_sum: &mut i32, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/plus_one.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/postorder_traversal.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn recurse(node: &Option>>, order: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/power_of_two.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/preorder_traversal.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn recurse(node: &Option>>, order: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 12 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn peek(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/remove_duplicates.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/remove_element.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/remove_elements.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/remove_elements.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/remove_elements.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/reverse_bits.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/easy/reverse_list.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/reverse_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/reverse_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/roman_to_integer.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/single_number.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn solve() -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/easy/sorted_array_to_bst.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn recurse(nums: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/str_in_str.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/title_to_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/two_sum.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/valid_anagram.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> u32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/valid_palindrome.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/easy/valid_parentheses.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse` is never used [INFO] [stdout] --> src/problems/easy/valid_parentheses.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn reverse(c: char) -> char { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/hard/find_median_sorted_arrays.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> f64 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | fn new(val: i32, next: Option>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/divide_two_integers.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/generate_parenthesis.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/medium/generate_parenthesis.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn recurse(s: String, all_strings: &mut Vec, num_open: i32, num_closed: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/int_to_roman.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/letter_combinations.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recurse` is never used [INFO] [stdout] --> src/problems/medium/letter_combinations.rs:14:4 [INFO] [stdout] | [INFO] [stdout] 14 | fn recurse( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_letters` is never used [INFO] [stdout] --> src/problems/medium/letter_combinations.rs:35:4 [INFO] [stdout] | [INFO] [stdout] 35 | fn get_letters(digit: char) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/longest_palindrome.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `palindrome_odd` is never used [INFO] [stdout] --> src/problems/medium/longest_palindrome.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn palindrome_odd(s: &str, curr_longest: &mut VecDeque) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `palindrome_even` is never used [INFO] [stdout] --> src/problems/medium/longest_palindrome.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn palindrome_even(s: &str, curr_longest: &mut VecDeque) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/longest_substring.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/max_area.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/my_atoi.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/reverse_integer.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/problems/medium/swap_nodes.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problems/medium/swap_nodes.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/swap_nodes.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn solve() -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/three_sum.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/three_sum_closest.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solve() -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve` is never used [INFO] [stdout] --> src/problems/medium/zigzag_conversion.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve() -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this boolean expression can be simplified [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 72 | if !(next_val == curr_val) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: try: `(next_val != curr_val)` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#nonminimal_bool [INFO] [stdout] = note: `#[warn(clippy::nonminimal_bool)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: used `unwrap()` on `Some` value [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:41:18 [INFO] [stdout] | [INFO] [stdout] 41 | search_node(&root.unwrap(), &mut tracker); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: remove the `Some` and `unwrap()` [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:22:16 [INFO] [stdout] | [INFO] [stdout] 22 | let root = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ________________^ [INFO] [stdout] 23 | | val: 1, [INFO] [stdout] 24 | | left: None, [INFO] [stdout] 25 | | right: Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] ... | [INFO] [stdout] 33 | | }))), [INFO] [stdout] 34 | | }))); [INFO] [stdout] | |________^ [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_literal_unwrap [INFO] [stdout] = note: `#[warn(clippy::unnecessary_literal_unwrap)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | / return compare_trees(&p_node.left, &q_node.left) [INFO] [stdout] 65 | | && compare_trees(&p_node.right, &q_node.right); [INFO] [stdout] | |______________________________________________________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] = note: `#[warn(clippy::needless_return)]` on by default [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 64 ~ compare_trees(&p_node.left, &q_node.left) [INFO] [stdout] 65 ~ && compare_trees(&p_node.right, &q_node.right) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/is_symetric.rs:75:5 [INFO] [stdout] | [INFO] [stdout] 75 | return cmp_nodes(&l.left, &r.right) && cmp_nodes(&l.right, &r.left); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 75 - return cmp_nodes(&l.left, &r.right) && cmp_nodes(&l.right, &r.left); [INFO] [stdout] 75 + cmp_nodes(&l.left, &r.right) && cmp_nodes(&l.right, &r.left) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: accessing first element with `strs.get(0)` [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:10:22 [INFO] [stdout] | [INFO] [stdout] 10 | let first_word = strs.get(0).unwrap(); [INFO] [stdout] | ^^^^^^^^^^^ help: try: `strs.first()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#get_first [INFO] [stdout] = note: `#[warn(clippy::get_first)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/max_depth.rs:77:5 [INFO] [stdout] | [INFO] [stdout] 77 | return i32::max(l_val, r_val); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 77 - return i32::max(l_val, r_val); [INFO] [stdout] 77 + i32::max(l_val, r_val) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this boolean expression can be simplified [INFO] [stdout] --> src/problems/easy/delete_duplicates.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 72 | if !(next_val == curr_val) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: try: `(next_val != curr_val)` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#nonminimal_bool [INFO] [stdout] = note: `#[warn(clippy::nonminimal_bool)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: used `unwrap()` on `Some` value [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:41:18 [INFO] [stdout] | [INFO] [stdout] 41 | search_node(&root.unwrap(), &mut tracker); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: remove the `Some` and `unwrap()` [INFO] [stdout] --> src/problems/easy/inorder_traversal.rs:22:16 [INFO] [stdout] | [INFO] [stdout] 22 | let root = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ________________^ [INFO] [stdout] 23 | | val: 1, [INFO] [stdout] 24 | | left: None, [INFO] [stdout] 25 | | right: Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] ... | [INFO] [stdout] 33 | | }))), [INFO] [stdout] 34 | | }))); [INFO] [stdout] | |________^ [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_literal_unwrap [INFO] [stdout] = note: `#[warn(clippy::unnecessary_literal_unwrap)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: binary comparison to literal `Option::None` [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | if root == None { [INFO] [stdout] | ^^^^^^^^^^^^ help: use `Option::is_none()` instead: `root.is_none()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#partialeq_to_none [INFO] [stdout] = note: `#[warn(clippy::partialeq_to_none)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: importing legacy numeric constants [INFO] [stdout] --> src/problems/easy/my_sqrt.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::u128; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: remove this import [INFO] [stdout] = note: then `u128::` will resolve to the respective associated constant [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#legacy_numeric_constants [INFO] [stdout] = note: `#[warn(clippy::legacy_numeric_constants)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/is_same_tree.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | / return compare_trees(&p_node.left, &q_node.left) [INFO] [stdout] 65 | | && compare_trees(&p_node.right, &q_node.right); [INFO] [stdout] | |______________________________________________________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] = note: `#[warn(clippy::needless_return)]` on by default [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 64 ~ compare_trees(&p_node.left, &q_node.left) [INFO] [stdout] 65 ~ && compare_trees(&p_node.right, &q_node.right) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/is_symetric.rs:75:5 [INFO] [stdout] | [INFO] [stdout] 75 | return cmp_nodes(&l.left, &r.right) && cmp_nodes(&l.right, &r.left); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 75 - return cmp_nodes(&l.left, &r.right) && cmp_nodes(&l.right, &r.left); [INFO] [stdout] 75 + cmp_nodes(&l.left, &r.right) && cmp_nodes(&l.right, &r.left) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: binary comparison to literal `Option::None` [INFO] [stdout] --> src/problems/easy/path_sum.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | if root == None { [INFO] [stdout] | ^^^^^^^^^^^^ help: use `Option::is_none()` instead: `root.is_none()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#partialeq_to_none [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: accessing first element with `strs.get(0)` [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:10:22 [INFO] [stdout] | [INFO] [stdout] 10 | let first_word = strs.get(0).unwrap(); [INFO] [stdout] | ^^^^^^^^^^^ help: try: `strs.first()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#get_first [INFO] [stdout] = note: `#[warn(clippy::get_first)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/max_depth.rs:77:5 [INFO] [stdout] | [INFO] [stdout] 77 | return i32::max(l_val, r_val); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 77 - return i32::max(l_val, r_val); [INFO] [stdout] 77 + i32::max(l_val, r_val) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary closure used to substitute value for `Option::None` [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:23:9 [INFO] [stdout] | [INFO] [stdout] 23 | self.q.pop_front().unwrap_or_else(|| 0) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_lazy_evaluations [INFO] [stdout] = note: `#[warn(clippy::unnecessary_lazy_evaluations)]` on by default [INFO] [stdout] help: use `unwrap_or` instead [INFO] [stdout] | [INFO] [stdout] 23 - self.q.pop_front().unwrap_or_else(|| 0) [INFO] [stdout] 23 + self.q.pop_front().unwrap_or(0) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: called `unwrap` on `x` after checking its variant with `is_some` [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:32:20 [INFO] [stdout] | [INFO] [stdout] 31 | if x.is_some() { [INFO] [stdout] | -------------- help: try: `if let Some() = x` [INFO] [stdout] 32 | return x.unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_unwrap [INFO] [stdout] = note: `#[warn(clippy::unnecessary_unwrap)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:32:13 [INFO] [stdout] | [INFO] [stdout] 32 | return x.unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 32 - return x.unwrap().clone(); [INFO] [stdout] 32 + x.unwrap().clone() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | return 0; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 34 - return 0; [INFO] [stdout] 34 + 0 [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `clone` on type `i32` which implements the `Copy` trait [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:32:20 [INFO] [stdout] | [INFO] [stdout] 32 | return x.unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ help: try dereferencing it: `*x.unwrap()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#clone_on_copy [INFO] [stdout] = note: `#[warn(clippy::clone_on_copy)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | return self.q.is_empty(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 39 - return self.q.is_empty(); [INFO] [stdout] 39 + self.q.is_empty() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `clone` on type `i32` which implements the `Copy` trait [INFO] [stdout] --> src/problems/easy/remove_element.rs:7:19 [INFO] [stdout] | [INFO] [stdout] 7 | let num = nums.get(i - k).unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try dereferencing it: `*nums.get(i - k).unwrap()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#clone_on_copy [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: binary comparison to literal `Option::None` [INFO] [stdout] --> src/problems/easy/minimum_depth_of_binary_tree.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | if root == None { [INFO] [stdout] | ^^^^^^^^^^^^ help: use `Option::is_none()` instead: `root.is_none()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#partialeq_to_none [INFO] [stdout] = note: `#[warn(clippy::partialeq_to_none)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: importing legacy numeric constants [INFO] [stdout] --> src/problems/easy/my_sqrt.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::u128; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: remove this import [INFO] [stdout] = note: then `u128::` will resolve to the respective associated constant [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#legacy_numeric_constants [INFO] [stdout] = note: `#[warn(clippy::legacy_numeric_constants)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this `if` statement can be collapsed [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:14:9 [INFO] [stdout] | [INFO] [stdout] 14 | / if i == 0 { [INFO] [stdout] 15 | | if &target < val { [INFO] [stdout] 16 | | return Some(0); [INFO] [stdout] 17 | | } [INFO] [stdout] 18 | | } [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#collapsible_if [INFO] [stdout] = note: `#[warn(clippy::collapsible_if)]` on by default [INFO] [stdout] help: collapse nested if block [INFO] [stdout] | [INFO] [stdout] 14 ~ if i == 0 [INFO] [stdout] 15 ~ && &target < val { [INFO] [stdout] 16 | return Some(0); [INFO] [stdout] 17 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: used `unwrap()` on `Some` value [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:23:39 [INFO] [stdout] | [INFO] [stdout] 23 | let left = (curr.is_none() || curr.unwrap() <= &target); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: remove the `Some` and `unwrap()` [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:19:20 [INFO] [stdout] | [INFO] [stdout] 19 | let curr = Some(val); [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_literal_unwrap [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: importing legacy numeric constants [INFO] [stdout] --> src/problems/easy/single_number.rs:1:33 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{collections::HashMap, i32}; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: remove this import [INFO] [stdout] = note: then `i32::` will resolve to the respective associated constant [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#legacy_numeric_constants [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/str_in_str.rs:6:22 [INFO] [stdout] | [INFO] [stdout] 6 | Some(pos) => return pos as i32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 6 ~ Some(pos) => pos as i32, [INFO] [stdout] 7 | None => return -1, [INFO] [stdout] 8 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/str_in_str.rs:7:17 [INFO] [stdout] | [INFO] [stdout] 7 | None => return -1, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 7 ~ None => -1, [INFO] [stdout] 8 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this expression always evaluates to false [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | if nums.is_empty() { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#const_is_empty [INFO] [stdout] = note: `#[warn(clippy::const_is_empty)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: binary comparison to literal `Option::None` [INFO] [stdout] --> src/problems/easy/path_sum.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | if root == None { [INFO] [stdout] | ^^^^^^^^^^^^ help: use `Option::is_none()` instead: `root.is_none()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#partialeq_to_none [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless conversion to the same type: `std::string::String` [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | String::from(seq_start.to_string() + " -> " + &prior_num.to_string()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider removing `String::from()`: `(seq_start.to_string() + " -> " + &prior_num.to_string())` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_conversion [INFO] [stdout] = note: `#[warn(clippy::useless_conversion)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless conversion to the same type: `std::string::String` [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:17:29 [INFO] [stdout] | [INFO] [stdout] 17 | new_range = String::from(seq_start.to_string()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider removing `String::from()`: `seq_start.to_string()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_conversion [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless conversion to the same type: `std::string::String` [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:32:21 [INFO] [stdout] | [INFO] [stdout] 32 | ranges.push(String::from( [INFO] [stdout] | _____________________^ [INFO] [stdout] 33 | | seq_start.to_string() + " -> " + &prior_num.to_string(), [INFO] [stdout] 34 | | )); [INFO] [stdout] | |_________^ help: consider removing `String::from()`: `(seq_start.to_string() + " -> " + &prior_num.to_string())` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_conversion [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary closure used to substitute value for `Option::None` [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:23:9 [INFO] [stdout] | [INFO] [stdout] 23 | self.q.pop_front().unwrap_or_else(|| 0) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_lazy_evaluations [INFO] [stdout] = note: `#[warn(clippy::unnecessary_lazy_evaluations)]` on by default [INFO] [stdout] help: use `unwrap_or` instead [INFO] [stdout] | [INFO] [stdout] 23 - self.q.pop_front().unwrap_or_else(|| 0) [INFO] [stdout] 23 + self.q.pop_front().unwrap_or(0) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: called `unwrap` on `x` after checking its variant with `is_some` [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:32:20 [INFO] [stdout] | [INFO] [stdout] 31 | if x.is_some() { [INFO] [stdout] | -------------- help: try: `if let Some() = x` [INFO] [stdout] 32 | return x.unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_unwrap [INFO] [stdout] = note: `#[warn(clippy::unnecessary_unwrap)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:32:13 [INFO] [stdout] | [INFO] [stdout] 32 | return x.unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 32 - return x.unwrap().clone(); [INFO] [stdout] 32 + x.unwrap().clone() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | return 0; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 34 - return 0; [INFO] [stdout] 34 + 0 [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `clone` on type `i32` which implements the `Copy` trait [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:32:20 [INFO] [stdout] | [INFO] [stdout] 32 | return x.unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ help: try dereferencing it: `*x.unwrap()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#clone_on_copy [INFO] [stdout] = note: `#[warn(clippy::clone_on_copy)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/queue_using_stacks.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | return self.q.is_empty(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 39 - return self.q.is_empty(); [INFO] [stdout] 39 + self.q.is_empty() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `clone` on type `i32` which implements the `Copy` trait [INFO] [stdout] --> src/problems/easy/remove_element.rs:7:19 [INFO] [stdout] | [INFO] [stdout] 7 | let num = nums.get(i - k).unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try dereferencing it: `*nums.get(i - k).unwrap()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#clone_on_copy [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: match expression looks like `matches!` macro [INFO] [stdout] --> src/problems/easy/valid_parentheses.rs:10:26 [INFO] [stdout] | [INFO] [stdout] 10 | let is_closing = match c { [INFO] [stdout] | __________________________^ [INFO] [stdout] 11 | | ')' => true, [INFO] [stdout] 12 | | ']' => true, [INFO] [stdout] 13 | | '}' => true, [INFO] [stdout] 14 | | _ => false, [INFO] [stdout] 15 | | }; [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#match_like_matches_macro [INFO] [stdout] = note: `#[warn(clippy::match_like_matches_macro)]` on by default [INFO] [stdout] help: use `matches!` directly [INFO] [stdout] | [INFO] [stdout] 10 - let is_closing = match c { [INFO] [stdout] 11 - ')' => true, [INFO] [stdout] 12 - ']' => true, [INFO] [stdout] 13 - '}' => true, [INFO] [stdout] 14 - _ => false, [INFO] [stdout] 15 - }; [INFO] [stdout] 10 + let is_closing = matches!(c, ')' | ']' | '}'); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | return ListNode { next: None, val }; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 15 - return ListNode { next: None, val }; [INFO] [stdout] 15 + ListNode { next: None, val } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this `if` statement can be collapsed [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:14:9 [INFO] [stdout] | [INFO] [stdout] 14 | / if i == 0 { [INFO] [stdout] 15 | | if &target < val { [INFO] [stdout] 16 | | return Some(0); [INFO] [stdout] 17 | | } [INFO] [stdout] 18 | | } [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#collapsible_if [INFO] [stdout] = note: `#[warn(clippy::collapsible_if)]` on by default [INFO] [stdout] help: collapse nested if block [INFO] [stdout] | [INFO] [stdout] 14 ~ if i == 0 [INFO] [stdout] 15 ~ && &target < val { [INFO] [stdout] 16 | return Some(0); [INFO] [stdout] 17 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: used `unwrap()` on `Some` value [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:23:39 [INFO] [stdout] | [INFO] [stdout] 23 | let left = (curr.is_none() || curr.unwrap() <= &target); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: remove the `Some` and `unwrap()` [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:19:20 [INFO] [stdout] | [INFO] [stdout] 19 | let curr = Some(val); [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#unnecessary_literal_unwrap [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: importing legacy numeric constants [INFO] [stdout] --> src/problems/easy/single_number.rs:1:33 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{collections::HashMap, i32}; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: remove this import [INFO] [stdout] = note: then `i32::` will resolve to the respective associated constant [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#legacy_numeric_constants [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: it looks like the same item is being pushed into this `Vec` [INFO] [stdout] --> src/problems/medium/int_to_roman.rs:65:21 [INFO] [stdout] | [INFO] [stdout] 65 | tracker.push("M"); [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: consider using `vec!["M";SIZE]` [INFO] [stdout] = help: or `tracker.extend(std::iter::repeat_n("M", SIZE))` [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#same_item_push [INFO] [stdout] = note: `#[warn(clippy::same_item_push)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/str_in_str.rs:6:22 [INFO] [stdout] | [INFO] [stdout] 6 | Some(pos) => return pos as i32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 6 ~ Some(pos) => pos as i32, [INFO] [stdout] 7 | None => return -1, [INFO] [stdout] 8 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/easy/str_in_str.rs:7:17 [INFO] [stdout] | [INFO] [stdout] 7 | None => return -1, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 7 ~ None => -1, [INFO] [stdout] 8 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this expression always evaluates to false [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | if nums.is_empty() { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#const_is_empty [INFO] [stdout] = note: `#[warn(clippy::const_is_empty)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: calling `push_str()` using a single-character converted to string [INFO] [stdout] --> src/problems/medium/longest_substring.rs:22:13 [INFO] [stdout] | [INFO] [stdout] 22 | tmp_str.push_str(&c.to_string()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `push` without `to_string()`: `tmp_str.push(c)` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#single_char_add_str [INFO] [stdout] = note: `#[warn(clippy::single_char_add_str)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless conversion to the same type: `std::string::String` [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | String::from(seq_start.to_string() + " -> " + &prior_num.to_string()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider removing `String::from()`: `(seq_start.to_string() + " -> " + &prior_num.to_string())` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_conversion [INFO] [stdout] = note: `#[warn(clippy::useless_conversion)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless conversion to the same type: `std::string::String` [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:17:29 [INFO] [stdout] | [INFO] [stdout] 17 | new_range = String::from(seq_start.to_string()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider removing `String::from()`: `seq_start.to_string()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_conversion [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless conversion to the same type: `std::string::String` [INFO] [stdout] --> src/problems/easy/summary_ranges.rs:32:21 [INFO] [stdout] | [INFO] [stdout] 32 | ranges.push(String::from( [INFO] [stdout] | _____________________^ [INFO] [stdout] 33 | | seq_start.to_string() + " -> " + &prior_num.to_string(), [INFO] [stdout] 34 | | )); [INFO] [stdout] | |_________^ help: consider removing `String::from()`: `(seq_start.to_string() + " -> " + &prior_num.to_string())` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_conversion [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this `if` can be collapsed into the outer `match` [INFO] [stdout] --> src/problems/medium/my_atoi.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | / if num > i32::MAX as u64 { [INFO] [stdout] 45 | | return i32::MAX; [INFO] [stdout] 46 | | } [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#collapsible_match [INFO] [stdout] = note: `#[warn(clippy::collapsible_match)]` on by default [INFO] [stdout] help: collapse nested if block [INFO] [stdout] | [INFO] [stdout] 43 ~ 1 [INFO] [stdout] 44 ~ if num > i32::MAX as u64 => { [INFO] [stdout] 45 | return i32::MAX; [INFO] [stdout] 46 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this `if` can be collapsed into the outer `match` [INFO] [stdout] --> src/problems/medium/my_atoi.rs:49:13 [INFO] [stdout] | [INFO] [stdout] 49 | / if num > -(i32::MIN as i64) as u64 { [INFO] [stdout] 50 | | return i32::MIN; [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#collapsible_match [INFO] [stdout] help: collapse nested if block [INFO] [stdout] | [INFO] [stdout] 48 ~ -1 [INFO] [stdout] 49 ~ if num > -(i32::MIN as i64) as u64 => { [INFO] [stdout] 50 | return i32::MIN; [INFO] [stdout] 51 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: redundant pattern matching, consider using `is_some()` [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:24:15 [INFO] [stdout] | [INFO] [stdout] 24 | while let Some(_) = curr { [INFO] [stdout] | ----------^^^^^^^------- help: try: `while curr.is_some()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#redundant_pattern_matching [INFO] [stdout] = note: `#[warn(clippy::redundant_pattern_matching)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: match expression looks like `matches!` macro [INFO] [stdout] --> src/problems/easy/valid_parentheses.rs:10:26 [INFO] [stdout] | [INFO] [stdout] 10 | let is_closing = match c { [INFO] [stdout] | __________________________^ [INFO] [stdout] 11 | | ')' => true, [INFO] [stdout] 12 | | ']' => true, [INFO] [stdout] 13 | | '}' => true, [INFO] [stdout] 14 | | _ => false, [INFO] [stdout] 15 | | }; [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#match_like_matches_macro [INFO] [stdout] = note: `#[warn(clippy::match_like_matches_macro)]` on by default [INFO] [stdout] help: use `matches!` directly [INFO] [stdout] | [INFO] [stdout] 10 - let is_closing = match c { [INFO] [stdout] 11 - ')' => true, [INFO] [stdout] 12 - ']' => true, [INFO] [stdout] 13 - '}' => true, [INFO] [stdout] 14 - _ => false, [INFO] [stdout] 15 - }; [INFO] [stdout] 10 + let is_closing = matches!(c, ')' | ']' | '}'); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unneeded `return` statement [INFO] [stdout] --> src/problems/medium/add_two_numbers.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | return ListNode { next: None, val }; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#needless_return [INFO] [stdout] help: remove `return` [INFO] [stdout] | [INFO] [stdout] 15 - return ListNode { next: None, val }; [INFO] [stdout] 15 + ListNode { next: None, val } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: it looks like the same item is being pushed into this `Vec` [INFO] [stdout] --> src/problems/medium/int_to_roman.rs:65:21 [INFO] [stdout] | [INFO] [stdout] 65 | tracker.push("M"); [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: consider using `vec!["M";SIZE]` [INFO] [stdout] = help: or `tracker.extend(std::iter::repeat_n("M", SIZE))` [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#same_item_push [INFO] [stdout] = note: `#[warn(clippy::same_item_push)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/buy_and_sell_stocks.rs:2:18 [INFO] [stdout] | [INFO] [stdout] 2 | let prices = vec![7, 1, 5, 3, 6, 4]; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ help: you can use an array directly: `[7, 1, 5, 3, 6, 4]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] = note: `#[warn(clippy::useless_vec)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:2:16 [INFO] [stdout] | [INFO] [stdout] 2 | let strs = vec![ [INFO] [stdout] | ________________^ [INFO] [stdout] 3 | | "flower".to_string(), [INFO] [stdout] 4 | | "flow".to_string(), [INFO] [stdout] 5 | | "flight".to_string(), [INFO] [stdout] 6 | | ]; [INFO] [stdout] | |_____^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] help: you can use an array directly [INFO] [stdout] | [INFO] [stdout] 2 ~ let strs = ["flower".to_string(), [INFO] [stdout] 3 + "flow".to_string(), [INFO] [stdout] 4 ~ "flight".to_string()]; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/majority_element.rs:4:16 [INFO] [stdout] | [INFO] [stdout] 4 | let nums = vec![1]; [INFO] [stdout] | ^^^^^^^ help: you can use an array directly: `[1]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:2:16 [INFO] [stdout] | [INFO] [stdout] 2 | let nums = vec![1, 3, 5, 6]; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ help: you can use an array directly: `[1, 3, 5, 6]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/hard/find_median_sorted_arrays.rs:2:17 [INFO] [stdout] | [INFO] [stdout] 2 | let nums1 = vec![1i32, 3]; [INFO] [stdout] | ^^^^^^^^^^^^^ help: you can use an array directly: `[1i32, 3]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/hard/find_median_sorted_arrays.rs:3:17 [INFO] [stdout] | [INFO] [stdout] 3 | let nums2 = vec![2i32]; [INFO] [stdout] | ^^^^^^^^^^ help: you can use an array directly: `[2i32]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/medium/search_in_rotated_sorted_array.rs:2:16 [INFO] [stdout] | [INFO] [stdout] 2 | let nums = vec![5, 1, 3]; [INFO] [stdout] | ^^^^^^^^^^^^^ help: you can use an array directly: `[5, 1, 3]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: calling `push_str()` using a single-character converted to string [INFO] [stdout] --> src/problems/medium/longest_substring.rs:22:13 [INFO] [stdout] | [INFO] [stdout] 22 | tmp_str.push_str(&c.to_string()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `push` without `to_string()`: `tmp_str.push(c)` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#single_char_add_str [INFO] [stdout] = note: `#[warn(clippy::single_char_add_str)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this `if` can be collapsed into the outer `match` [INFO] [stdout] --> src/problems/medium/my_atoi.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | / if num > i32::MAX as u64 { [INFO] [stdout] 45 | | return i32::MAX; [INFO] [stdout] 46 | | } [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#collapsible_match [INFO] [stdout] = note: `#[warn(clippy::collapsible_match)]` on by default [INFO] [stdout] help: collapse nested if block [INFO] [stdout] | [INFO] [stdout] 43 ~ 1 [INFO] [stdout] 44 ~ if num > i32::MAX as u64 => { [INFO] [stdout] 45 | return i32::MAX; [INFO] [stdout] 46 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: this `if` can be collapsed into the outer `match` [INFO] [stdout] --> src/problems/medium/my_atoi.rs:49:13 [INFO] [stdout] | [INFO] [stdout] 49 | / if num > -(i32::MIN as i64) as u64 { [INFO] [stdout] 50 | | return i32::MIN; [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#collapsible_match [INFO] [stdout] help: collapse nested if block [INFO] [stdout] | [INFO] [stdout] 48 ~ -1 [INFO] [stdout] 49 ~ if num > -(i32::MIN as i64) as u64 => { [INFO] [stdout] 50 | return i32::MIN; [INFO] [stdout] 51 ~ } [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: redundant pattern matching, consider using `is_some()` [INFO] [stdout] --> src/problems/medium/remove_nth_node_from_end.rs:24:15 [INFO] [stdout] | [INFO] [stdout] 24 | while let Some(_) = curr { [INFO] [stdout] | ----------^^^^^^^------- help: try: `while curr.is_some()` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#redundant_pattern_matching [INFO] [stdout] = note: `#[warn(clippy::redundant_pattern_matching)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/buy_and_sell_stocks.rs:2:18 [INFO] [stdout] | [INFO] [stdout] 2 | let prices = vec![7, 1, 5, 3, 6, 4]; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ help: you can use an array directly: `[7, 1, 5, 3, 6, 4]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] = note: `#[warn(clippy::useless_vec)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/longest_common_prefix.rs:2:16 [INFO] [stdout] | [INFO] [stdout] 2 | let strs = vec![ [INFO] [stdout] | ________________^ [INFO] [stdout] 3 | | "flower".to_string(), [INFO] [stdout] 4 | | "flow".to_string(), [INFO] [stdout] 5 | | "flight".to_string(), [INFO] [stdout] 6 | | ]; [INFO] [stdout] | |_____^ [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] help: you can use an array directly [INFO] [stdout] | [INFO] [stdout] 2 ~ let strs = ["flower".to_string(), [INFO] [stdout] 3 + "flow".to_string(), [INFO] [stdout] 4 ~ "flight".to_string()]; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/majority_element.rs:4:16 [INFO] [stdout] | [INFO] [stdout] 4 | let nums = vec![1]; [INFO] [stdout] | ^^^^^^^ help: you can use an array directly: `[1]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/easy/search_insert_position.rs:2:16 [INFO] [stdout] | [INFO] [stdout] 2 | let nums = vec![1, 3, 5, 6]; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ help: you can use an array directly: `[1, 3, 5, 6]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/hard/find_median_sorted_arrays.rs:2:17 [INFO] [stdout] | [INFO] [stdout] 2 | let nums1 = vec![1i32, 3]; [INFO] [stdout] | ^^^^^^^^^^^^^ help: you can use an array directly: `[1i32, 3]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/hard/find_median_sorted_arrays.rs:3:17 [INFO] [stdout] | [INFO] [stdout] 3 | let nums2 = vec![2i32]; [INFO] [stdout] | ^^^^^^^^^^ help: you can use an array directly: `[2i32]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: useless use of `vec!` [INFO] [stdout] --> src/problems/medium/search_in_rotated_sorted_array.rs:2:16 [INFO] [stdout] | [INFO] [stdout] 2 | let nums = vec![5, 1, 3]; [INFO] [stdout] | ^^^^^^^^^^^^^ help: you can use an array directly: `[5, 1, 3]` [INFO] [stdout] | [INFO] [stdout] = help: for further information visit https://rust-lang.github.io/rust-clippy/master/index.html#useless_vec [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.37s [INFO] running `Command { std: "docker" "inspect" "e1155ff3abed5cb8ce805256ec12a19f30bc4900d7ba52afdc6c7d615f9573e9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "e1155ff3abed5cb8ce805256ec12a19f30bc4900d7ba52afdc6c7d615f9573e9", kill_on_drop: false }` [INFO] [stdout] e1155ff3abed5cb8ce805256ec12a19f30bc4900d7ba52afdc6c7d615f9573e9