[INFO] cloning repository https://github.com/MasterHesse/Rust-for-leetcode-top150
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/MasterHesse/Rust-for-leetcode-top150" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMasterHesse%2FRust-for-leetcode-top150", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMasterHesse%2FRust-for-leetcode-top150'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 6db508b2149a5aff8c5e1fbb5c5c2b41b4c08ec3
[INFO] checking MasterHesse/Rust-for-leetcode-top150 against try#bf5ff6675cf10ce009ac02007b064a7cfc4509ac for pr-140558
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMasterHesse%2FRust-for-leetcode-top150" "/workspace/builds/worker-1-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/MasterHesse/Rust-for-leetcode-top150 on toolchain bf5ff6675cf10ce009ac02007b064a7cfc4509ac
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+bf5ff6675cf10ce009ac02007b064a7cfc4509ac" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/MasterHesse/Rust-for-leetcode-top150
[INFO] finished tweaking git repo https://github.com/MasterHesse/Rust-for-leetcode-top150
[INFO] tweaked toml for git repo https://github.com/MasterHesse/Rust-for-leetcode-top150 written to /workspace/builds/worker-1-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/MasterHesse/Rust-for-leetcode-top150 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" "+bf5ff6675cf10ce009ac02007b064a7cfc4509ac" "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-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:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+bf5ff6675cf10ce009ac02007b064a7cfc4509ac" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 5465a841b3c49cf7d0b69f137e6f1d238edd3a7a84491c4bb783dff1287fd88d
[INFO] running `Command { std: "docker" "start" "-a" "5465a841b3c49cf7d0b69f137e6f1d238edd3a7a84491c4bb783dff1287fd88d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "5465a841b3c49cf7d0b69f137e6f1d238edd3a7a84491c4bb783dff1287fd88d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "5465a841b3c49cf7d0b69f137e6f1d238edd3a7a84491c4bb783dff1287fd88d", kill_on_drop: false }`
[INFO] [stdout] 5465a841b3c49cf7d0b69f137e6f1d238edd3a7a84491c4bb783dff1287fd88d
[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:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+bf5ff6675cf10ce009ac02007b064a7cfc4509ac" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] cc68d5d8560b46b198ef2379cb3d93671bec17482e63062b577df8eccc2c0cbb
[INFO] running `Command { std: "docker" "start" "-a" "cc68d5d8560b46b198ef2379cb3d93671bec17482e63062b577df8eccc2c0cbb", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.92
[INFO] [stderr]    Compiling unicode-ident v1.0.14
[INFO] [stderr]    Compiling libc v0.2.169
[INFO] [stderr]     Checking byteorder v1.5.0
[INFO] [stderr]    Compiling quote v1.0.37
[INFO] [stderr]    Compiling syn v2.0.91
[INFO] [stderr]     Checking getrandom v0.2.15
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]    Compiling zerocopy-derive v0.7.35
[INFO] [stderr]     Checking zerocopy v0.7.35
[INFO] [stderr]     Checking ppv-lite86 v0.2.20
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking top_nterview150 v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `crate::stack`
[INFO] [stdout]  --> src/binary_tree_general/bst_iterator.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::stack;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::iter`
[INFO] [stdout]   --> src/binary_tree_general/build_tree2.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 20 | use std::iter;
[INFO] [stdout]    |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/silding_window/minimumSizeSubarraySum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::result`
[INFO] [stdout]  --> src/silding_window/substring_with_concatenation_of_all_words.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::result;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::stack`
[INFO] [stdout]  --> src/binary_tree_general/bst_iterator.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::stack;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::iter`
[INFO] [stdout]   --> src/binary_tree_general/build_tree2.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 20 | use std::iter;
[INFO] [stdout]    |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/silding_window/minimumSizeSubarraySum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::Solution`
[INFO] [stdout]   --> src/silding_window/minimumSizeSubarraySum.rs:32:9
[INFO] [stdout]    |
[INFO] [stdout] 32 |     use super::Solution;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::result`
[INFO] [stdout]  --> src/silding_window/substring_with_concatenation_of_all_words.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::result;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `get_label`
[INFO] [stdout]  --> src/graph_bfs/snakes_and_ladders.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |         let get_label = |r: usize, c: usize| -> i32 {
[INFO] [stdout]   |             ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_get_label`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RandomizedSet` is never constructed
[INFO] [stdout]  --> src/array_string/insert_delete_getrand.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct RandomizedSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stdout]   --> src/array_string/insert_delete_getrand.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl RandomizedSet {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 13 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn get_random(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BSTIterator` is never constructed
[INFO] [stdout]   --> src/binary_tree_general/bst_iterator.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct BSTIterator {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used
[INFO] [stdout]   --> src/binary_tree_general/bst_iterator.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl BSTIterator {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 33 |     fn new(root: Option<Rc<RefCell<TreeNode>>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn next(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn has_next(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `snakes_and_ladders` is never used
[INFO] [stdout]  --> src/graph_bfs/snakes_and_ladders.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     fn snakes_and_ladders(board: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/delete_duplicates.rs:10:8
[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 `LRUCache` is never constructed
[INFO] [stdout]  --> src/linked_list/lru_cache.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct LRUCache {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get`, `put`, and `update_usage` are never used
[INFO] [stdout]   --> src/linked_list/lru_cache.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl LRUCache {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 10 |     fn new(capacity: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn update_usage(&mut self, key: i32) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/rotate_right.rs:10:8
[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 `MinStack` is never constructed
[INFO] [stdout]  --> src/stack/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/stack/min_stack.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 11 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]  --> src/trie/trie.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct TrieNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]  --> src/trie/trie.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Trie {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/trie/trie.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used
[INFO] [stdout]   --> src/trie/trie.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Trie {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 26 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn insert(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn starts_with(&self, prefix: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `WordDictionary` is never constructed
[INFO] [stdout]  --> src/trie/word_dictionary.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct WordDictionary {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]  --> src/trie/word_dictionary.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct TrieNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/trie/word_dictionary.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_word`, `search`, and `search_helper` are never used
[INFO] [stdout]   --> src/trie/word_dictionary.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl WordDictionary {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 25 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn add_word(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn search_helper(node: &TrieNode, mut chars: Vec<char>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `longestSubstringWithoutRepeatingCharacters` should have a snake case name
[INFO] [stdout]  --> src/silding_window/mod.rs:1:9
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub mod longestSubstringWithoutRepeatingCharacters;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `longest_substring_without_repeating_characters`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `minimumSizeSubarraySum` should have a snake case name
[INFO] [stdout]  --> src/silding_window/mod.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub mod minimumSizeSubarraySum;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `minimum_size_subarray_sum`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `get_label`
[INFO] [stdout]  --> src/graph_bfs/snakes_and_ladders.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |         let get_label = |r: usize, c: usize| -> i32 {
[INFO] [stdout]   |             ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_get_label`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BSTIterator` is never constructed
[INFO] [stdout]   --> src/binary_tree_general/bst_iterator.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct BSTIterator {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used
[INFO] [stdout]   --> src/binary_tree_general/bst_iterator.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl BSTIterator {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 33 |     fn new(root: Option<Rc<RefCell<TreeNode>>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn next(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn has_next(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `snakes_and_ladders` is never used
[INFO] [stdout]  --> src/graph_bfs/snakes_and_ladders.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     fn snakes_and_ladders(board: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/delete_duplicates.rs:10:8
[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 `LRUCache` is never constructed
[INFO] [stdout]  --> src/linked_list/lru_cache.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct LRUCache {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get`, `put`, and `update_usage` are never used
[INFO] [stdout]   --> src/linked_list/lru_cache.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl LRUCache {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 10 |     fn new(capacity: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn update_usage(&mut self, key: i32) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/linked_list/rotate_right.rs:10:8
[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 `MinStack` is never constructed
[INFO] [stdout]  --> src/stack/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/stack/min_stack.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 11 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]  --> src/trie/trie.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct TrieNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]  --> src/trie/trie.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Trie {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/trie/trie.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used
[INFO] [stdout]   --> src/trie/trie.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Trie {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 26 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn insert(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn starts_with(&self, prefix: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `WordDictionary` is never constructed
[INFO] [stdout]  --> src/trie/word_dictionary.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct WordDictionary {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]  --> src/trie/word_dictionary.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct TrieNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/trie/word_dictionary.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_word`, `search`, and `search_helper` are never used
[INFO] [stdout]   --> src/trie/word_dictionary.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl WordDictionary {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 25 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn add_word(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn search_helper(node: &TrieNode, mut chars: Vec<char>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `longestSubstringWithoutRepeatingCharacters` should have a snake case name
[INFO] [stdout]  --> src/silding_window/mod.rs:1:9
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub mod longestSubstringWithoutRepeatingCharacters;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `longest_substring_without_repeating_characters`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `minimumSizeSubarraySum` should have a snake case name
[INFO] [stdout]  --> src/silding_window/mod.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub mod minimumSizeSubarraySum;
[INFO] [stdout]   |         ^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `minimum_size_subarray_sum`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 7.73s
[INFO] running `Command { std: "docker" "inspect" "cc68d5d8560b46b198ef2379cb3d93671bec17482e63062b577df8eccc2c0cbb", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "cc68d5d8560b46b198ef2379cb3d93671bec17482e63062b577df8eccc2c0cbb", kill_on_drop: false }`
[INFO] [stdout] cc68d5d8560b46b198ef2379cb3d93671bec17482e63062b577df8eccc2c0cbb