[INFO] cloning repository https://github.com/LgnMs/my-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/LgnMs/my-leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLgnMs%2Fmy-leetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLgnMs%2Fmy-leetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 1510c4a229239e22d30000124dd90f19b5a44a60
[INFO] checking LgnMs/my-leetcode-rust/1510c4a229239e22d30000124dd90f19b5a44a60 against master#ab869e094a907cc5d19b4080f22eccaf347f1f95 for pr-129604
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLgnMs%2Fmy-leetcode-rust" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/LgnMs/my-leetcode-rust 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/LgnMs/my-leetcode-rust
[INFO] finished tweaking git repo https://github.com/LgnMs/my-leetcode-rust
[INFO] tweaked toml for git repo https://github.com/LgnMs/my-leetcode-rust written to /workspace/builds/worker-1-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/LgnMs/my-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" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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] e331f6168a8835f81f05c05fe4f08de4819335739f2b2e9344b4d086daf11073
[INFO] running `Command { std: "docker" "start" "-a" "e331f6168a8835f81f05c05fe4f08de4819335739f2b2e9344b4d086daf11073", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "e331f6168a8835f81f05c05fe4f08de4819335739f2b2e9344b4d086daf11073", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "e331f6168a8835f81f05c05fe4f08de4819335739f2b2e9344b4d086daf11073", kill_on_drop: false }`
[INFO] [stdout] e331f6168a8835f81f05c05fe4f08de4819335739f2b2e9344b4d086daf11073
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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] f42a64186c7270c893d5d18b402df88d6816b87db7eb3f99ee2e702e25574c81
[INFO] running `Command { std: "docker" "start" "-a" "f42a64186c7270c893d5d18b402df88d6816b87db7eb3f99ee2e702e25574c81", kill_on_drop: false }`
[INFO] [stderr]     Checking tree v0.1.0 (/opt/rustwide/workdir/tree)
[INFO] [stderr]     Checking bit_manipulation v0.1.0 (/opt/rustwide/workdir/bit_manipulation)
[INFO] [stderr]     Checking binary_search v0.1.0 (/opt/rustwide/workdir/binary_search)
[INFO] [stderr]     Checking math v0.1.0 (/opt/rustwide/workdir/math)
[INFO] [stderr]     Checking hash_table v0.1.0 (/opt/rustwide/workdir/hash_table)
[INFO] [stderr]     Checking greedy v0.1.0 (/opt/rustwide/workdir/greedy)
[INFO] [stderr]     Checking linked_list v0.1.0 (/opt/rustwide/workdir/linked_list)
[INFO] [stderr]     Checking sort v0.1.0 (/opt/rustwide/workdir/sort)
[INFO] [stderr]     Checking dynamic_programming v0.1.0 (/opt/rustwide/workdir/dynamic_programming)
[INFO] [stderr]     Checking string v0.1.0 (/opt/rustwide/workdir/string)
[INFO] [stdout] warning: function `max_profit2` is never used
[INFO] [stdout]   --> greedy/max_profit2.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn max_profit2(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `intersect` is never used
[INFO] [stdout]   --> hash_table/intersect.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]   --> hash_table/length_of_longest_substring.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> hash_table/two_sum.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> math/is_palindrome.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `plus_one` is never used
[INFO] [stdout]  --> math/plus_one.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `roman_to_int` is never used
[INFO] [stdout]  --> math/roman_to_int.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate` is never used
[INFO] [stdout]  --> math/rotate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_prefix` is never used
[INFO] [stdout]  --> binary_search/longest_common_prefix.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_duplicate` is never used
[INFO] [stdout]  --> sort/contains_duplicate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn contains_duplicate(mut nums: Vec<i32>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_max_heap` is never used
[INFO] [stdout]  --> sort/heap_sort.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn build_max_heap(array: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_heap` is never used
[INFO] [stdout]   --> sort/heap_sort.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn max_heap(array: &mut Vec<i32>, i: usize, heap_size: usize) {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort` is never used
[INFO] [stdout]   --> sort/heap_sort.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | pub fn heap_sort(mut array: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:27:18
[INFO] [stdout]    |
[INFO] [stdout] 27 |     fn count_one(mut x: i32) -> i32 {
[INFO] [stdout]    |                  ----^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> dynamic_programming/climb_stairs.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> dynamic_programming/longest_palindrome.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_palindrome(s: &[char]) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome` is never used
[INFO] [stdout]   --> dynamic_programming/longest_palindrome.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> dynamic_programming/max_profit.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]   --> dynamic_programming/max_sub_array.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking two_pointers v0.1.0 (/opt/rustwide/workdir/two_pointers)
[INFO] [stdout] warning: function `add_two_numbers` is never used
[INFO] [stdout]   --> linked_list/add_two_numbers.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn add_two_numbers(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]   --> dynamic_programming/rob.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> linked_list/is_palindrome.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_jump` is never used
[INFO] [stdout]   --> dynamic_programming/can_jump.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> linked_list/linked_list_utils.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_list_node` is never used
[INFO] [stdout]   --> linked_list/linked_list_utils.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn generate_list_node(vecs: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number` is never used
[INFO] [stdout]  --> bit_manipulation/single_number.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NumArray` is never constructed
[INFO] [stdout]  --> dynamic_programming/num_array.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub struct NumArray {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]  --> linked_list/merge_two_lists.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn merge_two_lists(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `sum_range` are never used
[INFO] [stdout]   --> dynamic_programming/num_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl NumArray {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 17 |
[INFO] [stdout] 18 |     fn new(nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn sum_range(&self, left: i32, right: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_bits_1` is never used
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn count_bits_1(n: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_bits` is never used
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn count_bits(n: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `xor_operation` is never used
[INFO] [stdout]  --> bit_manipulation/xor_operation.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn xor_operation(n: i32, start: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]   --> linked_list/reverse_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 6 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_bst` is never used
[INFO] [stdout]   --> tree/is_valid_bst.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_bst2` is never used
[INFO] [stdout]   --> tree/is_valid_bst.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn is_valid_bst2(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Rt` is never used
[INFO] [stdout]   --> tree/max_depth.rs:12:6
[INFO] [stdout]    |
[INFO] [stdout] 12 | type Rt = Rc<RefCell<TreeNode>>;
[INFO] [stdout]    |      ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_depth` is never used
[INFO] [stdout]   --> tree/max_depth.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn max_depth(root: Option<Rt>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder_traversal` is never used
[INFO] [stdout]   --> tree/preorder_traversal.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Node` is never used
[INFO] [stdout]   --> tree/is_symmetric.rs:12:10
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub type Node = Rc<RefCell<TreeNode>>;
[INFO] [stdout]    |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_symmetric` is never used
[INFO] [stdout]   --> tree/is_symmetric.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn is_symmetric(root: Option<Node>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 13 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 7 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking playground v0.1.0 (/opt/rustwide/workdir/playground)
[INFO] [stdout] warning: function `first_uniq_char` is never used
[INFO] [stdout]   --> string/first_uniq_char.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn first_uniq_char(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_anagram` is never used
[INFO] [stdout]  --> string/is_anagram.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> string/is_palindrome.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse` is never used
[INFO] [stdout]  --> string/reverse.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_string` is never used
[INFO] [stdout]  --> string/reverse_string.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area` is never used
[INFO] [stdout]   --> two_pointers/max_area.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> two_pointers/merge.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_zeroes` is never used
[INFO] [stdout]  --> two_pointers/move_zeroes.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]  --> two_pointers/three_sum.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum_closest` is never used
[INFO] [stdout]  --> two_pointers/three_sum_closest.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn three_sum_closest(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:27:18
[INFO] [stdout]    |
[INFO] [stdout] 27 |     fn count_one(mut x: i32) -> i32 {
[INFO] [stdout]    |                  ----^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_bits_1` is never used
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn count_bits_1(n: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.24s
[INFO] running `Command { std: "docker" "inspect" "f42a64186c7270c893d5d18b402df88d6816b87db7eb3f99ee2e702e25574c81", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f42a64186c7270c893d5d18b402df88d6816b87db7eb3f99ee2e702e25574c81", kill_on_drop: false }`
[INFO] [stdout] f42a64186c7270c893d5d18b402df88d6816b87db7eb3f99ee2e702e25574c81