[INFO] updating cached repository https://github.com/pearzl/leetcode_rust
[INFO] running `"git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "-c" "remote.origin.fetch=refs/heads/*:refs/heads/*" "fetch" "origin" "--force" "--prune"`
[INFO] running `"git" "rev-parse" "HEAD"`
[INFO] [stdout] 9c1ec26df03271cf05b7c1bcb6a8742344ba782e
[INFO] checking pearzl/leetcode_rust against try#d7b51666469c792a8a3f40849607739bae1e705e for pr-71665
[INFO] running `"git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fpearzl%2Fleetcode_rust" "/workspace/builds/worker-2/source"`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/pearzl/leetcode_rust on toolchain d7b51666469c792a8a3f40849607739bae1e705e
[INFO] running `"/workspace/cargo-home/bin/cargo" "+d7b51666469c792a8a3f40849607739bae1e705e" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] started tweaking git repo https://github.com/pearzl/leetcode_rust
[INFO] finished tweaking git repo https://github.com/pearzl/leetcode_rust
[INFO] tweaked toml for git repo https://github.com/pearzl/leetcode_rust written to /workspace/builds/worker-2/source/Cargo.toml
[INFO] crate git repo https://github.com/pearzl/leetcode_rust already has a lockfile, it will not be regenerated
[INFO] running `"/workspace/cargo-home/bin/cargo" "+d7b51666469c792a8a3f40849607739bae1e705e" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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" "+d7b51666469c792a8a3f40849607739bae1e705e" "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] 39d761943372c99c31c8c635b06cd17bd21c38f784f9f7d6e55f5b69120404b7
[INFO] running `"docker" "start" "-a" "39d761943372c99c31c8c635b06cd17bd21c38f784f9f7d6e55f5b69120404b7"`
[INFO] [stderr] sudo: setrlimit(RLIMIT_CORE): Operation not permitted
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]    --> src/answer/q0044_wildcard_matching.rs:150:9
[INFO] [stderr]     |
[INFO] [stderr] 150 |         std::mem::replace(from, r);
[INFO] [stderr]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_must_use)]` on by default
[INFO] [stderr]     = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0102_binary_tree_level_order_traversal.rs:31:21
[INFO] [stderr]    |
[INFO] [stderr] 31 |                     std::mem::replace(&mut level_node, new_level_node);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0103_binary_tree_zigzag_level_order_traversal.rs:38:21
[INFO] [stderr]    |
[INFO] [stderr] 38 |                     std::mem::replace(&mut level_node, new_level_node);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0107_binary_tree_level_order_traversal_ii.rs:31:21
[INFO] [stderr]    |
[INFO] [stderr] 31 |                     std::mem::replace(&mut level_node, new_level_node);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:18:25
[INFO] [stderr]    |
[INFO] [stderr] 18 |                         std::mem::replace(&mut tree.left, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:19:25
[INFO] [stderr]    |
[INFO] [stderr] 19 |                         std::mem::replace(&mut tree.right, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:25:25
[INFO] [stderr]    |
[INFO] [stderr] 25 |                         std::mem::replace(&mut tree.left, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:30:25
[INFO] [stderr]    |
[INFO] [stderr] 30 |                         std::mem::replace(&mut tree.right, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0199_binary_tree_right_side_view.rs:27:13
[INFO] [stderr]    |
[INFO] [stderr] 27 |             std::mem::replace(&mut node_buf, next_level_nodes);
[INFO] [stderr]    |             ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0212_word_search_ii.rs:34:21
[INFO] [stderr]    |
[INFO] [stderr] 34 |                     std::mem::replace(&mut paths, tmp);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: 10 warnings emitted
[INFO] [stderr] 
[INFO] [stderr] warning: this method call currently resolves to `<&[T; N] as IntoIterator>::into_iter` (due to autoref coercions), but that might change in the future when `IntoIterator` impls for arrays are added.
[INFO] [stderr]    --> src/answer/q0068_text_justification.rs:129:10
[INFO] [stderr]     |
[INFO] [stderr] 129 |         .into_iter()
[INFO] [stderr]     |          ^^^^^^^^^ help: use `.iter()` instead of `.into_iter()` to avoid ambiguity: `iter`
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(array_into_iter)]` on by default
[INFO] [stderr]     = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release!
[INFO] [stderr]     = note: for more information, see issue #66145 <https://github.com/rust-lang/rust/issues/66145>
[INFO] [stderr] 
[INFO] [stderr] warning: this method call currently resolves to `<&[T; N] as IntoIterator>::into_iter` (due to autoref coercions), but that might change in the future when `IntoIterator` impls for arrays are added.
[INFO] [stderr]    --> src/answer/q0068_text_justification.rs:140:10
[INFO] [stderr]     |
[INFO] [stderr] 140 |         .into_iter()
[INFO] [stderr]     |          ^^^^^^^^^ help: use `.iter()` instead of `.into_iter()` to avoid ambiguity: `iter`
[INFO] [stderr]     |
[INFO] [stderr]     = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release!
[INFO] [stderr]     = note: for more information, see issue #66145 <https://github.com/rust-lang/rust/issues/66145>
[INFO] [stderr] 
[INFO] [stderr] warning: this method call currently resolves to `<&[T; N] as IntoIterator>::into_iter` (due to autoref coercions), but that might change in the future when `IntoIterator` impls for arrays are added.
[INFO] [stderr]    --> src/answer/q0068_text_justification.rs:171:14
[INFO] [stderr]     |
[INFO] [stderr] 171 |             .into_iter()
[INFO] [stderr]     |              ^^^^^^^^^ help: use `.iter()` instead of `.into_iter()` to avoid ambiguity: `iter`
[INFO] [stderr]     |
[INFO] [stderr]     = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release!
[INFO] [stderr]     = note: for more information, see issue #66145 <https://github.com/rust-lang/rust/issues/66145>
[INFO] [stderr] 
[INFO] [stderr] warning: this method call currently resolves to `<&[T; N] as IntoIterator>::into_iter` (due to autoref coercions), but that might change in the future when `IntoIterator` impls for arrays are added.
[INFO] [stderr]    --> src/answer/q0068_text_justification.rs:175:14
[INFO] [stderr]     |
[INFO] [stderr] 175 |             .into_iter()
[INFO] [stderr]     |              ^^^^^^^^^ help: use `.iter()` instead of `.into_iter()` to avoid ambiguity: `iter`
[INFO] [stderr]     |
[INFO] [stderr]     = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release!
[INFO] [stderr]     = note: for more information, see issue #66145 <https://github.com/rust-lang/rust/issues/66145>
[INFO] [stderr] 
[INFO] [stderr] warning: this method call currently resolves to `<&[T; N] as IntoIterator>::into_iter` (due to autoref coercions), but that might change in the future when `IntoIterator` impls for arrays are added.
[INFO] [stderr]   --> src/answer/q0070_runclimbing_stairs.rs:46:52
[INFO] [stderr]    |
[INFO] [stderr] 46 |         for (i, o) in (1..=20).into_iter().zip(ret.into_iter().cloned()) {
[INFO] [stderr]    |                                                    ^^^^^^^^^ help: use `.iter()` instead of `.into_iter()` to avoid ambiguity: `iter`
[INFO] [stderr]    |
[INFO] [stderr]    = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release!
[INFO] [stderr]    = note: for more information, see issue #66145 <https://github.com/rust-lang/rust/issues/66145>
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]    --> src/answer/q0044_wildcard_matching.rs:150:9
[INFO] [stderr]     |
[INFO] [stderr] 150 |         std::mem::replace(from, r);
[INFO] [stderr]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_must_use)]` on by default
[INFO] [stderr]     = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0102_binary_tree_level_order_traversal.rs:31:21
[INFO] [stderr]    |
[INFO] [stderr] 31 |                     std::mem::replace(&mut level_node, new_level_node);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0103_binary_tree_zigzag_level_order_traversal.rs:38:21
[INFO] [stderr]    |
[INFO] [stderr] 38 |                     std::mem::replace(&mut level_node, new_level_node);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0107_binary_tree_level_order_traversal_ii.rs:31:21
[INFO] [stderr]    |
[INFO] [stderr] 31 |                     std::mem::replace(&mut level_node, new_level_node);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:18:25
[INFO] [stderr]    |
[INFO] [stderr] 18 |                         std::mem::replace(&mut tree.left, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:19:25
[INFO] [stderr]    |
[INFO] [stderr] 19 |                         std::mem::replace(&mut tree.right, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:25:25
[INFO] [stderr]    |
[INFO] [stderr] 25 |                         std::mem::replace(&mut tree.left, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0145_binary_tree_postorder_traversal.rs:30:25
[INFO] [stderr]    |
[INFO] [stderr] 30 |                         std::mem::replace(&mut tree.right, None);
[INFO] [stderr]    |                         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0199_binary_tree_right_side_view.rs:27:13
[INFO] [stderr]    |
[INFO] [stderr] 27 |             std::mem::replace(&mut node_buf, next_level_nodes);
[INFO] [stderr]    |             ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used
[INFO] [stderr]   --> src/answer/q0212_word_search_ii.rs:34:21
[INFO] [stderr]    |
[INFO] [stderr] 34 |                     std::mem::replace(&mut paths, tmp);
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: if you don't need the old value, you can just assign the new value directly
[INFO] [stderr] 
[INFO] [stderr] warning: 15 warnings emitted
[INFO] [stderr] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 14.58s
[INFO] running `"docker" "inspect" "39d761943372c99c31c8c635b06cd17bd21c38f784f9f7d6e55f5b69120404b7"`
[INFO] running `"docker" "rm" "-f" "39d761943372c99c31c8c635b06cd17bd21c38f784f9f7d6e55f5b69120404b7"`
[INFO] [stdout] 39d761943372c99c31c8c635b06cd17bd21c38f784f9f7d6e55f5b69120404b7