[INFO] cloning repository https://github.com/photoszzt/code_practice
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/photoszzt/code_practice" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 55e40661df4fbadae2e76224236e65dce6b24a37
[INFO] checking photoszzt/code_practice against try#a7a572ce3edd6d476191fbfe92c9c1986e009b34 for pr-87190-3
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice" "/workspace/builds/worker-9/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-9/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/photoszzt/code_practice on toolchain a7a572ce3edd6d476191fbfe92c9c1986e009b34
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] removed /workspace/builds/worker-9/source/.cargo/config
[INFO] started tweaking git repo https://github.com/photoszzt/code_practice
[INFO] finished tweaking git repo https://github.com/photoszzt/code_practice
[INFO] tweaked toml for git repo https://github.com/photoszzt/code_practice written to /workspace/builds/worker-9/source/Cargo.toml
[INFO] crate git repo https://github.com/photoszzt/code_practice already has a lockfile, it will not be regenerated
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "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-9/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-9/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:34b6a614d2c27851fe6cbf88fbd1137609cefab8b10d0615aaeb6fd47975d74e" "/opt/rustwide/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 811e8700cd8b76edcd2f67f16fd1551ee1c133f2bc4134d65375f70152c34d19
[INFO] running `Command { std: "docker" "start" "-a" "811e8700cd8b76edcd2f67f16fd1551ee1c133f2bc4134d65375f70152c34d19", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "811e8700cd8b76edcd2f67f16fd1551ee1c133f2bc4134d65375f70152c34d19", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "811e8700cd8b76edcd2f67f16fd1551ee1c133f2bc4134d65375f70152c34d19", kill_on_drop: false }`
[INFO] [stdout] 811e8700cd8b76edcd2f67f16fd1551ee1c133f2bc4134d65375f70152c34d19
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-9/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-9/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" "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:34b6a614d2c27851fe6cbf88fbd1137609cefab8b10d0615aaeb6fd47975d74e" "/opt/rustwide/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] d99a8dc9edf28ff39b037156f2390e90ce18f87a79b1837faacc4189b8556674
[INFO] running `Command { std: "docker" "start" "-a" "d99a8dc9edf28ff39b037156f2390e90ce18f87a79b1837faacc4189b8556674", kill_on_drop: false }`
[INFO] [stderr] Copying to /tmp/fixit
[INFO] [stderr] Running `cargo fix --edition`
[INFO] [stderr]     Checking code_practice v0.1.0 (/tmp/fixit)
[INFO] [stderr]    Migrating src/lib.rs from 2018 edition to 2021
[INFO] [stderr]        Fixed src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs (3 fixes)
[INFO] [stderr]        Fixed src/leetcode/s0144_binary_tree_preorder_traversal.rs (1 fix)
[INFO] [stderr]        Fixed src/leetcode/s0001_two_sum.rs (1 fix)
[INFO] [stderr]        Fixed src/leetcode/s0102_binary_tree_level_order_traversal.rs (3 fixes)
[INFO] [stderr]        Fixed src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs (1 fix)
[INFO] [stderr]        Fixed src/leetcode/s0002_add_two_numbers.rs (3 fixes)
[INFO] [stderr]        Fixed src/leetcode/s0145_binary_tree_postorder_traversal.rs (1 fix)
[INFO] [stderr]        Fixed src/leetcode/s0101_symmetric_tree.rs (2 fixes)
[INFO] [stderr]        Fixed src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs (3 fixes)
[INFO] [stderr]        Fixed src/leetcode/s0111_minimum_depth_of_binary_tree.rs (3 fixes)
[INFO] [stderr]        Fixed src/leetcode/s0752_open_the_lock.rs (2 fixes)
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:92:43
[INFO] [stdout]    |
[INFO] [stdout] 92 |         assert_eq!(Solution::is_symmetric(tree!(1, 2, 2, 3, 4, 4, 3)), true);
[INFO] [stdout]    |                                           ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider importing this macro:
[INFO] [stdout]            crate::tree
[INFO] [stdout]    = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:97:35
[INFO] [stdout]    |
[INFO] [stdout] 97 |             Solution::level_order(tree!(3, 9, 20, (), (), 15, 7)),
[INFO] [stdout]    |                                   ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider importing this macro:
[INFO] [stdout]            crate::tree
[INFO] [stdout]    = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]    --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:118:42
[INFO] [stdout]     |
[INFO] [stdout] 118 |             Solution::zigzag_level_order(tree!(0, 2, 4, 1, (), 3, -1, 5, 1, (), 6, (), 8)),
[INFO] [stdout]     |                                          ^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: consider importing this macro:
[INFO] [stdout]             crate::tree
[INFO] [stdout]     = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:98:42
[INFO] [stdout]    |
[INFO] [stdout] 98 |             Solution::level_order_bottom(tree!(3, 9, 20, (), (), 15, 7)),
[INFO] [stdout]    |                                          ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider importing this macro:
[INFO] [stdout]            crate::tree
[INFO] [stdout]    = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:88:40
[INFO] [stdout]    |
[INFO] [stdout] 88 |         assert_eq!(Solution::min_depth(tree!(2, (), 3, (), 4, (), 5, (), 6)), 5);
[INFO] [stdout]    |                                        ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider importing this macro:
[INFO] [stdout]            crate::tree
[INFO] [stdout]    = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:87:40
[INFO] [stdout]    |
[INFO] [stdout] 87 |         assert_eq!(Solution::min_depth(tree!(3, 9, 20, (), (), 15, 7)), 2);
[INFO] [stdout]    |                                        ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider importing this macro:
[INFO] [stdout]            crate::tree
[INFO] [stdout]    = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]    --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:110:42
[INFO] [stdout]     |
[INFO] [stdout] 110 |             Solution::zigzag_level_order(tree!(1, 2, 3, 4, (), (), 5)),
[INFO] [stdout]     |                                          ^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: consider importing this macro:
[INFO] [stdout]             crate::tree
[INFO] [stdout]     = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]    --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:102:42
[INFO] [stdout]     |
[INFO] [stdout] 102 |             Solution::zigzag_level_order(tree!(3, 9, 20, (), (), 15, 7)),
[INFO] [stdout]     |                                          ^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: consider importing this macro:
[INFO] [stdout]             crate::tree
[INFO] [stdout]     = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `tree` in this scope
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:91:43
[INFO] [stdout]    |
[INFO] [stdout] 91 |         assert_eq!(Solution::is_symmetric(tree!(1, 2, 2, (), 3, (), 3)), false);
[INFO] [stdout]    |                                           ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider importing this macro:
[INFO] [stdout]            crate::tree
[INFO] [stdout]    = help: have you added the `#[macro_use]` on the module/import?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:114:39
[INFO] [stdout]     |
[INFO] [stdout] 114 |             Solution::add_two_numbers(to_list(vec![2, 4, 3]), to_list(vec![5, 6, 4])),
[INFO] [stdout]     |                                       ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:114:63
[INFO] [stdout]     |
[INFO] [stdout] 114 |             Solution::add_two_numbers(to_list(vec![2, 4, 3]), to_list(vec![5, 6, 4])),
[INFO] [stdout]     |                                                               ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:115:13
[INFO] [stdout]     |
[INFO] [stdout] 115 |             to_list(vec![7, 0, 8])
[INFO] [stdout]     |             ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:119:39
[INFO] [stdout]     |
[INFO] [stdout] 119 |             Solution::add_two_numbers(to_list(vec![9, 9, 9, 9]), to_list(vec![9, 9, 9, 9, 9, 9])),
[INFO] [stdout]     |                                       ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:119:66
[INFO] [stdout]     |
[INFO] [stdout] 119 |             Solution::add_two_numbers(to_list(vec![9, 9, 9, 9]), to_list(vec![9, 9, 9, 9, 9, 9])),
[INFO] [stdout]     |                                                                  ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:120:13
[INFO] [stdout]     |
[INFO] [stdout] 120 |             to_list(vec![8, 9, 9, 9, 0, 0, 1])
[INFO] [stdout]     |             ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:124:39
[INFO] [stdout]     |
[INFO] [stdout] 124 |             Solution::add_two_numbers(to_list(vec![0]), to_list(vec![0])),
[INFO] [stdout]     |                                       ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:124:57
[INFO] [stdout]     |
[INFO] [stdout] 124 |             Solution::add_two_numbers(to_list(vec![0]), to_list(vec![0])),
[INFO] [stdout]     |                                                         ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `to_list` in this scope
[INFO] [stdout]    --> src/leetcode/s0002_add_two_numbers.rs:125:13
[INFO] [stdout]     |
[INFO] [stdout] 125 |             to_list(vec![0])
[INFO] [stdout]     |             ^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]     |
[INFO] [stdout] 109 |     use crate::leetcode::util::linked_list::to_list;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashSet`
[INFO] [stdout]   --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:79:9
[INFO] [stdout]    |
[INFO] [stdout] 79 |     use std::collections::HashSet;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:100:9
[INFO] [stdout]     |
[INFO] [stdout] 100 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:101:9
[INFO] [stdout]     |
[INFO] [stdout] 101 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:45:9
[INFO] [stdout]    |
[INFO] [stdout] 45 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:74:9
[INFO] [stdout]    |
[INFO] [stdout] 74 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `cur_num` is never read
[INFO] [stdout]   --> src/leetcode/s0007_reverse_integer.rs:58:21
[INFO] [stdout]    |
[INFO] [stdout] 58 |             let mut cur_num = 0;
[INFO] [stdout]    |                     ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `start_num` is never read
[INFO] [stdout]    --> src/leetcode/s0008_string_to_integer_atoi.rs:120:17
[INFO] [stdout]     |
[INFO] [stdout] 120 |         let mut start_num = 0;
[INFO] [stdout]     |                 ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `mid` is never read
[INFO] [stdout]   --> src/leetcode/s0069_sqrtx.rs:41:17
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let mut mid = 0;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0001_two_sum.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | pub 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 never used: `two_sum`
[INFO] [stdout]   --> src/leetcode/s0001_two_sum.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 42 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `add_two_numbers`
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:56:12
[INFO] [stdout]    |
[INFO] [stdout] 56 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0005_longest_palindromic_substring.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `longest_palindrome`
[INFO] [stdout]   --> src/leetcode/s0005_longest_palindromic_substring.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 42 |     pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0006_zigzag_conversion.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `convert`
[INFO] [stdout]   --> src/leetcode/s0006_zigzag_conversion.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 52 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0007_reverse_integer.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `reverse`
[INFO] [stdout]   --> src/leetcode/s0007_reverse_integer.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 36 |     pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0008_string_to_integer_atoi.rs:51:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `my_atoi`
[INFO] [stdout]   --> src/leetcode/s0008_string_to_integer_atoi.rs:59:12
[INFO] [stdout]    |
[INFO] [stdout] 59 |     pub fn my_atoi(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0009_palindrome_number.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_palindrome`
[INFO] [stdout]   --> src/leetcode/s0009_palindrome_number.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 |     pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `letter_combinations`
[INFO] [stdout]   --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0069_sqrtx.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `my_sqrt`
[INFO] [stdout]   --> src/leetcode/s0069_sqrtx.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 35 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `sym`
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:57:8
[INFO] [stdout]    |
[INFO] [stdout] 57 |     fn sym(left: Option<Rc<RefCell<TreeNode>>>, right: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_symmetric`
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:72:12
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `level_order`
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `zigzag_level_order`
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `level_order_bottom`
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `min_depth`
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:56:12
[INFO] [stdout]    |
[INFO] [stdout] 56 |     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `traverse`
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:74:12
[INFO] [stdout]    |
[INFO] [stdout] 74 |     pub fn traverse(root: Option<Rc<RefCell<TreeNode>>>, trace: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `preorder_traversal`
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:86:12
[INFO] [stdout]    |
[INFO] [stdout] 86 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `traverse`
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:74:12
[INFO] [stdout]    |
[INFO] [stdout] 74 |     pub fn traverse(root: Option<Rc<RefCell<TreeNode>>>, trace: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `postorder_traversal`
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:87:12
[INFO] [stdout]    |
[INFO] [stdout] 87 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `LRUCache`
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | struct LRUCache {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 62 |     fn new(capacity: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 |     fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `put`
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:77:8
[INFO] [stdout]    |
[INFO] [stdout] 77 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `access`
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:87:8
[INFO] [stdout]    |
[INFO] [stdout] 87 |     fn access(&mut self, key: i32) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `remove_lru`
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:93:8
[INFO] [stdout]    |
[INFO] [stdout] 93 |     fn remove_lru(&mut self) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `move_zeroes`
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 27 |     pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0516_longest_palindromic_subsequence.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `longest_palindrome_subseq`
[INFO] [stdout]   --> src/leetcode/s0516_longest_palindromic_subsequence.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 37 |     pub fn longest_palindrome_subseq(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0647_palindromic_substrings.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `count_substrings`
[INFO] [stdout]   --> src/leetcode/s0647_palindromic_substrings.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 44 |     pub fn count_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:47:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `open_lock`
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:54:12
[INFO] [stdout]    |
[INFO] [stdout] 54 |     pub fn open_lock(deadends: Vec<String>, target: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `smallest_subsequence`
[INFO] [stdout]   --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |     pub fn smallest_subsequence(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `array_strings_are_equal`
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 42 |     pub fn array_strings_are_equal(word1: Vec<String>, word2: Vec<String>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]  --> src/leetcode/util/linked_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `to_list`
[INFO] [stdout]   --> src/leetcode/util/linked_list.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn to_list(vec: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/leetcode/util/tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `to_tree`
[INFO] [stdout]   --> src/leetcode/util/tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn to_tree(vec: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 61 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Migrating src/main.rs from 2018 edition to 2021
[INFO] [stdout] error: aborting due to 18 previous errors; 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0425`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `code_practice` due to 19 previous errors; 5 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stderr] error: build failed
[INFO] [stderr] error: failed to migrate to next edition
[INFO] [stderr] 
[INFO] [stderr] Caused by:
[INFO] [stderr]   process didn't exit successfully: `cargo fix --edition --allow-no-vcs --allow-dirty --frozen --all --all-targets --message-format=json` (exit status: 101)
[INFO] running `Command { std: "docker" "inspect" "d99a8dc9edf28ff39b037156f2390e90ce18f87a79b1837faacc4189b8556674", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "d99a8dc9edf28ff39b037156f2390e90ce18f87a79b1837faacc4189b8556674", kill_on_drop: false }`
[INFO] [stdout] d99a8dc9edf28ff39b037156f2390e90ce18f87a79b1837faacc4189b8556674