[INFO] updating cached repository https://github.com/photoszzt/code_practice [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "-c" "remote.origin.fetch=refs/heads/*:refs/heads/*" "fetch" "origin" "--force" "--prune", kill_on_drop: false }` [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 55e40661df4fbadae2e76224236e65dce6b24a37 [INFO] testing photoszzt/code_practice/55e40661df4fbadae2e76224236e65dce6b24a37 against beta-2022-04-10 for beta-1.61-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice" "/workspace/builds/worker-57/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-57/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/photoszzt/code_practice on toolchain beta-2022-04-10 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-04-10" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-57/source/.cargo/config [INFO] started tweaking git repo https://github.com/photoszzt/code_practice [INFO] finished tweaking git repo https://github.com/photoszzt/code_practice [INFO] tweaked toml for git repo https://github.com/photoszzt/code_practice written to /workspace/builds/worker-57/source/Cargo.toml [INFO] crate git repo https://github.com/photoszzt/code_practice already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-04-10" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 793751834db0eda78be8d61f1ef97ccace60238939c310ca38c4432037f5219d [INFO] running `Command { std: "docker" "start" "-a" "793751834db0eda78be8d61f1ef97ccace60238939c310ca38c4432037f5219d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "793751834db0eda78be8d61f1ef97ccace60238939c310ca38c4432037f5219d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "793751834db0eda78be8d61f1ef97ccace60238939c310ca38c4432037f5219d", kill_on_drop: false }` [INFO] [stdout] 793751834db0eda78be8d61f1ef97ccace60238939c310ca38c4432037f5219d [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/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=warn" "-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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 5a144c0f04cbec332283af3fe7e2db76a9f1ca566f77d1f5479cf285c9b41e4a [INFO] running `Command { std: "docker" "start" "-a" "5a144c0f04cbec332283af3fe7e2db76a9f1ca566f77d1f5479cf285c9b41e4a", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Compiling code_practice v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0001_two_sum.rs:52:20 [INFO] [stdout] | [INFO] [stdout] 52 | if (idx != *counter_idx) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - if (idx != *counter_idx) { [INFO] [stdout] 52 + if idx != *counter_idx { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:32:42 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::leetcode::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:28:28 [INFO] [stdout] | [INFO] [stdout] 28 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 29 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:63:29 [INFO] [stdout] | [INFO] [stdout] 63 | let part1 = (left_tree.val == right_tree.val); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - let part1 = (left_tree.val == right_tree.val); [INFO] [stdout] 63 + let part1 = left_tree.val == right_tree.val; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:30:28 [INFO] [stdout] | [INFO] [stdout] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 31 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:30:28 [INFO] [stdout] | [INFO] [stdout] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 31 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:30:28 [INFO] [stdout] | [INFO] [stdout] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 31 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:27:28 [INFO] [stdout] | [INFO] [stdout] 27 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 28 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:65:16 [INFO] [stdout] | [INFO] [stdout] 65 | if (left_min == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 65 - if (left_min == 0) { [INFO] [stdout] 65 + if left_min == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:67:23 [INFO] [stdout] | [INFO] [stdout] 67 | } else if (right_min == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 67 - } else if (right_min == 0) { [INFO] [stdout] 67 + } else if right_min == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:45:28 [INFO] [stdout] | [INFO] [stdout] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 46 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:45:28 [INFO] [stdout] | [INFO] [stdout] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 46 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:64:15 [INFO] [stdout] | [INFO] [stdout] 64 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 - while (!queue.is_empty()) { [INFO] [stdout] 64 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:47:15 [INFO] [stdout] | [INFO] [stdout] 47 | while (arri < word1.len() || arrj < word2.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - while (arri < word1.len() || arrj < word2.len()) { [INFO] [stdout] 47 + while arri < word1.len() || arrj < word2.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pos` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut pos = 0; [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_pos` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `cur_num` is never read [INFO] [stdout] --> src/leetcode/s0007_reverse_integer.rs:58:21 [INFO] [stdout] | [INFO] [stdout] 58 | let mut cur_num = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `start_num` is never read [INFO] [stdout] --> src/leetcode/s0008_string_to_integer_atoi.rs:120:17 [INFO] [stdout] | [INFO] [stdout] 120 | let mut start_num = 0; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/leetcode/s0069_sqrtx.rs:41:17 [INFO] [stdout] | [INFO] [stdout] 41 | let mut mid = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | for i in 0..qlen { [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/leetcode/s0002_add_two_numbers.rs:64:13 [INFO] [stdout] | [INFO] [stdout] 64 | let mut pos = 0; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [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/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [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/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0001_two_sum.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/leetcode/s0001_two_sum.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0005_longest_palindromic_substring.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome` [INFO] [stdout] --> src/leetcode/s0005_longest_palindromic_substring.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0006_zigzag_conversion.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `convert` [INFO] [stdout] --> src/leetcode/s0006_zigzag_conversion.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0007_reverse_integer.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/leetcode/s0007_reverse_integer.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0008_string_to_integer_atoi.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/leetcode/s0008_string_to_integer_atoi.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn my_atoi(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0009_palindrome_number.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/leetcode/s0009_palindrome_number.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations` [INFO] [stdout] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0069_sqrtx.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_sqrt` [INFO] [stdout] --> src/leetcode/s0069_sqrtx.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sym` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | fn sym(left: Option>>, right: Option>>) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order` [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `zigzag_level_order` [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order_bottom` [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_depth` [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_traversal` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:87:12 [INFO] [stdout] | [INFO] [stdout] 87 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `postorder_traversal` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:88:12 [INFO] [stdout] | [INFO] [stdout] 88 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LRUCache` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `access` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:87:8 [INFO] [stdout] | [INFO] [stdout] 87 | fn access(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_lru` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:93:8 [INFO] [stdout] | [INFO] [stdout] 93 | fn remove_lru(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0283_move_zeroes.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_zeroes` [INFO] [stdout] --> src/leetcode/s0283_move_zeroes.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0516_longest_palindromic_subsequence.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome_subseq` [INFO] [stdout] --> src/leetcode/s0516_longest_palindromic_subsequence.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn longest_palindrome_subseq(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0647_palindromic_substrings.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_substrings` [INFO] [stdout] --> src/leetcode/s0647_palindromic_substrings.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn count_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `open_lock` [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn open_lock(deadends: Vec, target: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `smallest_subsequence` [INFO] [stdout] --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn smallest_subsequence(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `array_strings_are_equal` [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn array_strings_are_equal(word1: Vec, word2: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/util/linked_list.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `to_list` [INFO] [stdout] --> src/leetcode/util/linked_list.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn to_list(vec: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/util/tree.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `to_tree` [INFO] [stdout] --> src/leetcode/util/tree.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn to_tree(vec: Vec>) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 84 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 12.86s [INFO] running `Command { std: "docker" "inspect" "5a144c0f04cbec332283af3fe7e2db76a9f1ca566f77d1f5479cf285c9b41e4a", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5a144c0f04cbec332283af3fe7e2db76a9f1ca566f77d1f5479cf285c9b41e4a", kill_on_drop: false }` [INFO] [stdout] 5a144c0f04cbec332283af3fe7e2db76a9f1ca566f77d1f5479cf285c9b41e4a [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/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=warn" "-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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 727c0cdd188be11b0979ef42fbbc7d1e087e6eb41619bbdbac05e95a9752d542 [INFO] running `Command { std: "docker" "start" "-a" "727c0cdd188be11b0979ef42fbbc7d1e087e6eb41619bbdbac05e95a9752d542", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0001_two_sum.rs:52:20 [INFO] [stdout] | [INFO] [stdout] 52 | if (idx != *counter_idx) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - if (idx != *counter_idx) { [INFO] [stdout] 52 + if idx != *counter_idx { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:32:42 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::leetcode::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:28:28 [INFO] [stdout] | [INFO] [stdout] 28 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 29 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:63:29 [INFO] [stdout] | [INFO] [stdout] 63 | let part1 = (left_tree.val == right_tree.val); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - let part1 = (left_tree.val == right_tree.val); [INFO] [stdout] 63 + let part1 = left_tree.val == right_tree.val; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:30:28 [INFO] [stdout] | [INFO] [stdout] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 31 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:30:28 [INFO] [stdout] | [INFO] [stdout] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 31 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:30:28 [INFO] [stdout] | [INFO] [stdout] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 31 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:27:28 [INFO] [stdout] | [INFO] [stdout] 27 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 28 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:65:16 [INFO] [stdout] | [INFO] [stdout] 65 | if (left_min == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 65 - if (left_min == 0) { [INFO] [stdout] 65 + if left_min == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:67:23 [INFO] [stdout] | [INFO] [stdout] 67 | } else if (right_min == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 67 - } else if (right_min == 0) { [INFO] [stdout] 67 + } else if right_min == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:45:28 [INFO] [stdout] | [INFO] [stdout] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 46 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:45:28 [INFO] [stdout] | [INFO] [stdout] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 46 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:64:15 [INFO] [stdout] | [INFO] [stdout] 64 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 - while (!queue.is_empty()) { [INFO] [stdout] 64 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:47:15 [INFO] [stdout] | [INFO] [stdout] 47 | while (arri < word1.len() || arrj < word2.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - while (arri < word1.len() || arrj < word2.len()) { [INFO] [stdout] 47 + while arri < word1.len() || arrj < word2.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pos` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut pos = 0; [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_pos` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `cur_num` is never read [INFO] [stdout] --> src/leetcode/s0007_reverse_integer.rs:58:21 [INFO] [stdout] | [INFO] [stdout] 58 | let mut cur_num = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `start_num` is never read [INFO] [stdout] --> src/leetcode/s0008_string_to_integer_atoi.rs:120:17 [INFO] [stdout] | [INFO] [stdout] 120 | let mut start_num = 0; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/leetcode/s0069_sqrtx.rs:41:17 [INFO] [stdout] | [INFO] [stdout] 41 | let mut mid = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | for i in 0..qlen { [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/leetcode/s0002_add_two_numbers.rs:64:13 [INFO] [stdout] | [INFO] [stdout] 64 | let mut pos = 0; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [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/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [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/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0001_two_sum.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/leetcode/s0001_two_sum.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0005_longest_palindromic_substring.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome` [INFO] [stdout] --> src/leetcode/s0005_longest_palindromic_substring.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0006_zigzag_conversion.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `convert` [INFO] [stdout] --> src/leetcode/s0006_zigzag_conversion.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0007_reverse_integer.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/leetcode/s0007_reverse_integer.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0008_string_to_integer_atoi.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/leetcode/s0008_string_to_integer_atoi.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn my_atoi(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0009_palindrome_number.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/leetcode/s0009_palindrome_number.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations` [INFO] [stdout] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0069_sqrtx.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_sqrt` [INFO] [stdout] --> src/leetcode/s0069_sqrtx.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sym` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | fn sym(left: Option>>, right: Option>>) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric` [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order` [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `zigzag_level_order` [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order_bottom` [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_depth` [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_traversal` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:87:12 [INFO] [stdout] | [INFO] [stdout] 87 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling code_practice v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `postorder_traversal` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:88:12 [INFO] [stdout] | [INFO] [stdout] 88 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LRUCache` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `access` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:87:8 [INFO] [stdout] | [INFO] [stdout] 87 | fn access(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_lru` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:93:8 [INFO] [stdout] | [INFO] [stdout] 93 | fn remove_lru(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0283_move_zeroes.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_zeroes` [INFO] [stdout] --> src/leetcode/s0283_move_zeroes.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0516_longest_palindromic_subsequence.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome_subseq` [INFO] [stdout] --> src/leetcode/s0516_longest_palindromic_subsequence.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn longest_palindrome_subseq(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0647_palindromic_substrings.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_substrings` [INFO] [stdout] --> src/leetcode/s0647_palindromic_substrings.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn count_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `open_lock` [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn open_lock(deadends: Vec, target: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `smallest_subsequence` [INFO] [stdout] --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn smallest_subsequence(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `array_strings_are_equal` [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn array_strings_are_equal(word1: Vec, word2: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/util/linked_list.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `to_list` [INFO] [stdout] --> src/leetcode/util/linked_list.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn to_list(vec: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/leetcode/util/tree.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `to_tree` [INFO] [stdout] --> src/leetcode/util/tree.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn to_tree(vec: Vec>) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 84 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0001_two_sum.rs:52:20 [INFO] [stdout] | [INFO] [stdout] 52 | if (idx != *counter_idx) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - if (idx != *counter_idx) { [INFO] [stdout] 52 + if idx != *counter_idx { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:79:9 [INFO] [stdout] | [INFO] [stdout] 79 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/leetcode/s0101_symmetric_tree.rs:63:29 [INFO] [stdout] | [INFO] [stdout] 63 | let part1 = (left_tree.val == right_tree.val); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - let part1 = (left_tree.val == right_tree.val); [INFO] [stdout] 63 + let part1 = left_tree.val == right_tree.val; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:68:15 [INFO] [stdout] | [INFO] [stdout] 68 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - while (!queue.is_empty()) { [INFO] [stdout] 68 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:65:16 [INFO] [stdout] | [INFO] [stdout] 65 | if (left_min == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 65 - if (left_min == 0) { [INFO] [stdout] 65 + if left_min == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:67:23 [INFO] [stdout] | [INFO] [stdout] 67 | } else if (right_min == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 67 - } else if (right_min == 0) { [INFO] [stdout] 67 + } else if right_min == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:45:28 [INFO] [stdout] | [INFO] [stdout] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 46 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:101:9 [INFO] [stdout] | [INFO] [stdout] 101 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `to_tree`, `tree` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:45:28 [INFO] [stdout] | [INFO] [stdout] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 46 | tree, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:102:9 [INFO] [stdout] | [INFO] [stdout] 102 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/leetcode/s0283_move_zeroes.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:64:15 [INFO] [stdout] | [INFO] [stdout] 64 | while (!queue.is_empty()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 - while (!queue.is_empty()) { [INFO] [stdout] 64 + while !queue.is_empty() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:47:15 [INFO] [stdout] | [INFO] [stdout] 47 | while (arri < word1.len() || arrj < word2.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - while (arri < word1.len() || arrj < word2.len()) { [INFO] [stdout] 47 + while arri < word1.len() || arrj < word2.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:74:9 [INFO] [stdout] | [INFO] [stdout] 74 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pos` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut pos = 0; [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_pos` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `cur_num` is never read [INFO] [stdout] --> src/leetcode/s0007_reverse_integer.rs:58:21 [INFO] [stdout] | [INFO] [stdout] 58 | let mut cur_num = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `start_num` is never read [INFO] [stdout] --> src/leetcode/s0008_string_to_integer_atoi.rs:120:17 [INFO] [stdout] | [INFO] [stdout] 120 | let mut start_num = 0; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/leetcode/s0069_sqrtx.rs:41:17 [INFO] [stdout] | [INFO] [stdout] 41 | let mut mid = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/s0752_open_the_lock.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | for i in 0..qlen { [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/leetcode/s0002_add_two_numbers.rs:64:13 [INFO] [stdout] | [INFO] [stdout] 64 | let mut pos = 0; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [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/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [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/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_traversal` [INFO] [stdout] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:87:12 [INFO] [stdout] | [INFO] [stdout] 87 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `postorder_traversal` [INFO] [stdout] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:88:12 [INFO] [stdout] | [INFO] [stdout] 88 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0146_lru_cache.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s0283_move_zeroes.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_zeroes` [INFO] [stdout] --> src/leetcode/s0283_move_zeroes.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `array_strings_are_equal` [INFO] [stdout] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn array_strings_are_equal(word1: Vec, word2: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 36 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 2.18s [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/code_practice-0c502f4135a6bc90) [INFO] [stderr] Executable unittests src/main.rs (/opt/rustwide/target/debug/deps/code_practice-8cd04324e631f9df) [INFO] running `Command { std: "docker" "inspect" "727c0cdd188be11b0979ef42fbbc7d1e087e6eb41619bbdbac05e95a9752d542", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "727c0cdd188be11b0979ef42fbbc7d1e087e6eb41619bbdbac05e95a9752d542", kill_on_drop: false }` [INFO] [stdout] 727c0cdd188be11b0979ef42fbbc7d1e087e6eb41619bbdbac05e95a9752d542 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-57/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=warn" "-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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] a532099687db4ea7d4d47c5f799d0909d5639fed74fa8bf09b02cfbd4583a579 [INFO] running `Command { std: "docker" "start" "-a" "a532099687db4ea7d4d47c5f799d0909d5639fed74fa8bf09b02cfbd4583a579", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] warning: unnecessary parentheses around `if` condition [INFO] [stderr] --> src/leetcode/s0001_two_sum.rs:52:20 [INFO] [stderr] | [INFO] [stderr] 52 | if (idx != *counter_idx) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_parens)]` on by default [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 52 - if (idx != *counter_idx) { [INFO] [stderr] 52 + if idx != *counter_idx { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused import: `to_list` [INFO] [stderr] --> src/leetcode/s0002_add_two_numbers.rs:32:42 [INFO] [stderr] | [INFO] [stderr] 32 | use crate::leetcode::util::linked_list::{to_list, ListNode}; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused imports: `to_tree`, `tree` [INFO] [stderr] --> src/leetcode/s0101_symmetric_tree.rs:28:28 [INFO] [stderr] | [INFO] [stderr] 28 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] 29 | tree, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around assigned value [INFO] [stderr] --> src/leetcode/s0101_symmetric_tree.rs:63:29 [INFO] [stderr] | [INFO] [stderr] 63 | let part1 = (left_tree.val == right_tree.val); [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 63 - let part1 = (left_tree.val == right_tree.val); [INFO] [stderr] 63 + let part1 = left_tree.val == right_tree.val; [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused imports: `to_tree`, `tree` [INFO] [stderr] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:30:28 [INFO] [stderr] | [INFO] [stderr] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] 31 | tree, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around `while` condition [INFO] [stderr] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:68:15 [INFO] [stderr] | [INFO] [stderr] 68 | while (!queue.is_empty()) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 68 - while (!queue.is_empty()) { [INFO] [stderr] 68 + while !queue.is_empty() { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused imports: `to_tree`, `tree` [INFO] [stderr] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:30:28 [INFO] [stderr] | [INFO] [stderr] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] 31 | tree, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around `while` condition [INFO] [stderr] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:68:15 [INFO] [stderr] | [INFO] [stderr] 68 | while (!queue.is_empty()) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 68 - while (!queue.is_empty()) { [INFO] [stderr] 68 + while !queue.is_empty() { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused imports: `to_tree`, `tree` [INFO] [stderr] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:30:28 [INFO] [stderr] | [INFO] [stderr] 30 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] 31 | tree, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around `while` condition [INFO] [stderr] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:68:15 [INFO] [stderr] | [INFO] [stderr] 68 | while (!queue.is_empty()) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 68 - while (!queue.is_empty()) { [INFO] [stderr] 68 + while !queue.is_empty() { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused imports: `to_tree`, `tree` [INFO] [stderr] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:27:28 [INFO] [stderr] | [INFO] [stderr] 27 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] 28 | tree, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around `if` condition [INFO] [stderr] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:65:16 [INFO] [stderr] | [INFO] [stderr] 65 | if (left_min == 0) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 65 - if (left_min == 0) { [INFO] [stderr] 65 + if left_min == 0 { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around `if` condition [INFO] [stderr] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:67:23 [INFO] [stderr] | [INFO] [stderr] 67 | } else if (right_min == 0) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 67 - } else if (right_min == 0) { [INFO] [stderr] 67 + } else if right_min == 0 { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused imports: `to_tree`, `tree` [INFO] [stderr] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:45:28 [INFO] [stderr] | [INFO] [stderr] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] 46 | tree, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `to_tree`, `tree` [INFO] [stderr] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:45:28 [INFO] [stderr] | [INFO] [stderr] 45 | leetcode::util::tree::{to_tree, TreeNode}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] 46 | tree, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around `while` condition [INFO] [stderr] --> src/leetcode/s0752_open_the_lock.rs:64:15 [INFO] [stderr] | [INFO] [stderr] 64 | while (!queue.is_empty()) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 64 - while (!queue.is_empty()) { [INFO] [stderr] 64 + while !queue.is_empty() { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around `while` condition [INFO] [stderr] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:47:15 [INFO] [stderr] | [INFO] [stderr] 47 | while (arri < word1.len() || arrj < word2.len()) { [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 47 - while (arri < word1.len() || arrj < word2.len()) { [INFO] [stderr] 47 + while arri < word1.len() || arrj < word2.len() { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused variable: `pos` [INFO] [stderr] --> src/leetcode/s0002_add_two_numbers.rs:64:17 [INFO] [stderr] | [INFO] [stderr] 64 | let mut pos = 0; [INFO] [stderr] | ^^^ help: if this is intentional, prefix it with an underscore: `_pos` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: value assigned to `cur_num` is never read [INFO] [stderr] --> src/leetcode/s0007_reverse_integer.rs:58:21 [INFO] [stderr] | [INFO] [stderr] 58 | let mut cur_num = 0; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: value assigned to `start_num` is never read [INFO] [stderr] --> src/leetcode/s0008_string_to_integer_atoi.rs:120:17 [INFO] [stderr] | [INFO] [stderr] 120 | let mut start_num = 0; [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: value assigned to `mid` is never read [INFO] [stderr] --> src/leetcode/s0069_sqrtx.rs:41:17 [INFO] [stderr] | [INFO] [stderr] 41 | let mut mid = 0; [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/leetcode/s0752_open_the_lock.rs:66:17 [INFO] [stderr] | [INFO] [stderr] 66 | for i in 0..qlen { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/leetcode/s0002_add_two_numbers.rs:64:13 [INFO] [stderr] | [INFO] [stderr] 64 | let mut pos = 0; [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:73:17 [INFO] [stderr] | [INFO] [stderr] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [INFO] [stderr] | ----^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:73:17 [INFO] [stderr] | [INFO] [stderr] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [INFO] [stderr] | ----^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:73:17 [INFO] [stderr] | [INFO] [stderr] 73 | let mut cur_trace = trace.get_mut(level - 1).unwrap(); [INFO] [stderr] | ----^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0001_two_sum.rs:33:12 [INFO] [stderr] | [INFO] [stderr] 33 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `two_sum` [INFO] [stderr] --> src/leetcode/s0001_two_sum.rs:42:12 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0002_add_two_numbers.rs:31:12 [INFO] [stderr] | [INFO] [stderr] 31 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_two_numbers` [INFO] [stderr] --> src/leetcode/s0002_add_two_numbers.rs:56:12 [INFO] [stderr] | [INFO] [stderr] 56 | pub fn add_two_numbers( [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0005_longest_palindromic_substring.rs:34:12 [INFO] [stderr] | [INFO] [stderr] 34 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `longest_palindrome` [INFO] [stderr] --> src/leetcode/s0005_longest_palindromic_substring.rs:42:12 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn longest_palindrome(s: String) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0006_zigzag_conversion.rs:44:12 [INFO] [stderr] | [INFO] [stderr] 44 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `convert` [INFO] [stderr] --> src/leetcode/s0006_zigzag_conversion.rs:52:12 [INFO] [stderr] | [INFO] [stderr] 52 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0007_reverse_integer.rs:28:12 [INFO] [stderr] | [INFO] [stderr] 28 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse` [INFO] [stderr] --> src/leetcode/s0007_reverse_integer.rs:36:12 [INFO] [stderr] | [INFO] [stderr] 36 | pub fn reverse(x: i32) -> i32 { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0008_string_to_integer_atoi.rs:51:12 [INFO] [stderr] | [INFO] [stderr] 51 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `my_atoi` [INFO] [stderr] --> src/leetcode/s0008_string_to_integer_atoi.rs:59:12 [INFO] [stderr] | [INFO] [stderr] 59 | pub fn my_atoi(s: String) -> i32 { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0009_palindrome_number.rs:35:12 [INFO] [stderr] | [INFO] [stderr] 35 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_palindrome` [INFO] [stderr] --> src/leetcode/s0009_palindrome_number.rs:43:12 [INFO] [stderr] | [INFO] [stderr] 43 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:30:12 [INFO] [stderr] | [INFO] [stderr] 30 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `letter_combinations` [INFO] [stderr] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:38:12 [INFO] [stderr] | [INFO] [stderr] 38 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0069_sqrtx.rs:27:12 [INFO] [stderr] | [INFO] [stderr] 27 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `my_sqrt` [INFO] [stderr] --> src/leetcode/s0069_sqrtx.rs:35:12 [INFO] [stderr] | [INFO] [stderr] 35 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0101_symmetric_tree.rs:26:12 [INFO] [stderr] | [INFO] [stderr] 26 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sym` [INFO] [stderr] --> src/leetcode/s0101_symmetric_tree.rs:58:8 [INFO] [stderr] | [INFO] [stderr] 58 | fn sym(left: Option>>, right: Option>>) -> bool { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_symmetric` [INFO] [stderr] --> src/leetcode/s0101_symmetric_tree.rs:73:12 [INFO] [stderr] | [INFO] [stderr] 73 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:28:12 [INFO] [stderr] | [INFO] [stderr] 28 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `level_order` [INFO] [stderr] --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:61:12 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:28:12 [INFO] [stderr] | [INFO] [stderr] 28 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `zigzag_level_order` [INFO] [stderr] --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:61:12 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:28:12 [INFO] [stderr] | [INFO] [stderr] 28 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `level_order_bottom` [INFO] [stderr] --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:61:12 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:25:12 [INFO] [stderr] | [INFO] [stderr] 25 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_depth` [INFO] [stderr] --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:57:12 [INFO] [stderr] | [INFO] [stderr] 57 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12 [INFO] [stderr] | [INFO] [stderr] 43 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traverse` [INFO] [stderr] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:75:12 [INFO] [stderr] | [INFO] [stderr] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `preorder_traversal` [INFO] [stderr] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:87:12 [INFO] [stderr] | [INFO] [stderr] 87 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:43:12 [INFO] [stderr] | [INFO] [stderr] 43 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traverse` [INFO] [stderr] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:75:12 [INFO] [stderr] | [INFO] [stderr] 75 | pub fn traverse(root: Option>>, trace: &mut Vec) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `postorder_traversal` [INFO] [stderr] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:88:12 [INFO] [stderr] | [INFO] [stderr] 88 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0146_lru_cache.rs:42:12 [INFO] [stderr] | [INFO] [stderr] 42 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `LRUCache` [INFO] [stderr] --> src/leetcode/s0146_lru_cache.rs:49:8 [INFO] [stderr] | [INFO] [stderr] 49 | struct LRUCache { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/leetcode/s0146_lru_cache.rs:62:8 [INFO] [stderr] | [INFO] [stderr] 62 | fn new(capacity: i32) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/leetcode/s0146_lru_cache.rs:72:8 [INFO] [stderr] | [INFO] [stderr] 72 | fn get(&mut self, key: i32) -> i32 { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `put` [INFO] [stderr] --> src/leetcode/s0146_lru_cache.rs:77:8 [INFO] [stderr] | [INFO] [stderr] 77 | fn put(&mut self, key: i32, value: i32) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `access` [INFO] [stderr] --> src/leetcode/s0146_lru_cache.rs:87:8 [INFO] [stderr] | [INFO] [stderr] 87 | fn access(&mut self, key: i32) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `remove_lru` [INFO] [stderr] --> src/leetcode/s0146_lru_cache.rs:93:8 [INFO] [stderr] | [INFO] [stderr] 93 | fn remove_lru(&mut self) -> Option { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0283_move_zeroes.rs:19:12 [INFO] [stderr] | [INFO] [stderr] 19 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `move_zeroes` [INFO] [stderr] --> src/leetcode/s0283_move_zeroes.rs:27:12 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0516_longest_palindromic_subsequence.rs:29:12 [INFO] [stderr] | [INFO] [stderr] 29 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `longest_palindrome_subseq` [INFO] [stderr] --> src/leetcode/s0516_longest_palindromic_subsequence.rs:37:12 [INFO] [stderr] | [INFO] [stderr] 37 | pub fn longest_palindrome_subseq(s: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0647_palindromic_substrings.rs:36:12 [INFO] [stderr] | [INFO] [stderr] 36 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `count_substrings` [INFO] [stderr] --> src/leetcode/s0647_palindromic_substrings.rs:44:12 [INFO] [stderr] | [INFO] [stderr] 44 | pub fn count_substrings(s: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0752_open_the_lock.rs:47:12 [INFO] [stderr] | [INFO] [stderr] 47 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `open_lock` [INFO] [stderr] --> src/leetcode/s0752_open_the_lock.rs:54:12 [INFO] [stderr] | [INFO] [stderr] 54 | pub fn open_lock(deadends: Vec, target: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:24:12 [INFO] [stderr] | [INFO] [stderr] 24 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `smallest_subsequence` [INFO] [stderr] --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:32:12 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn smallest_subsequence(s: String) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:34:12 [INFO] [stderr] | [INFO] [stderr] 34 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `array_strings_are_equal` [INFO] [stderr] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:42:12 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn array_strings_are_equal(word1: Vec, word2: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/leetcode/util/linked_list.rs:9:12 [INFO] [stderr] | [INFO] [stderr] 9 | pub fn new(val: i32) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `to_list` [INFO] [stderr] --> src/leetcode/util/linked_list.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn to_list(vec: Vec) -> Option> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/leetcode/util/tree.rs:13:12 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn new(val: i32) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `to_tree` [INFO] [stderr] --> src/leetcode/util/tree.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn to_tree(vec: Vec>) -> Option>> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `code_practice` (lib) generated 84 warnings [INFO] [stderr] warning: unused import: `std::collections::HashSet` [INFO] [stderr] --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:79:9 [INFO] [stderr] | [INFO] [stderr] 79 | use std::collections::HashSet; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::*` [INFO] [stderr] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:101:9 [INFO] [stderr] | [INFO] [stderr] 101 | use super::*; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::*` [INFO] [stderr] --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:102:9 [INFO] [stderr] | [INFO] [stderr] 102 | use super::*; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::*` [INFO] [stderr] --> src/leetcode/s0283_move_zeroes.rs:45:9 [INFO] [stderr] | [INFO] [stderr] 45 | use super::*; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::*` [INFO] [stderr] --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:74:9 [INFO] [stderr] | [INFO] [stderr] 74 | use super::*; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12 [INFO] [stderr] | [INFO] [stderr] 43 | pub struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `code_practice` (lib test) generated 36 warnings (30 duplicates) [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.60s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/code_practice-0c502f4135a6bc90) [INFO] [stdout] [INFO] [stdout] running 25 tests [INFO] [stdout] test leetcode::s0001_two_sum::tests::test_1 ... ok [INFO] [stdout] test leetcode::s0002_add_two_numbers::tests::test_2 ... ok [INFO] [stdout] test leetcode::s0007_reverse_integer::tests::test_7 ... ok [INFO] [stdout] test leetcode::s0009_palindrome_number::tests::test_9 ... ok [INFO] [stdout] test leetcode::s0017_letter_combinations_of_a_phone_number::tests::test_17 ... ok [INFO] [stdout] test leetcode::s0006_zigzag_conversion::tests::test_6 ... ok [INFO] [stdout] test leetcode::s0005_longest_palindromic_substring::tests::test_5 ... ok [INFO] [stdout] test leetcode::s0008_string_to_integer_atoi::tests::test_8 ... ok [INFO] [stdout] test leetcode::s0069_sqrtx::tests::test_69 ... ok [INFO] [stdout] test leetcode::s0101_symmetric_tree::tests::test_101 ... ok [INFO] [stdout] test leetcode::s0103_binary_tree_zigzag_level_order_traversal::tests::test_103_1 ... ok [INFO] [stdout] test leetcode::s0102_binary_tree_level_order_traversal::tests::test_102 ... ok [INFO] [stdout] test leetcode::s0103_binary_tree_zigzag_level_order_traversal::tests::test_103_2 ... ok [INFO] [stdout] test leetcode::s0103_binary_tree_zigzag_level_order_traversal::tests::test_103_3 ... ok [INFO] [stdout] test leetcode::s0107_binary_tree_level_order_traversal_ii::tests::test_107 ... ok [INFO] [stdout] test leetcode::s0144_binary_tree_preorder_traversal::tests::test_144 ... ok [INFO] [stdout] test leetcode::s0145_binary_tree_postorder_traversal::tests::test_145 ... ok [INFO] [stdout] test leetcode::s0146_lru_cache::tests::test_146 ... ok [INFO] [stdout] test leetcode::s0283_move_zeroes::tests::test_283 ... ok [INFO] [stdout] test leetcode::s0111_minimum_depth_of_binary_tree::tests::test_111 ... ok [INFO] [stdout] test leetcode::s0516_longest_palindromic_subsequence::tests::test_516 ... ok [INFO] [stdout] test leetcode::s0647_palindromic_substrings::tests::test_647 ... ok [INFO] [stdout] test leetcode::s1081_smallest_subsequence_of_distinct_characters::tests::test_1081 ... ok [INFO] [stdout] test leetcode::s1662_check_if_two_string_arrays_are_equivalent::tests::test_1662 ... ok [INFO] [stdout] test leetcode::s0752_open_the_lock::tests::test_752 ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 25 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.25s [INFO] [stdout] [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/debug/deps/code_practice-8cd04324e631f9df) [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.07s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "a532099687db4ea7d4d47c5f799d0909d5639fed74fa8bf09b02cfbd4583a579", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a532099687db4ea7d4d47c5f799d0909d5639fed74fa8bf09b02cfbd4583a579", kill_on_drop: false }` [INFO] [stdout] a532099687db4ea7d4d47c5f799d0909d5639fed74fa8bf09b02cfbd4583a579