[INFO] cloning repository https://github.com/geniousli/point24 [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/geniousli/point24" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgeniousli%2Fpoint24", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgeniousli%2Fpoint24'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] c41b8b3556066d6ee6596e04c811b8742f250332 [INFO] building geniousli/point24 against master#11663cd3bfefef7d34e8f0892c250bf698049392+rustflags=-Dtail-expr-drop-order for pr-134523 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgeniousli%2Fpoint24" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/geniousli/point24 on toolchain 11663cd3bfefef7d34e8f0892c250bf698049392 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/geniousli/point24 [INFO] finished tweaking git repo https://github.com/geniousli/point24 [INFO] tweaked toml for git repo https://github.com/geniousli/point24 written to /workspace/builds/worker-3-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/geniousli/point24 already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] warning: no edition set: defaulting to the 2015 edition while the latest is 2024 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] d5ccbf37b67f67009ee9cbccc976405686ab7838c0c3b3529a905edd93d8be72 [INFO] running `Command { std: "docker" "start" "-a" "d5ccbf37b67f67009ee9cbccc976405686ab7838c0c3b3529a905edd93d8be72", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "d5ccbf37b67f67009ee9cbccc976405686ab7838c0c3b3529a905edd93d8be72", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "d5ccbf37b67f67009ee9cbccc976405686ab7838c0c3b3529a905edd93d8be72", kill_on_drop: false }` [INFO] [stdout] d5ccbf37b67f67009ee9cbccc976405686ab7838c0c3b3529a905edd93d8be72 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Dtail-expr-drop-order" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 2bc5f5db8cf9cb867b5fddb3a2fde2582999900e53b1d03c80848ad913b2e912 [INFO] running `Command { std: "docker" "start" "-a" "2bc5f5db8cf9cb867b5fddb3a2fde2582999900e53b1d03c80848ad913b2e912", kill_on_drop: false }` [INFO] [stderr] warning: no edition set: defaulting to the 2015 edition while the latest is 2024 [INFO] [stderr] Compiling point24 v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `std::str::FromStr` [INFO] [stdout] --> src/algorithm/lru.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use std::str::FromStr; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `thread` and `time` [INFO] [stdout] --> src/algorithm/lru.rs:8:11 [INFO] [stdout] | [INFO] [stdout] 8 | use std::{thread, time}; [INFO] [stdout] | ^^^^^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::slice::Iter` [INFO] [stdout] --> src/algorithm/permutation_sequence.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::slice::Iter; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Range` [INFO] [stdout] --> src/algorithm/permutation_sequence.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Range; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::Enumerate` [INFO] [stdout] --> src/algorithm/permutation_sequence.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::iter::Enumerate; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::vec::Vec` [INFO] [stdout] --> src/algorithm/rotate_list.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::vec::Vec; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/algorithm/implement_trie_prefix_tree.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/algorithm/rotate_image.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::hash_map::Entry` [INFO] [stdout] --> src/algorithm/rotate_image.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::collections::hash_map::Entry; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/algorithm/rotate_image.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Range` [INFO] [stdout] --> src/algorithm/rotate_image.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use std::ops::Range; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::char` [INFO] [stdout] --> src/algorithm/rotate_image.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use std::char; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::Iterator` [INFO] [stdout] --> src/algorithm/sort_colors.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::iter::Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/algorithm/sort_colors.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/algorithm/arithmetic_slices.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::str::Chars` [INFO] [stdout] --> src/algorithm/zigzag_conversion.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::str::Chars; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::hash_map::Entry` [INFO] [stdout] --> src/algorithm/longest_substring_without_repeating_characters.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::hash_map::Entry; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/algorithm/longest_substring_without_repeating_characters.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::char` [INFO] [stdout] --> src/algorithm/remove_element.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::char; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::hash_map::Entry` [INFO] [stdout] --> src/algorithm/remove_element.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::hash_map::Entry; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/algorithm/remove_element.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::Iterator` [INFO] [stdout] --> src/algorithm/remove_element.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::iter::Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/algorithm/remove_element.rs:12:14 [INFO] [stdout] | [INFO] [stdout] 12 | while(index < len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 12 - while(index < len) { [INFO] [stdout] 12 + while index < len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `let` scrutinee expression [INFO] [stdout] --> src/algorithm/partition_list.rs:61:50 [INFO] [stdout] | [INFO] [stdout] 61 | if let Some(ref mut inner) = (&mut *smaller) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - if let Some(ref mut inner) = (&mut *smaller) { [INFO] [stdout] 61 + if let Some(ref mut inner) = &mut *smaller { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp::PartialOrd` [INFO] [stdout] --> src/algorithm/reconstruct_queue.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cmp::PartialOrd; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::mem` [INFO] [stdout] --> src/algorithm/nc33.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::mem; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/algorithm/nc41.rs:28:27 [INFO] [stdout] | [INFO] [stdout] 28 | for _i in ((i - len)..=*pre_index) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 28 - for _i in ((i - len)..=*pre_index) { [INFO] [stdout] 28 + for _i in (i - len)..=*pre_index { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp` [INFO] [stdout] --> src/algorithm/nc127.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/algorithm/nc127.rs:28:18 [INFO] [stdout] | [INFO] [stdout] 28 | for y in (0..len2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 28 - for y in (0..len2) { [INFO] [stdout] 28 + for y in 0..len2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/algorithm/nc127.rs:30:22 [INFO] [stdout] | [INFO] [stdout] 30 | for x in (0..len1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 30 - for x in (0..len1) { [INFO] [stdout] 30 + for x in 0..len1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp` [INFO] [stdout] --> src/algorithm/nc100.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::cmp; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::Iterator` [INFO] [stdout] --> src/algorithm/lru.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::iter::Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `data` [INFO] [stdout] --> src/algorithm/lru.rs:44:18 [INFO] [stdout] | [INFO] [stdout] 44 | Some(data) => {} [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/middle_number.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | let mut i_nums = nums; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `val` [INFO] [stdout] --> src/algorithm/advantage_shuffle.rs:8:37 [INFO] [stdout] | [INFO] [stdout] 8 | if let Some((index, val)) = a.iter().enumerate().find(|item| item.1 > x) { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_val` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/fraction_to_recurring_decimal.rs:25:18 [INFO] [stdout] | [INFO] [stdout] 25 | let (mut i_ary, sign) = Solution::i_fraction_to_decimal((numerator * 10) as u64, denominator as u64); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/fraction_to_recurring_decimal.rs:40:22 [INFO] [stdout] | [INFO] [stdout] 40 | let (mut i_ary, sign) = Solution::i_fraction_to_decimal((remain * 10) as u64, denominator as u64); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `index` [INFO] [stdout] --> src/algorithm/fraction_to_recurring_decimal.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut index: Option = None; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_index` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/fraction_to_recurring_decimal.rs:54:48 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn i_fraction_to_decimal(mut one: u64, mut two: u64) -> (Vec<(u64, u64)>, Option) { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/fraction_to_recurring_decimal.rs:57:13 [INFO] [stdout] | [INFO] [stdout] 57 | let mut index: Option = None; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/remove_element.rs:11:13 [INFO] [stdout] | [INFO] [stdout] 11 | let mut len = nums.len(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/maximum_frequency_stack.rs:23:13 [INFO] [stdout] | [INFO] [stdout] 23 | let mut count_val = self.counter_hash.entry(val).or_insert(0); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/maximum_frequency_stack.rs:26:13 [INFO] [stdout] | [INFO] [stdout] 26 | let mut queue = self [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/algorithm/nc65.rs:16:29 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn Fibonacci(&self, n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/nc100.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | let mut input = "xyxyXX".to_string(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/mod.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | let mut iter = SelfIter { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `key` is never read [INFO] [stdout] --> src/algorithm/lru.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 17 | pub struct LinkNode { [INFO] [stdout] | -------- field in this struct [INFO] [stdout] 18 | val: i64, [INFO] [stdout] 19 | key: i64, [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `LinkNode` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/algorithm/rotate_list.rs:12:6 [INFO] [stdout] | [INFO] [stdout] 10 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/algorithm/middle_of_the_linked_list.rs:15:6 [INFO] [stdout] | [INFO] [stdout] 13 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | #[inline] [INFO] [stdout] 15 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/algorithm/validate_stack_sequences.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `validate_stack_sequences` is never used [INFO] [stdout] --> src/algorithm/validate_stack_sequences.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn validate_stack_sequences(pushed: Vec, popped: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/algorithm/nc45.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/algorithm/nc45.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `threeOrders`, `preorder`, `inorder`, and `afterorder` are never used [INFO] [stdout] --> src/algorithm/nc45.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 23 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn threeOrders(&self, root: Option>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn preorder(&self, root: &Option>, mut results: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn inorder(&self, root: &Option>, mut results: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | pub fn afterorder(&self, root: &Option>, mut results: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/algorithm/nc65.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `Fibonacci` are never used [INFO] [stdout] --> src/algorithm/nc65.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 6 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn Fibonacci(&self, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `main` is never used [INFO] [stdout] --> src/algorithm/nc100.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn main() { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: calls to `std::mem::drop` with a reference instead of an owned value does nothing [INFO] [stdout] --> src/algorithm/lru.rs:73:25 [INFO] [stdout] | [INFO] [stdout] 73 | drop(tail_rc); [INFO] [stdout] | ^^^^^-------^ [INFO] [stdout] | | [INFO] [stdout] | argument has type `&Rc>>` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dropping_references)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the expression or result [INFO] [stdout] | [INFO] [stdout] 73 - drop(tail_rc); [INFO] [stdout] 73 + let _ = tail_rc; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/algorithm/partition_list.rs:62:25 [INFO] [stdout] | [INFO] [stdout] 62 | mem::replace(&mut inner.next, tnext); [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] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 62 | let _ = mem::replace(&mut inner.next, tnext); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/algorithm/partition_list.rs:70:29 [INFO] [stdout] | [INFO] [stdout] 70 | ... mem::replace(&mut t_inner.next, btmp); [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] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 70 | let _ = mem::replace(&mut t_inner.next, btmp); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `std::mem::replace` that must be used [INFO] [stdout] --> src/algorithm/partition_list.rs:72:25 [INFO] [stdout] | [INFO] [stdout] 72 | mem::replace(&mut inner.next, target); [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] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 72 | let _ = mem::replace(&mut inner.next, target); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `threeOrders` should have a snake case name [INFO] [stdout] --> src/algorithm/nc45.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn threeOrders(&self, root: Option>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ help: convert the identifier to snake case: `three_orders` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `Merge` should have a snake case name [INFO] [stdout] --> src/algorithm/nc33.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn Merge( [INFO] [stdout] | ^^^^^ help: convert the identifier to snake case: `merge` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `pHead1` should have a snake case name [INFO] [stdout] --> src/algorithm/nc33.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | pHead1: Option>, [INFO] [stdout] | ^^^^^^ help: convert the identifier to snake case: `p_head1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `pHead2` should have a snake case name [INFO] [stdout] --> src/algorithm/nc33.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | pHead2: Option>, [INFO] [stdout] | ^^^^^^ help: convert the identifier to snake case: `p_head2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `findKth` should have a snake case name [INFO] [stdout] --> src/algorithm/kth_max.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn findKth(&self, mut a: &mut Vec, n: i32, K: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ help: convert the identifier to snake case: `find_kth` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `K` should have a snake case name [INFO] [stdout] --> src/algorithm/kth_max.rs:18:57 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn findKth(&self, mut a: &mut Vec, n: i32, K: i32) -> i32 { [INFO] [stdout] | ^ help: convert the identifier to snake case (notice the capitalization): `k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `FindGreatestSumOfSubArray` should have a snake case name [INFO] [stdout] --> src/algorithm/nc19.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn FindGreatestSumOfSubArray(&self, array: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `find_greatest_sum_of_sub_array` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `maxLength` should have a snake case name [INFO] [stdout] --> src/algorithm/nc41.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn maxLength(&self, arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: convert the identifier to snake case: `max_length` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `LCS` should have a snake case name [INFO] [stdout] --> src/algorithm/nc127.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn LCS(&self, str1: String, str2: String) -> String { [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `lcs` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `Fibonacci` should have a snake case name [INFO] [stdout] --> src/algorithm/nc65.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn Fibonacci(&self, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: convert the identifier to snake case (notice the capitalization): `fibonacci` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `getLongestPalindrome` should have a snake case name [INFO] [stdout] --> src/algorithm/nc17.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn getLongestPalindrome(&self, a: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `get_longest_palindrome` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `Ordering` [INFO] [stdout] --> src/main.rs:298:21 [INFO] [stdout] | [INFO] [stdout] 298 | Ordering::Less [INFO] [stdout] | ^^^^^^^^ use of undeclared type `Ordering` [INFO] [stdout] | [INFO] [stdout] help: consider importing one of these enums [INFO] [stdout] | [INFO] [stdout] 3 + use std::cmp::Ordering; [INFO] [stdout] | [INFO] [stdout] 3 + use std::sync::atomic::Ordering; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `Ordering` [INFO] [stdout] --> src/main.rs:300:21 [INFO] [stdout] | [INFO] [stdout] 300 | Ordering::Greater [INFO] [stdout] | ^^^^^^^^ use of undeclared type `Ordering` [INFO] [stdout] | [INFO] [stdout] help: consider importing one of these enums [INFO] [stdout] | [INFO] [stdout] 3 + use std::cmp::Ordering; [INFO] [stdout] | [INFO] [stdout] 3 + use std::sync::atomic::Ordering; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `advantage_shuffle`, `arithmetic_slices`, `array_partition_i`, `asteroid_collision`, `best_time_to_buy_and_sell_stock`, `find_first_and_last_position_of_element_in_sorted_array`, `fraction_to_recurring_decimal`, `group_anagrams`, `heap`, `house_robber_ii`, `house_robber`, `implement_trie_prefix_tree`, `kth_max`, `longest_substring_without_repeating_characters`, `lru`, `maximum_frequency_stack`, `merge_intervals`, `middle_number`, `middle_of_the_linked_list`, `most_long_str`, `most_water`, `nc127`, `nc17`, `nc33`, `nc41`, `partition_list`, `receive_water`, `reconstruct_queue`, `search_in_rotated_sorted_array`, `simplify_path`, `sort_colors`, `submissions`, and `zigzag_conversion` [INFO] [stdout] --> src/main.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | advantage_shuffle, arithmetic_slices, array_partition_i, asteroid_collision, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 5 | best_time_to_buy_and_sell_stock, find_first_and_last_position_of_element_in_sorted_array, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 6 | fraction_to_recurring_decimal, group_anagrams, heap, house_robber, house_robber_ii, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^ ^^^^ ^^^^^^^^^^^^ ^^^^^^^^^^^^^^^ [INFO] [stdout] 7 | implement_trie_prefix_tree, kth_max, longest_substring_without_repeating_characters, lru, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^ [INFO] [stdout] 8 | maximum_frequency_stack, merge_intervals, middle_number, middle_of_the_linked_list, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 9 | most_long_str, most_water, nc127, nc17, nc33, nc41, partition_list, receive_water, [INFO] [stdout] | ^^^^^^^^^^^^^ ^^^^^^^^^^ ^^^^^ ^^^^ ^^^^ ^^^^ ^^^^^^^^^^^^^^ ^^^^^^^^^^^^^ [INFO] [stdout] 10 | reconstruct_queue, search_in_rotated_sorted_array, simplify_path, sort_colors, submissions, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^ ^^^^^^^^^^^ ^^^^^^^^^^^ [INFO] [stdout] 11 | zigzag_conversion, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `point24::problem` [INFO] [stdout] --> src/main.rs:13:5 [INFO] [stdout] | [INFO] [stdout] 13 | use point24::problem; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::str::FromStr` [INFO] [stdout] --> src/main.rs:15:5 [INFO] [stdout] | [INFO] [stdout] 15 | use std::str::FromStr; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] For more information about this error, try `rustc --explain E0433`. [INFO] [stdout] [INFO] [stderr] error: could not compile `point24` (bin "point24") due to 2 previous errors; 3 warnings emitted [INFO] running `Command { std: "docker" "inspect" "2bc5f5db8cf9cb867b5fddb3a2fde2582999900e53b1d03c80848ad913b2e912", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2bc5f5db8cf9cb867b5fddb3a2fde2582999900e53b1d03c80848ad913b2e912", kill_on_drop: false }` [INFO] [stdout] 2bc5f5db8cf9cb867b5fddb3a2fde2582999900e53b1d03c80848ad913b2e912