[INFO] cloning repository https://github.com/jit-y/leetcode-rs
[INFO] running `"git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/jit-y/leetcode-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjit-y%2Fleetcode-rs"`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjit-y%2Fleetcode-rs'...
[INFO] running `"git" "rev-parse" "HEAD"`
[INFO] [stdout] 4f8fedbd098a37f80838343c3ee163ec6964662a
[INFO] checking jit-y/leetcode-rs against master#73f76b74efcaf21bd5424d87c66cd6ed7fe5c7de for pr-68325
[INFO] running `"git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjit-y%2Fleetcode-rs" "/workspace/builds/worker-6/source"`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/jit-y/leetcode-rs on toolchain 73f76b74efcaf21bd5424d87c66cd6ed7fe5c7de
[INFO] running `"/workspace/cargo-home/bin/cargo" "+73f76b74efcaf21bd5424d87c66cd6ed7fe5c7de" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] started tweaking git repo https://github.com/jit-y/leetcode-rs
[INFO] finished tweaking git repo https://github.com/jit-y/leetcode-rs
[INFO] tweaked toml for git repo https://github.com/jit-y/leetcode-rs written to /workspace/builds/worker-6/source/Cargo.toml
[INFO] crate git repo https://github.com/jit-y/leetcode-rs already has a lockfile, it will not be regenerated
[INFO] running `"/workspace/cargo-home/bin/cargo" "+73f76b74efcaf21bd5424d87c66cd6ed7fe5c7de" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/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" "MAP_USER_ID=0" "-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" "--network" "none" "rustops/crates-build-env" "/opt/rustwide/cargo-home/bin/cargo" "+73f76b74efcaf21bd5424d87c66cd6ed7fe5c7de" "check" "--frozen" "--all" "--all-targets"`
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] [stdout] 2c18205eb73ed221e310e696c74ad2ed3b790008b52aeab8a5caf20ed5e57b43
[INFO] running `"docker" "start" "-a" "2c18205eb73ed221e310e696c74ad2ed3b790008b52aeab8a5caf20ed5e57b43"`
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]  --> examples/problems-valid_parentheses.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution {}
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `is_valid`
[INFO] [stderr]  --> examples/problems-valid_parentheses.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn is_valid(s: String) -> bool {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `remove_element_2`
[INFO] [stderr]  --> examples/problems-remove_element.rs:9:5
[INFO] [stderr]   |
[INFO] [stderr] 9 |     pub fn remove_element_2(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `add_binary_b`
[INFO] [stderr]   --> examples/problems-add_binary.rs:55:5
[INFO] [stderr]    |
[INFO] [stderr] 55 |     pub fn add_binary_b(a: String, b: String) -> String {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]   --> examples/binary_tree-level_order_traversal.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `level_order`
[INFO] [stderr]   --> examples/binary_tree-level_order_traversal.rs:24:5
[INFO] [stderr]    |
[INFO] [stderr] 24 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]  --> examples/problems-palindrome_number.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution {}
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `is_palindrome`
[INFO] [stderr]  --> examples/problems-palindrome_number.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn is_palindrome(x: i32) -> bool {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> examples/binary_tree-postorder_traversal.rs:52:17
[INFO] [stderr]    |
[INFO] [stderr] 52 |             let mut new_node = Rc::new(RefCell::new(TreeNode::new(inner.val)));
[INFO] [stderr]    |                 ----^^^^^^^^
[INFO] [stderr]    |                 |
[INFO] [stderr]    |                 help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]   --> examples/binary_tree-postorder_traversal.rs:23:8
[INFO] [stderr]    |
[INFO] [stderr] 23 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]  --> examples/problems-roman_to_integer.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution {}
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `postorder_traversal`
[INFO] [stderr]   --> examples/binary_tree-postorder_traversal.rs:26:5
[INFO] [stderr]    |
[INFO] [stderr] 26 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `roman_to_int`
[INFO] [stderr]  --> examples/problems-roman_to_integer.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn roman_to_int(s: String) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `two_sum_dp`
[INFO] [stderr]   --> examples/problems-two_sum_2.rs:28:5
[INFO] [stderr]    |
[INFO] [stderr] 28 |     pub fn two_sum_dp(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]  --> examples/problems-reverse_integer.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution {}
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `reverse`
[INFO] [stderr]  --> examples/problems-reverse_integer.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn reverse(x: i32) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `str_str2`
[INFO] [stderr]   --> examples/problems-implement_strstr.rs:14:5
[INFO] [stderr]    |
[INFO] [stderr] 14 |     pub fn str_str2(haystack: String, needle: String) -> i32 {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `new_node`
[INFO] [stderr]   --> examples/binary_tree-inorder_traversal.rs:63:29
[INFO] [stderr]    |
[INFO] [stderr] 63 |                     let mut new_node = TreeNode::new(inner.val);
[INFO] [stderr]    |                             ^^^^^^^^ help: consider prefixing with an underscore: `_new_node`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> examples/binary_tree-inorder_traversal.rs:63:25
[INFO] [stderr]    |
[INFO] [stderr] 63 |                     let mut new_node = TreeNode::new(inner.val);
[INFO] [stderr]    |                         ----^^^^^^^^
[INFO] [stderr]    |                         |
[INFO] [stderr]    |                         help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]   --> examples/binary_tree-inorder_traversal.rs:23:8
[INFO] [stderr]    |
[INFO] [stderr] 23 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `inorder_traversal`
[INFO] [stderr]   --> examples/binary_tree-inorder_traversal.rs:26:5
[INFO] [stderr]    |
[INFO] [stderr] 26 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]   --> examples/binary_tree-preorder_traversal.rs:23:8
[INFO] [stderr]    |
[INFO] [stderr] 23 | struct Solution {}
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `preorder_traversal`
[INFO] [stderr]   --> examples/binary_tree-preorder_traversal.rs:26:5
[INFO] [stderr]    |
[INFO] [stderr] 26 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 3.24s
[INFO] running `"docker" "inspect" "2c18205eb73ed221e310e696c74ad2ed3b790008b52aeab8a5caf20ed5e57b43"`
[INFO] running `"docker" "rm" "-f" "2c18205eb73ed221e310e696c74ad2ed3b790008b52aeab8a5caf20ed5e57b43"`
[INFO] [stdout] 2c18205eb73ed221e310e696c74ad2ed3b790008b52aeab8a5caf20ed5e57b43