[INFO] cloning 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" "clone" "--bare" "https://github.com/photoszzt/code_practice" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 65ee32f2b49f6783967bf13435905b4245ee95f0 [INFO] checking photoszzt/code_practice against master#a609fb45efad59dfd459c76e50899be9f0583b5a for pr-80579 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice" "/workspace/builds/worker-3/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-3/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/photoszzt/code_practice on toolchain a609fb45efad59dfd459c76e50899be9f0583b5a [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+a609fb45efad59dfd459c76e50899be9f0583b5a" "read-manifest" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-3/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-3/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" "+a609fb45efad59dfd459c76e50899be9f0583b5a" "fetch" "--locked" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3/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" "rustops/crates-build-env@sha256:c8ac004eab7d63a0ad09a2dde3d3353ba464f767bee4de425dc8f74c46a1905e" "/opt/rustwide/cargo-home/bin/cargo" "+a609fb45efad59dfd459c76e50899be9f0583b5a" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] d797aa806ac3ab1b30e1193d66189bc09e37190ae9dc3a73b778a13d73aabb5c [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "d797aa806ac3ab1b30e1193d66189bc09e37190ae9dc3a73b778a13d73aabb5c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "d797aa806ac3ab1b30e1193d66189bc09e37190ae9dc3a73b778a13d73aabb5c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "d797aa806ac3ab1b30e1193d66189bc09e37190ae9dc3a73b778a13d73aabb5c", kill_on_drop: false }` [INFO] [stdout] d797aa806ac3ab1b30e1193d66189bc09e37190ae9dc3a73b778a13d73aabb5c [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:c8ac004eab7d63a0ad09a2dde3d3353ba464f767bee4de425dc8f74c46a1905e" "/opt/rustwide/cargo-home/bin/cargo" "+a609fb45efad59dfd459c76e50899be9f0583b5a" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] de728f3c7e5205305e3d2750fabfb9ba6c34d267ec838eed3795130739a4164b [INFO] running `Command { std: "docker" "start" "-a" "de728f3c7e5205305e3d2750fabfb9ba6c34d267ec838eed3795130739a4164b", kill_on_drop: false }` [INFO] [stderr] Checking 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] | ^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [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] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] | ^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] | ^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] | ^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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/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] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] | ^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` 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] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] | ^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] | ^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] | ^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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] = note: `#[warn(unused_imports)]` on by default [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/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] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [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:13 [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:17 [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:13 [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:13 [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: 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/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/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/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: 73 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pos` [INFO] [stdout] --> src/leetcode/s0002_add_two_numbers.rs:64:13 [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:17 [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:13 [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:13 [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: 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: 31 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 0.89s [INFO] running `Command { std: "docker" "inspect" "de728f3c7e5205305e3d2750fabfb9ba6c34d267ec838eed3795130739a4164b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "de728f3c7e5205305e3d2750fabfb9ba6c34d267ec838eed3795130739a4164b", kill_on_drop: false }` [INFO] [stdout] de728f3c7e5205305e3d2750fabfb9ba6c34d267ec838eed3795130739a4164b