[INFO] cloning repository https://github.com/imtherealnaska/leetcodesolv [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/imtherealnaska/leetcodesolv" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fimtherealnaska%2Fleetcodesolv", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fimtherealnaska%2Fleetcodesolv'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] d0bb8b8a72f151f77822459071a95a8499f1fc79 [INFO] building imtherealnaska/leetcodesolv 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%2Fimtherealnaska%2Fleetcodesolv" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/imtherealnaska/leetcodesolv 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/imtherealnaska/leetcodesolv [INFO] finished tweaking git repo https://github.com/imtherealnaska/leetcodesolv [INFO] tweaked toml for git repo https://github.com/imtherealnaska/leetcodesolv written to /workspace/builds/worker-1-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/imtherealnaska/leetcodesolv 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] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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] 4c3a13998f7e52609f6937024090ec2a5b717ccf008ba66b0b3fa27a12bf86c6 [INFO] running `Command { std: "docker" "start" "-a" "4c3a13998f7e52609f6937024090ec2a5b717ccf008ba66b0b3fa27a12bf86c6", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "4c3a13998f7e52609f6937024090ec2a5b717ccf008ba66b0b3fa27a12bf86c6", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "4c3a13998f7e52609f6937024090ec2a5b717ccf008ba66b0b3fa27a12bf86c6", kill_on_drop: false }` [INFO] [stdout] 4c3a13998f7e52609f6937024090ec2a5b717ccf008ba66b0b3fa27a12bf86c6 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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] df329e823150fa6104d73e343614ef555698f90464b002dbeee415d168346bbf [INFO] running `Command { std: "docker" "start" "-a" "df329e823150fa6104d73e343614ef555698f90464b002dbeee415d168346bbf", kill_on_drop: false }` [INFO] [stderr] Compiling hack v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: use of deprecated trait `std::ascii::AsciiExt`: use inherent methods instead [INFO] [stdout] --> src/daily_problems/vowel_replace.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ascii::AsciiExt; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ascii::AsciiExt` [INFO] [stdout] --> src/daily_problems/vowel_replace.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ascii::AsciiExt; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `p` [INFO] [stdout] --> src/daily_problems/find_length_of_longest_common_prefix_med.rs:32:29 [INFO] [stdout] | [INFO] [stdout] 32 | if let Some(p) = prefixes.get(&i) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_p` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `board` [INFO] [stdout] --> src/daily_problems/matrix_problems/sliding_puzzle_hard.rs:1:23 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn sliding_puzzle(board : Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_board` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/daily_problems/max_average_pass_ratio.rs:3:31 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn max_average_pass_ratio(mut classes: Vec>, extra_students: i32) -> f64 { [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: `n` [INFO] [stdout] --> src/daily_problems/max_k_div_components_hard.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | n: i32, [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/daily_problems/max_k_div_components_hard.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | edges: Vec>, [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `values` [INFO] [stdout] --> src/daily_problems/max_k_div_components_hard.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | values: Vec, [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_values` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/daily_problems/max_k_div_components_hard.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | k: i32, [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/daily_problems/max_unique_substring_dfs_med.rs:5:9 [INFO] [stdout] | [INFO] [stdout] 5 | let n = chars.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `ratio_array` [INFO] [stdout] --> src/daily_problems/minimized_maximum_of_products_med.rs:29:9 [INFO] [stdout] | [INFO] [stdout] 29 | let ratio_array = calculate_ratio_array(quantities); [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_ratio_array` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/daily_problems/minimized_maximum_of_products_med.rs:28:19 [INFO] [stdout] | [INFO] [stdout] 28 | fn another_tricky(n: i32, quantities: Vec) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `quantities` [INFO] [stdout] --> src/daily_problems/minimized_maximum_of_products_med.rs:33:26 [INFO] [stdout] | [INFO] [stdout] 33 | fn calculate_ratio_array(quantities: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_quantities` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/daily_problems/results_array.rs:1:22 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn results_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/daily_problems/results_array.rs:1:38 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn results_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/daily_problems/shortest_subarray_with_sum_atleast_k_hard.rs:1:26 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn shortest_subarray(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/daily_problems/shortest_subarray_with_sum_atleast_k_hard.rs:1:42 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn shortest_subarray(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/datastructures/heap_min_max_viz.rs:248:14 [INFO] [stdout] | [INFO] [stdout] 248 | for (i, item) in self.items.iter().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `u` [INFO] [stdout] --> src/algorithms/topological_sprt.rs:28:14 [INFO] [stdout] | [INFO] [stdout] 28 | for (u, neighbours) in &self.graph { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_u` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: relative drop order changing in Rust 2024 [INFO] [stdout] --> src/algorithms/bfs.rs:43:35 [INFO] [stdout] | [INFO] [stdout] 43 | while let Some(current) = queue.pop_front() { [INFO] [stdout] | ------- ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | | [INFO] [stdout] | | this value will be stored in a temporary; let us call it `#1` [INFO] [stdout] | | up until Edition 2021 `#1` is dropped last but will be dropped earlier in Edition 2024 [INFO] [stdout] | `current` calls a custom destructor [INFO] [stdout] | `current` will be dropped later as of Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 54 | } [INFO] [stdout] | - now the temporary value is dropped here, before the local variables in the block or statement [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see [INFO] [stdout] = note: most of the time, changing drop order is harmless; inspect the `impl Drop`s for side effects like releasing locks or sending messages [INFO] [stdout] = note: requested on the command line with `-D tail-expr-drop-order` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: relative drop order changing in Rust 2024 [INFO] [stdout] --> src/algorithms/bfs.rs:66:35 [INFO] [stdout] | [INFO] [stdout] 66 | while let Some(current) = queue.pop_front() { [INFO] [stdout] | ------- ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | | [INFO] [stdout] | | this value will be stored in a temporary; let us call it `#3` [INFO] [stdout] | | up until Edition 2021 `#3` is dropped last but will be dropped earlier in Edition 2024 [INFO] [stdout] | `current` calls a custom destructor [INFO] [stdout] | `current` will be dropped later as of Edition 2024 [INFO] [stdout] 67 | if current == end { [INFO] [stdout] 68 | let mut path = Vec::new(); [INFO] [stdout] | -------- [INFO] [stdout] | | [INFO] [stdout] | `path` calls a custom destructor [INFO] [stdout] | `path` will be dropped later as of Edition 2024 [INFO] [stdout] 69 | let mut current = current; [INFO] [stdout] | ----------- [INFO] [stdout] | | [INFO] [stdout] | this value will be stored in a temporary; let us call it `#1` [INFO] [stdout] | `#1` will be dropped later as of Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 85 | parent.insert(neigh.clone(), current.clone()); [INFO] [stdout] | --------------------------------------------- [INFO] [stdout] | | [INFO] [stdout] | this value will be stored in a temporary; let us call it `#2` [INFO] [stdout] | `#2` will be dropped later as of Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 89 | } [INFO] [stdout] | - now the temporary value is dropped here, before the local variables in the block or statement [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see [INFO] [stdout] = note: most of the time, changing drop order is harmless; inspect the `impl Drop`s for side effects like releasing locks or sending messages [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: relative drop order changing in Rust 2024 [INFO] [stdout] --> src/algorithms/bfs.rs:103:35 [INFO] [stdout] | [INFO] [stdout] 103 | while let Some(current) = queue.pop_front() { [INFO] [stdout] | ------- ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | | [INFO] [stdout] | | this value will be stored in a temporary; let us call it `#1` [INFO] [stdout] | | up until Edition 2021 `#1` is dropped last but will be dropped earlier in Edition 2024 [INFO] [stdout] | `current` calls a custom destructor [INFO] [stdout] | `current` will be dropped later as of Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 123 | } [INFO] [stdout] | - now the temporary value is dropped here, before the local variables in the block or statement [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see [INFO] [stdout] = note: most of the time, changing drop order is harmless; inspect the `impl Drop`s for side effects like releasing locks or sending messages [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `cousins_in_binary_tree_2_med::TreeNode` is more private than the item `replace_value_in_tree` [INFO] [stdout] --> src/daily_problems/cousins_in_binary_tree_2_med.rs:24:1 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn replace_value_in_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ function `replace_value_in_tree` is reachable at visibility `pub` [INFO] [stdout] | [INFO] [stdout] note: but type `cousins_in_binary_tree_2_med::TreeNode` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/daily_problems/cousins_in_binary_tree_2_med.rs:7:1 [INFO] [stdout] | [INFO] [stdout] 7 | struct TreeNode { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] = note: `#[warn(private_interfaces)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `DefaultComparator` is more private than the item `heap_min_max_viz::Heap` [INFO] [stdout] --> src/datastructures/heap_min_max_viz.rs:54:1 [INFO] [stdout] | [INFO] [stdout] 54 | pub struct Heap = DefaultComparator> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ struct `heap_min_max_viz::Heap` is reachable at visibility `pub` [INFO] [stdout] | [INFO] [stdout] note: but type `DefaultComparator` is only usable at visibility `pub(crate)` [INFO] [stdout] --> src/datastructures/heap_min_max_viz.rs:14:1 [INFO] [stdout] | [INFO] [stdout] 14 | pub(crate) struct DefaultComparator(PhantomData); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AllOne` is never constructed [INFO] [stdout] --> src/daily_problems/all_one_datastructure_hard.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct AllOne { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `NewTrait` is never used [INFO] [stdout] --> src/daily_problems/all_one_datastructure_hard.rs:9:7 [INFO] [stdout] | [INFO] [stdout] 9 | trait NewTrait { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCircularDeque` is never constructed [INFO] [stdout] --> src/daily_problems/circular_deque_med.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct MyCircularDeque { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/daily_problems/circular_deque_med.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl MyCircularDeque { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 15 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn insert_front(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn insert_last(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn delete_front(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn delete_last(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn get_front(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn get_rear(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/daily_problems/cousins_in_binary_tree_2_med.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | #[inline] [INFO] [stdout] 15 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CustomStack` is never constructed [INFO] [stdout] --> src/daily_problems/customstack.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct CustomStack { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `NewTrait` is never used [INFO] [stdout] --> src/daily_problems/customstack.rs:14:7 [INFO] [stdout] | [INFO] [stdout] 14 | trait NewTrait { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/divide_players_into_teams_equal_skill.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divide_players` is never used [INFO] [stdout] --> src/daily_problems/divide_players_into_teams_equal_skill.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn divide_players(mut skill: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/extra_characters_string_med.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_extra_char` is never used [INFO] [stdout] --> src/daily_problems/extra_characters_string_med.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_extra_char(s: String, dictionary: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_bits` is never used [INFO] [stdout] --> src/daily_problems/find_if_array_can_be_sorted.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn count_bits(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `other_count_bits` is never used [INFO] [stdout] --> src/daily_problems/find_if_array_can_be_sorted.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn other_count_bits(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_sort_array` is never used [INFO] [stdout] --> src/daily_problems/find_if_array_can_be_sorted.rs:17:4 [INFO] [stdout] | [INFO] [stdout] 17 | fn can_sort_array(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/find_length_of_longest_common_prefix_med.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `len_of` is never used [INFO] [stdout] --> src/daily_problems/find_length_of_longest_common_prefix_med.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn len_of(mut i: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_common_prefix` is never used [INFO] [stdout] --> src/daily_problems/find_length_of_longest_common_prefix_med.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn longest_common_prefix(mut arr1: Vec, mut arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `create_sample_tree` is never used [INFO] [stdout] --> src/daily_problems/flip_equivalent_binary_trees_med.rs:33:4 [INFO] [stdout] | [INFO] [stdout] 33 | fn create_sample_tree() -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `more_optimised` is never used [INFO] [stdout] --> src/daily_problems/left_most_building_hard.rs:38:4 [INFO] [stdout] | [INFO] [stdout] 38 | fn more_optimised(heights: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/lexicographic_numbers_medium.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lexical_order` is never used [INFO] [stdout] --> src/daily_problems/lexicographic_numbers_medium.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn lexical_order(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CharCount` is never constructed [INFO] [stdout] --> src/daily_problems/longest_happy_string_greedy_med.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct CharCount { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/daily_problems/longest_happy_string_greedy_med.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl CharCount { [INFO] [stdout] | -------------- associated function in this implementation [INFO] [stdout] 10 | fn new(ch: char, count: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_diverse_string` is never used [INFO] [stdout] --> src/daily_problems/longest_happy_string_greedy_med.rs:15:4 [INFO] [stdout] | [INFO] [stdout] 15 | fn longest_diverse_string(a: i32, b: i32, c: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_length` is never used [INFO] [stdout] --> src/daily_problems/max_length_special_substring_med.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn max_length(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `another_tricky` is never used [INFO] [stdout] --> src/daily_problems/minimized_maximum_of_products_med.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn another_tricky(n: i32, quantities: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `calculate_ratio_array` is never used [INFO] [stdout] --> src/daily_problems/minimized_maximum_of_products_med.rs:33:4 [INFO] [stdout] | [INFO] [stdout] 33 | fn calculate_ratio_array(quantities: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/minimum_string_length_after_removing_substrings_easy.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_length` is never used [INFO] [stdout] --> src/daily_problems/minimum_string_length_after_removing_substrings_easy.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_length(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_swaps` is never used [INFO] [stdout] --> src/daily_problems/minimum_swaps_to_make_string_balanced_med.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn min_swaps(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendar` is never constructed [INFO] [stdout] --> src/daily_problems/my_calendar_1_med.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyCalendar { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/daily_problems/my_calendar_1_med.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl MyCalendar { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 12 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn book(&self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyClendarTwo` is never constructed [INFO] [stdout] --> src/daily_problems/my_calendar_2_med.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct MyClendarTwo { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/daily_problems/my_calendar_2_med.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl MyClendarTwo { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 7 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/number_of_smallest_unoccupied_chair_med.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `smallest_chair` is never used [INFO] [stdout] --> src/daily_problems/number_of_smallest_unoccupied_chair_med.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn smallest_chair(times: Vec>, target_friend: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/permutation_string_medium.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `NewTrait` is never used [INFO] [stdout] --> src/daily_problems/permutation_string_medium.rs:12:7 [INFO] [stdout] | [INFO] [stdout] 12 | trait NewTrait { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/rank_transform_array_easy.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `array_rank_transform` is never used [INFO] [stdout] --> src/daily_problems/rank_transform_array_easy.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn array_rank_transform(arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `are_sentencers_similar` is never used [INFO] [stdout] --> src/daily_problems/sentence_similarity_3.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn are_sentencers_similar(sentence1: String, sentence2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Element` is never constructed [INFO] [stdout] --> src/daily_problems/smalleset_range_k_sorted_list_hard.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct Element { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `smallest_range` is never used [INFO] [stdout] --> src/daily_problems/smalleset_range_k_sorted_list_hard.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn smallest_range(nums: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_lucky` is never used [INFO] [stdout] --> src/daily_problems/sum_of_digit_string.rs:1:15 [INFO] [stdout] | [INFO] [stdout] 1 | pub(crate) fn get_lucky(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/daily_problems/sum_of_prefix_scores_of_strings_hard.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/daily_problems/sum_of_prefix_scores_of_strings_hard.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily_problems/sum_of_prefix_scores_of_strings_hard.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sum_prefix_scores` is never used [INFO] [stdout] --> src/daily_problems/sum_of_prefix_scores_of_strings_hard.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 19 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 20 | pub fn sum_prefix_scores(words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_insert` is never used [INFO] [stdout] --> src/binary_search_problems/easy/mod.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `my_sqrt` is never used [INFO] [stdout] --> src/binary_search_problems/easy/sq_root.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `merge` is never used [INFO] [stdout] --> src/datastructures/heap_min_max_viz.rs:225:8 [INFO] [stdout] | [INFO] [stdout] 84 | impl> Heap { [INFO] [stdout] | ---------------------------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 225 | fn merge(&mut self, other: Self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `src`, `dest`, and `weight` are never read [INFO] [stdout] --> src/algorithms/min_span_trees/kruskals.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct Edge { [INFO] [stdout] | ---- fields in this struct [INFO] [stdout] 3 | src: usize, [INFO] [stdout] | ^^^ [INFO] [stdout] 4 | dest: usize, [INFO] [stdout] | ^^^^ [INFO] [stdout] 5 | weight: usize, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Edge` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `vertices` and `edges` are never read [INFO] [stdout] --> src/algorithms/min_span_trees/kruskals.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 9 | pub struct Graph { [INFO] [stdout] | ----- fields in this struct [INFO] [stdout] 10 | vertices: usize, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] 11 | edges: Vec, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Graph` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `NewTrait` is never used [INFO] [stdout] --> src/algorithms/min_span_trees/kruskals.rs:14:7 [INFO] [stdout] | [INFO] [stdout] 14 | trait NewTrait { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `graph` and `vertices` are never read [INFO] [stdout] --> src/algorithms/topological_sprt.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Graph { [INFO] [stdout] | ----- fields in this struct [INFO] [stdout] 8 | graph: HashMap>, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 9 | vertices: usize, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Graph` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_edge`, and `topological_sort_kahn` are never used [INFO] [stdout] --> src/algorithms/topological_sprt.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 13 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn add_edge(&mut self, u: usize, v: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn topological_sort_kahn(&self) -> Result, &'static str> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `largest_combination_bitwise_AND_GT_Zero_med` should have a snake case name [INFO] [stdout] --> src/daily_problems/mod.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | pub mod largest_combination_bitwise_AND_GT_Zero_med; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `largest_combination_bitwise_and_gt_zero_med` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `patterN_chars` should have a snake case name [INFO] [stdout] --> src/algorithms/boyer_moore.rs:85:13 [INFO] [stdout] | [INFO] [stdout] 85 | let patterN_chars: Vec = self.pattern.chars().collect(); [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `patter_n_chars` [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] error: could not compile `hack` (bin "hack") due to 3 previous errors; 79 warnings emitted [INFO] running `Command { std: "docker" "inspect" "df329e823150fa6104d73e343614ef555698f90464b002dbeee415d168346bbf", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "df329e823150fa6104d73e343614ef555698f90464b002dbeee415d168346bbf", kill_on_drop: false }` [INFO] [stdout] df329e823150fa6104d73e343614ef555698f90464b002dbeee415d168346bbf