[INFO] cloning repository https://github.com/stada526/leetcode-rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/stada526/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fstada526%2Fleetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fstada526%2Fleetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 48d5fb5f09df96f6de9aa61bb0d4eb6417274713
[INFO] checking stada526/leetcode-rust against try#0269aeccce4fd29ce9ad0ebd47a62e584d7e25ef for pr-147859
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fstada526%2Fleetcode-rust" "/workspace/builds/worker-1-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/stada526/leetcode-rust
[INFO] finished tweaking git repo https://github.com/stada526/leetcode-rust
[INFO] tweaked toml for git repo https://github.com/stada526/leetcode-rust written to /workspace/builds/worker-1-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/stada526/leetcode-rust on toolchain 0269aeccce4fd29ce9ad0ebd47a62e584d7e25ef
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0269aeccce4fd29ce9ad0ebd47a62e584d7e25ef" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/stada526/leetcode-rust 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" "+0269aeccce4fd29ce9ad0ebd47a62e584d7e25ef" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded assert_unordered v0.3.5
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:61361fe0aef631f17e9d025a70c5a647956f8c671dd02950a60ad3f5cc5526d7" "/opt/rustwide/cargo-home/bin/cargo" "+0269aeccce4fd29ce9ad0ebd47a62e584d7e25ef" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 617868a003499509194c11818c7e7ba2931a75d5db1d7f455f8bf13db6f1e868
[INFO] running `Command { std: "docker" "start" "-a" "617868a003499509194c11818c7e7ba2931a75d5db1d7f455f8bf13db6f1e868", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "617868a003499509194c11818c7e7ba2931a75d5db1d7f455f8bf13db6f1e868", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "617868a003499509194c11818c7e7ba2931a75d5db1d7f455f8bf13db6f1e868", kill_on_drop: false }`
[INFO] [stdout] 617868a003499509194c11818c7e7ba2931a75d5db1d7f455f8bf13db6f1e868
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:61361fe0aef631f17e9d025a70c5a647956f8c671dd02950a60ad3f5cc5526d7" "/opt/rustwide/cargo-home/bin/cargo" "+0269aeccce4fd29ce9ad0ebd47a62e584d7e25ef" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] dcf739504fbe69b94c185de37fa0e5dac0325aba86d57d69f39756e3145d7dd9
[INFO] running `Command { std: "docker" "start" "-a" "dcf739504fbe69b94c185de37fa0e5dac0325aba86d57d69f39756e3145d7dd9", kill_on_drop: false }`
[INFO] [stderr]     Checking assert_unordered v0.3.5
[INFO] [stderr]     Checking leetcode-rust v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/solutions/s_567_permutation_in_string.rs:53:9
[INFO] [stdout]    |
[INFO] [stdout] 53 |     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: unused variable: `key`
[INFO] [stdout]   --> src/solutions/s_424_longest_repeating_character_replacement.rs:34:14
[INFO] [stdout]    |
[INFO] [stdout] 34 |         for (key, value) in char_map {
[INFO] [stdout]    |              ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MaxHeap` is never constructed
[INFO] [stdout]  --> src/common/heap.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct MaxHeap {
[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 items `new`, `push`, `pop`, `heapify`, and `len` are never used
[INFO] [stdout]   --> src/common/heap.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl MaxHeap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout]  6 |     pub fn new(array: Vec<i32>) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     pub fn push(&mut self, value: i32) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn pop(&mut self) -> Option<i32> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn heapify(&mut self, index: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn len(&self) -> usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/common/list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new` and `from` are never used
[INFO] [stdout]   --> src/common/list.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl ListNode {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     #[inline]
[INFO] [stdout]  9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     pub fn from(vec: &Vec<i32>) -> Option<Box<Self>> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/common/treenode.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new` and `from` are never used
[INFO] [stdout]   --> src/common/treenode.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TreeNode {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 13 |     #[inline]
[INFO] [stdout] 14 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn from(vec: &Vec<Option<i32>>) -> Option<Self> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_1046_last_stone_weight.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `last_stone_weight` is never used
[INFO] [stdout]  --> src/solutions/s_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/solutions/s_110_balanced_binary_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_balanced` is never used
[INFO] [stdout]  --> src/solutions/s_110_balanced_binary_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_128_longest_consecutive_sequence.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_consecutive` and `is_first_in_sequence` are never used
[INFO] [stdout]   --> src/solutions/s_128_longest_consecutive_sequence.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn is_first_in_sequence(num_set: &HashSet<i32>, num: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_143_reorder_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reorder_list`, `get_second_half_head`, `reverse`, and `merge` are never used
[INFO] [stdout]   --> src/solutions/s_143_reorder_list.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn reorder_list(head: &mut Option<Box<ListNode>>) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn get_second_half_head(head: &mut Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn reverse(head: &mut Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn merge(head1: &mut Option<Box<ListNode>>, head2: &mut Option<Box<ListNode>>) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_153_find_minimum_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 `find_min` is never used
[INFO] [stdout]  --> src/solutions/s_153_find_minimum_in_rotated_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/solutions/s_155_min_stack.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/solutions/s_155_min_stack.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout]  7 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_198_house_robbers.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rob` is never used
[INFO] [stdout]  --> src/solutions/s_198_house_robbers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_19_remove_nth_node_from_end_of_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `remove_nth_from_end` and `reverse_without_nth` are never used
[INFO] [stdout]   --> src/solutions/s_19_remove_nth_node_from_end_of_list.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn reverse_without_nth(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/solutions/s_206_reverse_linked_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_list` is never used
[INFO] [stdout]  --> src/solutions/s_206_reverse_linked_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_22_generate_parentheses.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate_parenthesis` is never used
[INFO] [stdout]  --> src/solutions/s_22_generate_parentheses.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_238_product_of_array_except_self.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/solutions/s_238_product_of_array_except_self.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_3_longest_substring_without_repeating_characters.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/solutions/s_3_longest_substring_without_repeating_characters.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_417_pacific_atlantic_water_flow.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `dfs` and `pacific_atlantic` are never used
[INFO] [stdout]   --> src/solutions/s_417_pacific_atlantic_water_flow.rs:6:8
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn pacific_atlantic(heights: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_424_longest_repeating_character_replacement.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `character_replacement` and `is_valid` are never used
[INFO] [stdout]   --> src/solutions/s_424_longest_repeating_character_replacement.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn character_replacement(s: String, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn is_valid(char_map: &HashMap<char, i32>, k: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_46_permutations.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/solutions/s_46_permutations.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_543_diameter_of_binary_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `diameter_of_binary_tree` is never used
[INFO] [stdout]  --> src/solutions/s_543_diameter_of_binary_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_567_permutation_in_string.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `check_inclusion` and `is_same_hashmap` are never used
[INFO] [stdout]   --> src/solutions/s_567_permutation_in_string.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn check_inclusion(s1: String, s2: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn is_same_hashmap(map1: &HashMap<char, i32>, map2: &HashMap<char, i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_572_subtree_of_another_tree.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_subtree` and `is_same_tree` are never used
[INFO] [stdout]   --> src/solutions/s_572_subtree_of_another_tree.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn is_subtree(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn is_same_tree(
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_704_binary_search.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/solutions/s_704_binary_search.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_78_subset.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `backtrack` are never used
[INFO] [stdout]   --> src/solutions/s_78_subset.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn backtrack(index: usize, res: &mut Vec<Vec<i32>>, stack: &mut Vec<i32>, nums: &Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Coord` is never constructed
[INFO] [stdout]  --> src/solutions/s_79_word_search.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Coord {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/solutions/s_79_word_search.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Coord {
[INFO] [stdout]   | ---------- associated function in this implementation
[INFO] [stdout] 9 |     fn new(x: usize, y: usize) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Board` is never constructed
[INFO] [stdout]   --> src/solutions/s_79_word_search.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Board<'a> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `row_size`, `col_size`, `get_value`, and `next_coords` are never used
[INFO] [stdout]   --> src/solutions/s_79_word_search.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl<'a> Board<'a> {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 18 |     fn new(board: &'a Vec<Vec<char>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn row_size(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn col_size(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn get_value(&self, coord: &Coord) -> char {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn next_coords(&self, coord: &Coord) -> Vec<Coord> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/solutions/s_79_word_search.rs:48:8
[INFO] [stdout]    |
[INFO] [stdout] 48 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `exist` and `dfs` are never used
[INFO] [stdout]   --> src/solutions/s_79_word_search.rs:51:12
[INFO] [stdout]    |
[INFO] [stdout] 50 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 51 |     pub fn exist(board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/solutions/s_98_validate_binary_search_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid_bst` and `dfs` are never used
[INFO] [stdout]   --> src/solutions/s_98_validate_binary_search_tree.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, min: i64, max: i64) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `key`
[INFO] [stdout]   --> src/solutions/s_424_longest_repeating_character_replacement.rs:34:14
[INFO] [stdout]    |
[INFO] [stdout] 34 |         for (key, value) in char_map {
[INFO] [stdout]    |              ^^^ help: if this is intentional, prefix it with an underscore: `_key`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.23s
[INFO] running `Command { std: "docker" "inspect" "dcf739504fbe69b94c185de37fa0e5dac0325aba86d57d69f39756e3145d7dd9", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "dcf739504fbe69b94c185de37fa0e5dac0325aba86d57d69f39756e3145d7dd9", kill_on_drop: false }`
[INFO] [stdout] dcf739504fbe69b94c185de37fa0e5dac0325aba86d57d69f39756e3145d7dd9
