[INFO] cloning repository https://github.com/AmmarAbouZor/LeetCode
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/AmmarAbouZor/LeetCode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FAmmarAbouZor%2FLeetCode", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FAmmarAbouZor%2FLeetCode'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] ae580c8d82a11d73ddbdb4fb23d1648ca9e28024
[INFO] checking AmmarAbouZor/LeetCode/ae580c8d82a11d73ddbdb4fb23d1648ca9e28024 against master#ab869e094a907cc5d19b4080f22eccaf347f1f95 for pr-129604
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FAmmarAbouZor%2FLeetCode" "/workspace/builds/worker-6-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/AmmarAbouZor/LeetCode on toolchain ab869e094a907cc5d19b4080f22eccaf347f1f95
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/AmmarAbouZor/LeetCode
[INFO] finished tweaking git repo https://github.com/AmmarAbouZor/LeetCode
[INFO] tweaked toml for git repo https://github.com/AmmarAbouZor/LeetCode written to /workspace/builds/worker-6-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/AmmarAbouZor/LeetCode 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" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 7e0ee93e15ae02cdf50c13a34465026f6821afe31b6b3bc68d7292a2ec67fa46
[INFO] running `Command { std: "docker" "start" "-a" "7e0ee93e15ae02cdf50c13a34465026f6821afe31b6b3bc68d7292a2ec67fa46", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "7e0ee93e15ae02cdf50c13a34465026f6821afe31b6b3bc68d7292a2ec67fa46", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "7e0ee93e15ae02cdf50c13a34465026f6821afe31b6b3bc68d7292a2ec67fa46", kill_on_drop: false }`
[INFO] [stdout] 7e0ee93e15ae02cdf50c13a34465026f6821afe31b6b3bc68d7292a2ec67fa46
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 7971957ac5bc2c3d0706cef4653a32a2483b7a9de11cb3ac7c1114de53c1f678
[INFO] running `Command { std: "docker" "start" "-a" "7971957ac5bc2c3d0706cef4653a32a2483b7a9de11cb3ac7c1114de53c1f678", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/bin/min_stack.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Pair` is never constructed
[INFO] [stdout]  --> src/bin/min_stack.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Pair {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/bin/min_stack.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Pair {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 15 |     fn new(val: i32, min: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/bin/min_stack.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 25 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/tree_level_order_traversal.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `level_order` and `level_order_no_clone` are never used
[INFO] [stdout]   --> src/bin/tree_level_order_traversal.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 17 |     // O(n): Breadth First Search (BFS)
[INFO] [stdout] 18 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn level_order_no_clone(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/validate_search_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid_bst` and `is_valid_boundary` are never used
[INFO] [stdout]   --> src/bin/validate_search_tree.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 18 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn is_valid_boundary(root: Option<&Rc<RefCell<TreeNode>>>, min: i64, max: i64) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/invert_binary_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `invert_tree` and `invert_tree_cleaner` are never used
[INFO] [stdout]   --> src/bin/invert_binary_tree.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 17 |     // Time: O(n) Space O(n)
[INFO] [stdout] 18 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn invert_tree_cleaner(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/subtree_of_another.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subtree` is never used
[INFO] [stdout]   --> src/bin/subtree_of_another.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     pub fn is_subtree(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/same_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_same_tree_simple` and `is_same_tree` are never used
[INFO] [stdout]   --> src/bin/same_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 18 |     // Easiest solution since TreeNode derives Eq
[INFO] [stdout] 19 |     pub fn is_same_tree_simple(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/lca_binary_tree.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used
[INFO] [stdout]   --> src/bin/lca_binary_tree.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     // O(Logn)
[INFO] [stdout] 17 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/subtree_of_another.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subtree` is never used
[INFO] [stdout]   --> src/bin/subtree_of_another.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     pub fn is_subtree(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/construct_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `build_tree` and `build_recursive` are never used
[INFO] [stdout]   --> src/bin/construct_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 19 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn build_recursive(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/bin/min_stack.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Pair` is never constructed
[INFO] [stdout]  --> src/bin/min_stack.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Pair {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/bin/min_stack.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Pair {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 15 |     fn new(val: i32, min: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/bin/min_stack.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 25 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]  --> src/bin/trie.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct TrieNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/bin/trie.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]   --> src/bin/trie.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Trie {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used
[INFO] [stdout]   --> src/bin/trie.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Trie {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 27 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn insert(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn starts_with(&self, prefix: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MedianFinder` is never constructed
[INFO] [stdout]  --> src/bin/median_data_stream.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct MedianFinder {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `MedianFinder` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_num`, and `find_median` are never used
[INFO] [stdout]   --> src/bin/median_data_stream.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl MedianFinder {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 15 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn add_num(&mut self, num: i32) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn find_median(&self) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/kth_smallest_elm_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `kth_smallest` is never used
[INFO] [stdout]   --> src/bin/kth_smallest_elm_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     // Time: O(logn) Space: O(logn)
[INFO] [stdout] 19 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, mut k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/invert_binary_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution {}
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `invert_tree` and `invert_tree_cleaner` are never used
[INFO] [stdout]   --> src/bin/invert_binary_tree.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 17 |     // Time: O(n) Space O(n)
[INFO] [stdout] 18 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn invert_tree_cleaner(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/tree_level_order_traversal.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `level_order` and `level_order_no_clone` are never used
[INFO] [stdout]   --> src/bin/tree_level_order_traversal.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 17 |     // O(n): Breadth First Search (BFS)
[INFO] [stdout] 18 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn level_order_no_clone(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/validate_search_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid_bst` and `is_valid_boundary` are never used
[INFO] [stdout]   --> src/bin/validate_search_tree.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 18 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn is_valid_boundary(root: Option<&Rc<RefCell<TreeNode>>>, min: i64, max: i64) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/same_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_same_tree_simple` and `is_same_tree` are never used
[INFO] [stdout]   --> src/bin/same_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 18 |     // Easiest solution since TreeNode derives Eq
[INFO] [stdout] 19 |     pub fn is_same_tree_simple(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]  --> src/bin/trie.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct TrieNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/bin/trie.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]   --> src/bin/trie.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Trie {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used
[INFO] [stdout]   --> src/bin/trie.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Trie {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 27 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn insert(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn starts_with(&self, prefix: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/lca_binary_tree.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used
[INFO] [stdout]   --> src/bin/lca_binary_tree.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     // O(Logn)
[INFO] [stdout] 17 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/max_depth_binary_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/bin/max_depth_binary_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     // Time: O(n), Space: O(Logn) Or O(h) depending on the height
[INFO] [stdout] 19 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/max_depth_binary_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/bin/max_depth_binary_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     // Time: O(n), Space: O(Logn) Or O(h) depending on the height
[INFO] [stdout] 19 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MedianFinder` is never constructed
[INFO] [stdout]  --> src/bin/median_data_stream.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct MedianFinder {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `MedianFinder` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_num`, and `find_median` are never used
[INFO] [stdout]   --> src/bin/median_data_stream.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl MedianFinder {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 15 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn add_num(&mut self, num: i32) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn find_median(&self) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/kth_smallest_elm_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `kth_smallest` is never used
[INFO] [stdout]   --> src/bin/kth_smallest_elm_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     // Time: O(logn) Space: O(logn)
[INFO] [stdout] 19 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, mut k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/bin/construct_tree.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `build_tree` and `build_recursive` are never used
[INFO] [stdout]   --> src/bin/construct_tree.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 19 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn build_recursive(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 2.38s
[INFO] running `Command { std: "docker" "inspect" "7971957ac5bc2c3d0706cef4653a32a2483b7a9de11cb3ac7c1114de53c1f678", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "7971957ac5bc2c3d0706cef4653a32a2483b7a9de11cb3ac7c1114de53c1f678", kill_on_drop: false }`
[INFO] [stdout] 7971957ac5bc2c3d0706cef4653a32a2483b7a9de11cb3ac7c1114de53c1f678