[INFO] cloning repository https://github.com/codebyred/leetcode_rusty
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/codebyred/leetcode_rusty" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fcodebyred%2Fleetcode_rusty", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fcodebyred%2Fleetcode_rusty'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 6e3e8129be555ee1a96f0c46587221651c7a1476
[INFO] checking codebyred/leetcode_rusty against try#163937523761cc0def32f1ba9ed63fdf65ad3478 for pr-156749
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fcodebyred%2Fleetcode_rusty" "/workspace/builds/worker-3-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/codebyred/leetcode_rusty
[INFO] finished tweaking git repo https://github.com/codebyred/leetcode_rusty
[INFO] tweaked toml for git repo https://github.com/codebyred/leetcode_rusty written to /workspace/builds/worker-3-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/codebyred/leetcode_rusty on toolchain 163937523761cc0def32f1ba9ed63fdf65ad3478
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+163937523761cc0def32f1ba9ed63fdf65ad3478" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/codebyred/leetcode_rusty 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" "+163937523761cc0def32f1ba9ed63fdf65ad3478" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:3e793bdf10248eb2ddbd6b0faebed8155c11b4589982e2893733958d93e8d540" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] 6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595
[INFO] running `Command { std: "docker" "start" "6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595", 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" "6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595" "/opt/rustwide/cargo-home/bin/cargo" "+163937523761cc0def32f1ba9ed63fdf65ad3478" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595", 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" "6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595" "/opt/rustwide/cargo-home/bin/cargo" "+163937523761cc0def32f1ba9ed63fdf65ad3478" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode_rusty v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::vec`
[INFO] [stdout]   --> src/problem_78_subsets.rs:41:9
[INFO] [stdout]    |
[INFO] [stdout] 41 |     use std::vec;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem_78_subsets.rs:43:9
[INFO] [stdout]    |
[INFO] [stdout] 43 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/problem_703_kth_largest_element_in_stream.rs:18:14
[INFO] [stdout]    |
[INFO] [stdout] 18 |         while(heap.len() as i32> k) {
[INFO] [stdout]    |              ^                    ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 18 -         while(heap.len() as i32> k) {
[INFO] [stdout] 18 +         while heap.len() as i32> k  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem_1046_last_stone_weight.rs:17:15
[INFO] [stdout]    |
[INFO] [stdout] 17 |             if(x != y) {
[INFO] [stdout]    |               ^      ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 17 -             if(x != y) {
[INFO] [stdout] 17 +             if x != y  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem_46_permutations.rs:10:15
[INFO] [stdout]    |
[INFO] [stdout] 10 |             if(path.len() == nums.len()) {
[INFO] [stdout]    |               ^                        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 10 -             if(path.len() == nums.len()) {
[INFO] [stdout] 10 +             if path.len() == nums.len()  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem_167_two_sum.rs:32:9
[INFO] [stdout]    |
[INFO] [stdout] 32 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/problem_703_kth_largest_element_in_stream.rs:18:14
[INFO] [stdout]    |
[INFO] [stdout] 18 |         while(heap.len() as i32> k) {
[INFO] [stdout]    |              ^                    ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 18 -         while(heap.len() as i32> k) {
[INFO] [stdout] 18 +         while heap.len() as i32> k  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem_1046_last_stone_weight.rs:17:15
[INFO] [stdout]    |
[INFO] [stdout] 17 |             if(x != y) {
[INFO] [stdout]    |               ^      ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 17 -             if(x != y) {
[INFO] [stdout] 17 +             if x != y  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem_46_permutations.rs:10:15
[INFO] [stdout]    |
[INFO] [stdout] 10 |             if(path.len() == nums.len()) {
[INFO] [stdout]    |               ^                        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 10 -             if(path.len() == nums.len()) {
[INFO] [stdout] 10 +             if path.len() == nums.len()  {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `item`
[INFO] [stdout]   --> src/problem_46_permutations.rs:14:24
[INFO] [stdout]    |
[INFO] [stdout] 14 |             for (index,item) in nums.iter().enumerate() {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_item`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem_206_reverse_linked_list.rs:10:6
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |   #[inline]
[INFO] [stdout] 10 |   fn new(val: i32) -> Self {
[INFO] [stdout]    |      ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_78_subsets.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `dfs` are never used
[INFO] [stdout]   --> src/problem_78_subsets.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem_223_invert_a_binary_tree.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]   --> src/problem_223_invert_a_binary_tree.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_33_search_in_rotated_sorted_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search` is never used
[INFO] [stdout]  --> src/problem_33_search_in_rotated_sorted_array.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `KthLargest` is never constructed
[INFO] [stdout]  --> src/problem_703_kth_largest_element_in_stream.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct KthLargest {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `add` are never used
[INFO] [stdout]   --> src/problem_703_kth_largest_element_in_stream.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl KthLargest {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 13 |
[INFO] [stdout] 14 |     fn new(k: i32, nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn add(&mut self, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_1046_last_stone_weight.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `last_stone_weight` is never used
[INFO] [stdout]  --> src/problem_1046_last_stone_weight.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn last_stone_weight(stones: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_973_k_closest_points_to_origin.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `k_closest` is never used
[INFO] [stdout]  --> src/problem_973_k_closest_points_to_origin.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |
[INFO] [stdout] 9 |     pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_347_top_k_freq_elements.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct  Solution;
[INFO] [stdout]   |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `top_k_frequent` is never used
[INFO] [stdout]  --> src/problem_347_top_k_freq_elements.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_46_permutations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `permute` is never used
[INFO] [stdout]  --> src/problem_46_permutations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem_2_add_two_number.rs:10:6
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |   #[inline]
[INFO] [stdout] 10 |   fn new(val: i32) -> Self {
[INFO] [stdout]    |      ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem_2_add_two_number.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/problem_2_add_two_number.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(mut l1: Option<Box<ListNode>>, mut l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_list` is never used
[INFO] [stdout]   --> src/problem_2_add_two_number.rs:70:8
[INFO] [stdout]    |
[INFO] [stdout] 70 |     fn build_list(nums: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_79_word_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `exist` and `backtrack` are never used
[INFO] [stdout]   --> src/problem_79_word_search.rs:3:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  3 |     pub fn exist(mut board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn backtrack(
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `item`
[INFO] [stdout]   --> src/problem_46_permutations.rs:14:24
[INFO] [stdout]    |
[INFO] [stdout] 14 |             for (index,item) in nums.iter().enumerate() {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_item`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem_206_reverse_linked_list.rs:10:6
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |   #[inline]
[INFO] [stdout] 10 |   fn new(val: i32) -> Self {
[INFO] [stdout]    |      ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem_223_invert_a_binary_tree.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]   --> src/problem_223_invert_a_binary_tree.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `KthLargest` is never constructed
[INFO] [stdout]  --> src/problem_703_kth_largest_element_in_stream.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct KthLargest {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `add` are never used
[INFO] [stdout]   --> src/problem_703_kth_largest_element_in_stream.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl KthLargest {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 13 |
[INFO] [stdout] 14 |     fn new(k: i32, nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn add(&mut self, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_347_top_k_freq_elements.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct  Solution;
[INFO] [stdout]   |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `top_k_frequent` is never used
[INFO] [stdout]  --> src/problem_347_top_k_freq_elements.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_46_permutations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `permute` is never used
[INFO] [stdout]  --> src/problem_46_permutations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem_79_word_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `exist` and `backtrack` are never used
[INFO] [stdout]   --> src/problem_79_word_search.rs:3:12
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  3 |     pub fn exist(mut board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn backtrack(
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.39s
[INFO] running `Command { std: "docker" "inspect" "6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595", kill_on_drop: false }`
[INFO] [stdout] 6e7238ece07b75af358f25d08a1587ad1f770f103400de75d1077de34997b595
