[INFO] cloning repository https://github.com/pearzl/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/pearzl/leetcode_rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fpearzl%2Fleetcode_rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fpearzl%2Fleetcode_rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 9c1ec26df03271cf05b7c1bcb6a8742344ba782e [INFO] checking pearzl/leetcode_rust against try#a7a572ce3edd6d476191fbfe92c9c1986e009b34 for pr-87190-3 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fpearzl%2Fleetcode_rust" "/workspace/builds/worker-109/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-109/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/pearzl/leetcode_rust 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] 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-109/source/Cargo.toml [INFO] crate git repo https://github.com/pearzl/leetcode_rust 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] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-109/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-109/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] 68b5c3240a14c96191f00c459373e789f1a9f201b24f6ee44d1d39a6be20880c [INFO] running `Command { std: "docker" "start" "-a" "68b5c3240a14c96191f00c459373e789f1a9f201b24f6ee44d1d39a6be20880c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "68b5c3240a14c96191f00c459373e789f1a9f201b24f6ee44d1d39a6be20880c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "68b5c3240a14c96191f00c459373e789f1a9f201b24f6ee44d1d39a6be20880c", kill_on_drop: false }` [INFO] [stdout] 68b5c3240a14c96191f00c459373e789f1a9f201b24f6ee44d1d39a6be20880c [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-109/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-109/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] 9366be610885de5af3fee448ec3d20ce7a1d389928706c55832997556b628faf [INFO] running `Command { std: "docker" "start" "-a" "9366be610885de5af3fee448ec3d20ce7a1d389928706c55832997556b628faf", kill_on_drop: false }` [INFO] [stderr] Copying to /tmp/fixit [INFO] [stderr] Running `cargo fix --edition` [INFO] [stderr] Checking leetcode v0.1.0 (/tmp/fixit) [INFO] [stderr] Migrating src/lib.rs from 2018 edition to 2021 [INFO] [stderr] Fixed src/answer/q0153_find_minimum_in_rotated_sorted_array.rs (1 fix) [INFO] [stderr] Fixed src/answer/q0154_find_minimum_in_rotated_sorted_array_ii.rs (1 fix) [INFO] [stderr] Fixed src/util.rs (1 fix) [INFO] [stderr] Fixed src/answer/q0065_valid_number.rs (1 fix) [INFO] [stderr] Fixed src/answer/q0162_find_peak_element.rs (1 fix) [INFO] [stderr] Fixed src/answer/q0169_majority_element.rs (1 fix) [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0204_count_primes.rs:23:10 [INFO] [stdout] | [INFO] [stdout] 23 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:90:10 [INFO] [stdout] | [INFO] [stdout] 90 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0044_wildcard_matching.rs:150:9 [INFO] [stdout] | [INFO] [stdout] 150 | std::mem::replace(from, r); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0102_binary_tree_level_order_traversal.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0103_binary_tree_zigzag_level_order_traversal.rs:38:21 [INFO] [stdout] | [INFO] [stdout] 38 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0107_binary_tree_level_order_traversal_ii.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:18:25 [INFO] [stdout] | [INFO] [stdout] 18 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:19:25 [INFO] [stdout] | [INFO] [stdout] 19 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0199_binary_tree_right_side_view.rs:27:13 [INFO] [stdout] | [INFO] [stdout] 27 | std::mem::replace(&mut node_buf, next_level_nodes); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:34:21 [INFO] [stdout] | [INFO] [stdout] 34 | std::mem::replace(&mut paths, tmp); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 12 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Migrating src/main.rs from 2018 edition to 2021 [INFO] [stderr] Fixed src/answer/q0211_add_and_search_word_data_structure_design.rs (1 fix) [INFO] [stderr] Fixed src/answer/q0068_text_justification.rs (4 fixes) [INFO] [stderr] Fixed src/answer/q0173_binary_search_tree_iterator.rs (1 fix) [INFO] [stderr] Fixed src/answer/q0070_runclimbing_stairs.rs (1 fix) [INFO] [stderr] Fixed src/answer/q0155_min_stack.rs (1 fix) [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0204_count_primes.rs:23:10 [INFO] [stdout] | [INFO] [stdout] 23 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:90:10 [INFO] [stdout] | [INFO] [stdout] 90 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0044_wildcard_matching.rs:150:9 [INFO] [stdout] | [INFO] [stdout] 150 | std::mem::replace(from, r); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0102_binary_tree_level_order_traversal.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0103_binary_tree_zigzag_level_order_traversal.rs:38:21 [INFO] [stdout] | [INFO] [stdout] 38 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0107_binary_tree_level_order_traversal_ii.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:18:25 [INFO] [stdout] | [INFO] [stdout] 18 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:19:25 [INFO] [stdout] | [INFO] [stdout] 19 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0199_binary_tree_right_side_view.rs:27:13 [INFO] [stdout] | [INFO] [stdout] 27 | std::mem::replace(&mut node_buf, next_level_nodes); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:34:21 [INFO] [stdout] | [INFO] [stdout] 34 | std::mem::replace(&mut paths, tmp); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 12 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 40.75s [INFO] [stderr] Running `cargo check` to verify 2021 [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Checking leetcode v0.1.0 (/tmp/fixit) [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0204_count_primes.rs:23:10 [INFO] [stdout] | [INFO] [stdout] 23 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:90:10 [INFO] [stdout] | [INFO] [stdout] 90 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0204_count_primes.rs:23:10 [INFO] [stdout] | [INFO] [stdout] 23 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:90:10 [INFO] [stdout] | [INFO] [stdout] 90 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0044_wildcard_matching.rs:150:9 [INFO] [stdout] | [INFO] [stdout] 150 | std::mem::replace(from, r); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0102_binary_tree_level_order_traversal.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0103_binary_tree_zigzag_level_order_traversal.rs:38:21 [INFO] [stdout] | [INFO] [stdout] 38 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0107_binary_tree_level_order_traversal_ii.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:18:25 [INFO] [stdout] | [INFO] [stdout] 18 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:19:25 [INFO] [stdout] | [INFO] [stdout] 19 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0199_binary_tree_right_side_view.rs:27:13 [INFO] [stdout] | [INFO] [stdout] 27 | std::mem::replace(&mut node_buf, next_level_nodes); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:34:21 [INFO] [stdout] | [INFO] [stdout] 34 | std::mem::replace(&mut paths, tmp); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 12 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0044_wildcard_matching.rs:150:9 [INFO] [stdout] | [INFO] [stdout] 150 | std::mem::replace(from, r); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0102_binary_tree_level_order_traversal.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0103_binary_tree_zigzag_level_order_traversal.rs:38:21 [INFO] [stdout] | [INFO] [stdout] 38 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0107_binary_tree_level_order_traversal_ii.rs:31:21 [INFO] [stdout] | [INFO] [stdout] 31 | std::mem::replace(&mut level_node, new_level_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:18:25 [INFO] [stdout] | [INFO] [stdout] 18 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:19:25 [INFO] [stdout] | [INFO] [stdout] 19 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | std::mem::replace(&mut tree.left, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0145_binary_tree_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | std::mem::replace(&mut tree.right, None); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0199_binary_tree_right_side_view.rs:27:13 [INFO] [stdout] | [INFO] [stdout] 27 | std::mem::replace(&mut node_buf, next_level_nodes); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/answer/q0212_word_search_ii.rs:34:21 [INFO] [stdout] | [INFO] [stdout] 34 | std::mem::replace(&mut paths, tmp); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 12 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 13.21s [INFO] running `Command { std: "docker" "inspect" "9366be610885de5af3fee448ec3d20ce7a1d389928706c55832997556b628faf", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "9366be610885de5af3fee448ec3d20ce7a1d389928706c55832997556b628faf", kill_on_drop: false }` [INFO] [stdout] 9366be610885de5af3fee448ec3d20ce7a1d389928706c55832997556b628faf