[INFO] cloning repository https://github.com/tranvietphuoc/leetcode.rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/tranvietphuoc/leetcode.rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftranvietphuoc%2Fleetcode.rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftranvietphuoc%2Fleetcode.rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 6caefe0ba9c2fe1b1c51b0f3d32f0f37559840e9
[INFO] checking tranvietphuoc/leetcode.rs against try#8ac0915e346f9a2e49ca3951b642c55bd7d1eaab for pr-158447
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftranvietphuoc%2Fleetcode.rs" "/workspace/builds/worker-0-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/tranvietphuoc/leetcode.rs
[INFO] finished tweaking git repo https://github.com/tranvietphuoc/leetcode.rs
[INFO] tweaked toml for git repo https://github.com/tranvietphuoc/leetcode.rs written to /workspace/builds/worker-0-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/tranvietphuoc/leetcode.rs on toolchain 8ac0915e346f9a2e49ca3951b642c55bd7d1eaab
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8ac0915e346f9a2e49ca3951b642c55bd7d1eaab" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/tranvietphuoc/leetcode.rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8ac0915e346f9a2e49ca3951b642c55bd7d1eaab" "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
[ERROR] error running command: no output for 300 seconds
[INFO] checking tranvietphuoc/leetcode.rs against try#8ac0915e346f9a2e49ca3951b642c55bd7d1eaab for pr-158447
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftranvietphuoc%2Fleetcode.rs" "/workspace/builds/worker-0-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/tranvietphuoc/leetcode.rs
[INFO] finished tweaking git repo https://github.com/tranvietphuoc/leetcode.rs
[INFO] tweaked toml for git repo https://github.com/tranvietphuoc/leetcode.rs written to /workspace/builds/worker-0-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/tranvietphuoc/leetcode.rs on toolchain 8ac0915e346f9a2e49ca3951b642c55bd7d1eaab
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8ac0915e346f9a2e49ca3951b642c55bd7d1eaab" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/tranvietphuoc/leetcode.rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8ac0915e346f9a2e49ca3951b642c55bd7d1eaab" "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-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,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" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:fd22e2154e7db748230f413534f3a6d034160c9d2b7c14b90fba4e9bfc1a36d4" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147
[INFO] running `Command { std: "docker" "start" "c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147" "/opt/rustwide/cargo-home/bin/cargo" "+8ac0915e346f9a2e49ca3951b642c55bd7d1eaab" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-w" "/opt/rustwide/workdir" "--user" "0:0" "c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147" "/opt/rustwide/cargo-home/bin/cargo" "+8ac0915e346f9a2e49ca3951b642c55bd7d1eaab" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused variable: `p1`
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:40:21
[INFO] [stdout]    |
[INFO] [stdout] 40 |         if let Some(p1) = l1 {
[INFO] [stdout]    |                     ^^ help: if this is intentional, prefix it with an underscore: `_p1`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `p2`
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:42:28
[INFO] [stdout]    |
[INFO] [stdout] 42 |         } else if let Some(p2) = l2 {
[INFO] [stdout]    |                            ^^ help: if this is intentional, prefix it with an underscore: `_p2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:48:13
[INFO] [stdout]    |
[INFO] [stdout] 48 |         let mut node = ptr2.next.as_mut()?;
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:43:13
[INFO] [stdout]    |
[INFO] [stdout] 43 |         for i in 0..(len - n - 1) {
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `three_sum` is never read
[INFO] [stdout]   --> src/three_sum_closest.rs:11:29
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut three_sum = 0;
[INFO] [stdout]    |                             ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 24 |                 three_sum = nums[i] + nums[start] + nums[end];
[INFO] [stdout]    |                 --------------------------------------------- `three_sum` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/two_sum.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |         let mut tar = target;
[INFO] [stdout]   |             ----^^^
[INFO] [stdout]   |             |
[INFO] [stdout]   |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/add_digits.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_digits` is never used
[INFO] [stdout]  --> src/add_digits.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn add_digits(num: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/add_two_numbers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/add_two_numbers.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/binray_search_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct Node<K: Ord> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]   --> src/binray_search_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct BST<K: Ord>(Option<Box<Node<K>>>);
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `contains` are never used
[INFO] [stdout]   --> src/binray_search_tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl<K: Ord> BST<K> {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 14 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn insert(&mut self, key: K) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn remove(&mut self, key: K) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     pub fn contains(&self, key: K) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/container_with_most_water.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area` is never used
[INFO] [stdout]  --> src/container_with_most_water.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Vertex` is never constructed
[INFO] [stdout]  --> src/depth_first_search.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Vertex(u32);
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Edge` is never constructed
[INFO] [stdout]  --> src/depth_first_search.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Edge(u32, u32);
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]   --> src/depth_first_search.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct Graph {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/depth_first_search.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Graph {
[INFO] [stdout]    | ---------- associated function in this implementation
[INFO] [stdout] 17 |     #[inline]
[INFO] [stdout] 18 |     pub fn new(vertices: Vec<Vertex>, edges: Vec<Edge>) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `value` and `neighbors` are never used
[INFO] [stdout]   --> src/depth_first_search.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Vertex {
[INFO] [stdout]    | ----------- methods in this implementation
[INFO] [stdout] 30 |     pub fn value(&self) -> u32 {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn neighbors(&self, graph: &Graph) -> VecDeque<Vertex> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `depth_first_search` is never used
[INFO] [stdout]   --> src/depth_first_search.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | pub fn depth_first_search(graph: &Graph, root: Vertex, objective: Vertex) -> Option<Vec<u32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/four_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `four_sum`, `k_sum`, and `two_sum` are never used
[INFO] [stdout]   --> src/four_sum.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn four_sum(nums: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 12 |     fn k_sum(nums: Vec<i32>, target: i32, start: usize, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn two_sum(nums: Vec<i32>, target: i32, start: usize) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/integer_to_roman.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `int_to_roman` is never used
[INFO] [stdout]  --> src/integer_to_roman.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn int_to_roman(num: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/longest_common_prefix.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/longest_common_prefix.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/longest_palindrome.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_palindrome` and `check_palindrome` are never used
[INFO] [stdout]   --> src/longest_palindrome.rs:55:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 55 |     pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn check_palindrome(s: &[u8]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/median_of_two_sorted_arrays.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used
[INFO] [stdout]  --> src/median_of_two_sorted_arrays.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/merge_two_sorted_lists.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_two_lists` is never used
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/minimum_common_value.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_common` is never used
[INFO] [stdout]  --> src/minimum_common_value.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn get_common(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/multiply_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `multiply`, `add_strings`, and `multiply_one_digit` are never used
[INFO] [stdout]   --> src/multiply_string.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn multiply(num1: String, num2: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn add_strings(result: Vec<u32>, answer: Vec<u32>) -> Vec<u32> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn multiply_one_digit(first: &Vec<u32>, digit2: u32, num_zeros: usize) -> Vec<u32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/number_of_1_bits.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `hammingWeight` is never used
[INFO] [stdout]  --> src/number_of_1_bits.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn hammingWeight(n: u32) -> u32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/power_of_two.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_two` is never used
[INFO] [stdout]   --> src/power_of_two.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/remove_duplicates_from_sorted_list.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/remove_duplicates_from_sorted_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/remove_duplicates_from_sorted_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/remove_duplicates_from_sorted_list.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 20 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/remove_nth_node_from_end_of_list.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 20 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/reverse_bits.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_bits` is never used
[INFO] [stdout]  --> src/reverse_bits.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn reverse_bits(x: u32) -> u32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/reverse_integer.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse` is never used
[INFO] [stdout]  --> src/reverse_integer.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/roman_to_integer.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `roman_to_int` is never used
[INFO] [stdout]  --> src/roman_to_integer.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/single_number.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]   --> src/single_number.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/three_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]  --> src/three_sum.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/three_sum_closest.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum_closest` is never used
[INFO] [stdout]  --> src/three_sum_closest.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/two_sum.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/two_sum.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/valid_palindrome.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/valid_palindrome.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/zigzag_conversion.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert` is never used
[INFO] [stdout]  --> src/zigzag_conversion.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `hammingWeight` should have a snake case name
[INFO] [stdout]  --> src/number_of_1_bits.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 |     pub fn hammingWeight(n: u32) -> u32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^ help: convert the identifier to snake case: `hamming_weight`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `p1`
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:40:21
[INFO] [stdout]    |
[INFO] [stdout] 40 |         if let Some(p1) = l1 {
[INFO] [stdout]    |                     ^^ help: if this is intentional, prefix it with an underscore: `_p1`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `p2`
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:42:28
[INFO] [stdout]    |
[INFO] [stdout] 42 |         } else if let Some(p2) = l2 {
[INFO] [stdout]    |                            ^^ help: if this is intentional, prefix it with an underscore: `_p2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:48:13
[INFO] [stdout]    |
[INFO] [stdout] 48 |         let mut node = ptr2.next.as_mut()?;
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:43:13
[INFO] [stdout]    |
[INFO] [stdout] 43 |         for i in 0..(len - n - 1) {
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `three_sum` is never read
[INFO] [stdout]   --> src/three_sum_closest.rs:11:29
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut three_sum = 0;
[INFO] [stdout]    |                             ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 24 |                 three_sum = nums[i] + nums[start] + nums[end];
[INFO] [stdout]    |                 --------------------------------------------- `three_sum` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/two_sum.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |         let mut tar = target;
[INFO] [stdout]   |             ----^^^
[INFO] [stdout]   |             |
[INFO] [stdout]   |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/add_digits.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_digits` is never used
[INFO] [stdout]  --> src/add_digits.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn add_digits(num: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/add_two_numbers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/add_two_numbers.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/binray_search_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct Node<K: Ord> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BST` is never constructed
[INFO] [stdout]   --> src/binray_search_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct BST<K: Ord>(Option<Box<Node<K>>>);
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `contains` are never used
[INFO] [stdout]   --> src/binray_search_tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl<K: Ord> BST<K> {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 14 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn insert(&mut self, key: K) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     pub fn remove(&mut self, key: K) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     pub fn contains(&self, key: K) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/merge_two_sorted_lists.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_two_lists` is never used
[INFO] [stdout]   --> src/merge_two_sorted_lists.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/power_of_two.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_two` is never used
[INFO] [stdout]   --> src/power_of_two.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/remove_duplicates_from_sorted_list.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/remove_duplicates_from_sorted_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/remove_duplicates_from_sorted_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/remove_duplicates_from_sorted_list.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 20 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/remove_nth_node_from_end_of_list.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub struct Solution;
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]   --> src/remove_nth_node_from_end_of_list.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 20 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/single_number.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]   --> src/single_number.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/valid_palindrome.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/valid_palindrome.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `hammingWeight` should have a snake case name
[INFO] [stdout]  --> src/number_of_1_bits.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 |     pub fn hammingWeight(n: u32) -> u32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^ help: convert the identifier to snake case: `hamming_weight`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.17s
[INFO] running `Command { std: "docker" "inspect" "c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147", kill_on_drop: false }`
[INFO] [stdout] c659562c23bebcbe0d29619bc3c099aeea6de7dfcf3cc31c7210610e06b47147
