[INFO] cloning repository https://github.com/Wegt-meoh/leetcode_by_rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Wegt-meoh/leetcode_by_rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FWegt-meoh%2Fleetcode_by_rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FWegt-meoh%2Fleetcode_by_rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] be5cb3132beda5f519f113b13470f759512bd1e1 [INFO] building Wegt-meoh/leetcode_by_rust 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%2FWegt-meoh%2Fleetcode_by_rust" "/workspace/builds/worker-4-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Wegt-meoh/leetcode_by_rust 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/Wegt-meoh/leetcode_by_rust [INFO] finished tweaking git repo https://github.com/Wegt-meoh/leetcode_by_rust [INFO] tweaked toml for git repo https://github.com/Wegt-meoh/leetcode_by_rust written to /workspace/builds/worker-4-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/Wegt-meoh/leetcode_by_rust 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-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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] b11e97ed35dd147f2dc7a2d59813cde317ae6e64b76360ed152ae40d0ebfaa16 [INFO] running `Command { std: "docker" "start" "-a" "b11e97ed35dd147f2dc7a2d59813cde317ae6e64b76360ed152ae40d0ebfaa16", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "b11e97ed35dd147f2dc7a2d59813cde317ae6e64b76360ed152ae40d0ebfaa16", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "b11e97ed35dd147f2dc7a2d59813cde317ae6e64b76360ed152ae40d0ebfaa16", kill_on_drop: false }` [INFO] [stdout] b11e97ed35dd147f2dc7a2d59813cde317ae6e64b76360ed152ae40d0ebfaa16 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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] 3690f2475b55dbe89886249716f097f449fbf99aee699b7754d53ef10aab6905 [INFO] running `Command { std: "docker" "start" "-a" "3690f2475b55dbe89886249716f097f449fbf99aee699b7754d53ef10aab6905", kill_on_drop: false }` [INFO] [stderr] Compiling leetcode v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/btree_game_winning_move.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `black` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | black, [INFO] [stdout] | ^^^^^ help: convert the identifier to upper camel case: `Black` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_camel_case_types)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `white` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | white, [INFO] [stdout] | ^^^^^ help: convert the identifier to upper camel case (notice the capitalization): `White` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `nothing` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | nothing, [INFO] [stdout] | ^^^^^^^ help: convert the identifier to upper camel case: `Nothing` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashMap` [INFO] [stdout] --> src/kth_smallest.rs:1:36 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{BinaryHeap, HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `fs::File` and `io::Read` [INFO] [stdout] --> src/max_value_after_reverse.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{fs::File, io::Read}; [INFO] [stdout] | ^^^^^^^^ ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/min_number_of_frogs.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ops::Add` [INFO] [stdout] --> src/num_tile_possibilities.rs:1:33 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{collections::HashMap, ops::Add}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap`, `HashSet`, `fs::File`, and `io::Read` [INFO] [stdout] --> src/three_sum.rs:2:19 [INFO] [stdout] | [INFO] [stdout] 2 | collections::{HashMap, HashSet}, [INFO] [stdout] | ^^^^^^^ ^^^^^^^ [INFO] [stdout] 3 | fs::File, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] 4 | io::Read, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:36 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:73 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:81 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/del_nodes.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | mut root: Option>>, [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: `k` [INFO] [stdout] --> src/find_longest_subarray.rs:27:14 [INFO] [stdout] | [INFO] [stdout] 27 | for (k, v) in prefix_sum { [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/hardest_worker.rs:4:27 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn hardest_worker(n: i32, logs: Vec>) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `step` [INFO] [stdout] --> src/is_robot_bounded.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | let mut step = 0; [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_step` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/is_robot_bounded.rs:5:13 [INFO] [stdout] | [INFO] [stdout] 5 | let mut step = 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/largest_vals_from_labels.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut pair_vec = { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_times` [INFO] [stdout] --> src/make_array_increasing.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let max_times = arr1.len().min(arr2.len()); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_times` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/max_equal_rows_after_flips.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let n = matrix[0].len(); [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/max_equal_rows_after_flips.rs:57:13 [INFO] [stdout] | [INFO] [stdout] 57 | let mut hash_map = matrix.iter().fold(HashMap::new(), |mut a, b| { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `batch_size` [INFO] [stdout] --> src/max_happy_groups.rs:4:29 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_batch_size` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `groups` [INFO] [stdout] --> src/max_happy_groups.rs:4:46 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_groups` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `count` is never read [INFO] [stdout] --> src/maximum_tastiness.rs:8:17 [INFO] [stdout] | [INFO] [stdout] 8 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/min_side_jumps.rs:13:17 [INFO] [stdout] | [INFO] [stdout] 13 | let mut prev_dp; [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/min_side_jumps.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | let mut curr_dp; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `empty_item` [INFO] [stdout] --> src/num_moves_stones_ii.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let empty_item = stones.last().unwrap() - stones[0] + 1 - n; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_empty_item` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/num_moves_stones_ii.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let mut max_ans = 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/num_moves_stones_ii.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let mut min_ans = 0; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `sum_range` [INFO] [stdout] --> src/num_pairs_divisible_by60.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let sum_range = (2, 1000); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_sum_range` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/num_tile_possibilities.rs:7:17 [INFO] [stdout] | [INFO] [stdout] 7 | let mut result = 0; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/num_tile_possibilities.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut result = 0; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `curr_y` is never read [INFO] [stdout] --> src/powerful_integers.rs:42:17 [INFO] [stdout] | [INFO] [stdout] 42 | let mut curr_y = 1; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/rearrange_barcodes.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | for i in 0..barcodes.len() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rearrange_barcodes.rs:54:13 [INFO] [stdout] | [INFO] [stdout] 54 | let mut hash_map = barcodes.iter().fold(HashMap::new(), |mut a, b| { [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/rearrange_barcodes.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let mut vec_pair = hash_map [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/rearrange_barcodes.rs:94:13 [INFO] [stdout] | [INFO] [stdout] 94 | let mut hash_map: HashMap = b.iter().fold(HashMap::new(), |mut a, b| { [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/rearrange_barcodes.rs:101:20 [INFO] [stdout] | [INFO] [stdout] 101 | for (numb, mut times) in hash_map { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/smallest_repunit_div_by_k.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let result = -1; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/store_water.rs:4:24 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [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/store_water.rs:4:46 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `temp_target` [INFO] [stdout] --> src/three_sum_closest.rs:20:17 [INFO] [stdout] | [INFO] [stdout] 20 | let temp_target = target - temp_nums[i]; [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_temp_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/add_negabinary.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_negabinary` is never used [INFO] [stdout] --> src/add_negabinary.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn add_negabinary(arr1: Vec, arr2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/average_value.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `average_value` is never used [INFO] [stdout] --> src/average_value.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn average_value(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/best_team_score.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `People` is never constructed [INFO] [stdout] --> src/best_team_score.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct People { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `is_confused` is never used [INFO] [stdout] --> src/best_team_score.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl People { [INFO] [stdout] | ----------- method in this implementation [INFO] [stdout] 20 | fn is_confused(&self, other: &Self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generatePeopleVec` is never used [INFO] [stdout] --> src/best_team_score.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn generatePeopleVec(scores: Vec, ages: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getMaxValue` is never used [INFO] [stdout] --> src/best_team_score.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn getMaxValue(v: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `best_team_score` is never used [INFO] [stdout] --> src/best_team_score.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn best_team_score(scores: Vec, ages: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/btree_game_winning_move.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/btree_game_winning_move.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `btree_game_winning_move` is never used [INFO] [stdout] --> src/btree_game_winning_move.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/check_x_matrix.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_x_matrix` is never used [INFO] [stdout] --> src/check_x_matrix.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn check_x_matrix(grid: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/combination_sum.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combination_sum` is never used [INFO] [stdout] --> src/combination_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/combination_sum2.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combination_sum2` is never used [INFO] [stdout] --> src/combination_sum2.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn combination_sum2(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/count_points.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_points` and `is_point_in_circle` are never used [INFO] [stdout] --> src/count_points.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_points(points: Vec>, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_point_in_circle(point: (i32, i32), circle: (i32, i32, i32)) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/count_time.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_time`, `get_hour_part_times`, and `get_min_part_times` are never used [INFO] [stdout] --> src/count_time.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_time(time: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn get_hour_part_times(part: &str) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn get_min_part_times(part: &str) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/del_nodes.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/del_nodes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/del_nodes.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `del_nodes` is never used [INFO] [stdout] --> src/del_nodes.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn del_nodes( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/distinct_averages.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distinct_averages` is never used [INFO] [stdout] --> src/distinct_averages.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn distinct_averages(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_anagrams.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `LOWER_A_U8` is never used [INFO] [stdout] --> src/find_anagrams.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const LOWER_A_U8: u8 = b'a'; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_anagrams` and `check` are never used [INFO] [stdout] --> src/find_anagrams.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_anagrams(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn check(map: &[i32; 26]) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_longest_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_longest_subarray` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn find_longest_subarray(mut array: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_vec_max_item` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:57:4 [INFO] [stdout] | [INFO] [stdout] 57 | fn get_vec_max_item(v: &Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_vec_min_item` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:67:4 [INFO] [stdout] | [INFO] [stdout] 67 | fn get_vec_min_item(v: &Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `string_is_number` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:77:4 [INFO] [stdout] | [INFO] [stdout] 77 | fn string_is_number(s: &String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `convert_str_vec_to_string` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:106:4 [INFO] [stdout] | [INFO] [stdout] 106 | fn convert_str_vec_to_string(str_vec: Vec<&str>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_max_k.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_k` is never used [INFO] [stdout] --> src/find_max_k.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_max_k(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_substring.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_substring` and `check` are never used [INFO] [stdout] --> src/find_substring.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_substring(s: String, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn check(map: &HashMap<&str, i32>) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/finding_users_active_minutes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `finding_users_active_minutes` is never used [INFO] [stdout] --> src/finding_users_active_minutes.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn finding_users_active_minutes(logs: Vec>, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/flip_chess.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Chess` is never used [INFO] [stdout] --> src/flip_chess.rs:8:6 [INFO] [stdout] | [INFO] [stdout] 8 | enum Chess { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `flip_chess` and `oper` are never used [INFO] [stdout] --> src/flip_chess.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 15 | pub fn flip_chess(chessboard: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn oper(x: i32, y: i32, chess_map: &mut Vec>, choose_pos: &mut Vec<(i32, i32)>) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/frog_position.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/frog_position.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/frog_position.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 9 | fn new(this: i32, edges: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `frog_position` is never used [INFO] [stdout] --> src/frog_position.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn frog_position(n: i32, edges: Vec>, t: i32, target: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/get_smallest_string.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_smallest_string` is never used [INFO] [stdout] --> src/get_smallest_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn get_smallest_string(n: i32, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hardest_worker.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `hardest_worker` is never used [INFO] [stdout] --> src/hardest_worker.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn hardest_worker(n: i32, logs: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/have_conflict.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `have_conflict` is never used [INFO] [stdout] --> src/have_conflict.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn have_conflict(event1: Vec, event2: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/is_robot_bounded.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_robot_bounded` is never used [INFO] [stdout] --> src/is_robot_bounded.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_robot_bounded(instructions: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/is_valid.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_valid2` and `is_valid` are never used [INFO] [stdout] --> src/is_valid.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn is_valid2(mut s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/k_smallest_pairs.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/k_smallest_pairs.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/k_smallest_pairs.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 25 | impl Pair { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 26 | fn new(x: usize, y: usize, x_value: i32, y_value: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `k_smallest_pairs` is never used [INFO] [stdout] --> src/k_smallest_pairs.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn k_smallest_pairs(nums1: Vec, nums2: Vec, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/kth_smallest.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Group` is never constructed [INFO] [stdout] --> src/kth_smallest.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Group { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/kth_smallest.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl Group { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 12 | fn new(index_vec: Vec, value_vec: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `kth_smallest` and `kth_smallest_1` are never used [INFO] [stdout] --> src/kth_smallest.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 53 | pub fn kth_smallest(mat: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 101 | pub fn kth_smallest_1(mat: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/largest_vals_from_labels.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/largest_vals_from_labels.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/largest_vals_from_labels.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl Pair { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 18 | fn new(value: i32, label: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_vals_from_labels` is never used [INFO] [stdout] --> src/largest_vals_from_labels.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn largest_vals_from_labels( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/length_of_lis.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_lis` is never used [INFO] [stdout] --> src/length_of_lis.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/level_order.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/level_order.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | #[inline] [INFO] [stdout] 13 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order` is never used [INFO] [stdout] --> src/level_order.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn level_order(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/longest_prefix.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_prefix` is never used [INFO] [stdout] --> src/longest_prefix.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn longest_prefix(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/make_array_increasing.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `make_array_increasing` is never used [INFO] [stdout] --> src/make_array_increasing.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn make_array_increasing(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_coins.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_coins` is never used [INFO] [stdout] --> src/max_coins.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_coins(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_equal_rows_after_flips.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_equal_rows_after_flips`, `is_equal_or_mirror`, `use_hash_map`, and `reverse_vec` are never used [INFO] [stdout] --> src/max_equal_rows_after_flips.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_equal_rows_after_flips(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn is_equal_or_mirror(a: &Vec, b: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn use_hash_map(mut matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | pub fn reverse_vec(a: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_happy_groups.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_happy_groups` is never used [INFO] [stdout] --> src/max_happy_groups.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_rep_opt1.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_rep_opt1` is never used [INFO] [stdout] --> src/max_rep_opt1.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn max_rep_opt1(text: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_sum_after_partitioning.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_after_partitioning` is never used [INFO] [stdout] --> src/max_sum_after_partitioning.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_sum_after_partitioning(arr: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_sum_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/max_sum_bst.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | #[inline] [INFO] [stdout] 16 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_bst` is never used [INFO] [stdout] --> src/max_sum_bst.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 26 | pub fn max_sum_bst(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_from_vec` is never used [INFO] [stdout] --> src/max_sum_bst.rs:79:8 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn build_tree_from_vec(v: Vec>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_sum_div_three.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_div_three` is never used [INFO] [stdout] --> src/max_sum_div_three.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn max_sum_div_three(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_total_fruits.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_total_fruits` and `get_prefix_sum` are never used [INFO] [stdout] --> src/max_total_fruits.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn get_prefix_sum(a: &Vec>, k: i32, start_pos: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_value_after_reverse.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_value_after_reverse` and `abs` are never used [INFO] [stdout] --> src/max_value_after_reverse.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_value_after_reverse(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn abs(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/maximum_tastiness.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_tastiness` is never used [INFO] [stdout] --> src/maximum_tastiness.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn maximum_tastiness(mut price: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/mct_from_leaf_values.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `mct_from_leaf_values` is never used [INFO] [stdout] --> src/mct_from_leaf_values.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn mct_from_leaf_values(mut arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_difficulty.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_difficulty` and `get_max` are never used [INFO] [stdout] --> src/min_difficulty.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn min_difficulty(job_difficulty: Vec, d: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn get_max(a: &Vec, left: usize, right: usize) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_number_of_frogs.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_number_of_frogs` and `get_index` are never used [INFO] [stdout] --> src/min_number_of_frogs.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_number_of_frogs(croak_of_frogs: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | fn get_index(c: &char) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_push_box.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `DIRECTION` is never used [INFO] [stdout] --> src/min_push_box.rs:5:7 [INFO] [stdout] | [INFO] [stdout] 5 | const DIRECTION: [(i32, i32); 4] = [(0, 1), (-1, 0), (0, -1), (1, 0)]; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_push_box` is never used [INFO] [stdout] --> src/min_push_box.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn min_push_box(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `transform` is never used [INFO] [stdout] --> src/min_push_box.rs:311:4 [INFO] [stdout] | [INFO] [stdout] 311 | fn transform(grid: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_side_jumps.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_side_jumps_dp` and `min_side_jumps` are never used [INFO] [stdout] --> src/min_side_jumps.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_side_jumps_dp(obstacles: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | pub fn min_side_jumps(obstacles: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/moves_to_make_zigzag.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `moves_to_make_zigzag` is never used [INFO] [stdout] --> src/moves_to_make_zigzag.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn moves_to_make_zigzag(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/next_larger_nodes.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/next_larger_nodes.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `next_larger_nodes` is never used [INFO] [stdout] --> src/next_larger_nodes.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn next_larger_nodes(mut head: Option>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getHead` is never used [INFO] [stdout] --> src/next_larger_nodes.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn getHead(input: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_moves_stones_ii.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_moves_stones_ii` is never used [INFO] [stdout] --> src/num_moves_stones_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_moves_stones_ii(mut stones: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_of_minutes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_of_minutes` is never used [INFO] [stdout] --> src/num_of_minutes.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn num_of_minutes(n: i32, head_id: i32, manager: Vec, inform_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_pairs_divisible_by60.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_pairs_divisible_by60` and `method2` are never used [INFO] [stdout] --> src/num_pairs_divisible_by60.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn num_pairs_divisible_by60(time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn method2(time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_smaller_by_frequency.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_smaller_by_frequency` and `f` are never used [INFO] [stdout] --> src/num_smaller_by_frequency.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn num_smaller_by_frequency(queries: Vec, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn f(s: &str) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_tile_possibilities.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_tile_possibilities` and `not_use_map` are never used [INFO] [stdout] --> src/num_tile_possibilities.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn num_tile_possibilities(tiles: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn not_use_map(tiles: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/odd_string.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `odd_string` is never used [INFO] [stdout] --> src/odd_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn odd_string(words: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/permute.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `permute` is never used [INFO] [stdout] --> src/permute.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/powerful_integers.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `powerful_integers` is never used [INFO] [stdout] --> src/powerful_integers.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn powerful_integers(mut x: i32, mut y: i32, bound: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/query_string.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `query_string` and `query_string_better` are never used [INFO] [stdout] --> src/query_string.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn query_string(s: String, n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn query_string_better(s: String, n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/rearrange_barcodes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/rearrange_barcodes.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rearrange_barcodes`, `use_binaryheap`, and `better_method` are never used [INFO] [stdout] --> src/rearrange_barcodes.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 24 | pub fn rearrange_barcodes(barcodes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn use_binaryheap(barcodes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | pub fn better_method(b: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check` is never used [INFO] [stdout] --> src/rearrange_barcodes.rs:131:4 [INFO] [stdout] | [INFO] [stdout] 131 | fn check(a: &Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/reverse.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse` is never used [INFO] [stdout] --> src/reverse.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn reverse(mut x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sample_stats.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sample_stats` is never used [INFO] [stdout] --> src/sample_stats.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn sample_stats(count: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/shortest_path_binary_matrix.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `shortest_path_binary_matrix` is never used [INFO] [stdout] --> src/shortest_path_binary_matrix.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn shortest_path_binary_matrix(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/single_number.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `single_number` and `single_number1` are never used [INFO] [stdout] --> src/single_number.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn single_number1(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/smallest_repunit_div_by_k.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `smallest_repunit_div_by_k` is never used [INFO] [stdout] --> src/smallest_repunit_div_by_k.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn smallest_repunit_div_by_k(k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sort_people.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sort_people` is never used [INFO] [stdout] --> src/sort_people.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn sort_people(names: Vec, heights: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `compare` is never used [INFO] [stdout] --> src/sort_people.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn compare(this: &(i32, usize), other: &(i32, usize)) -> Ordering { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `OrderedQueue` is never constructed [INFO] [stdout] --> src/stl.rs:6:16 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct OrderedQueue { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/stl.rs:14:16 [INFO] [stdout] | [INFO] [stdout] 10 | / impl OrderedQueue [INFO] [stdout] 11 | | where [INFO] [stdout] 12 | | T: Ord + PartialOrd + Copy, [INFO] [stdout] | |___________________________________- associated items in this implementation [INFO] [stdout] 13 | { [INFO] [stdout] 14 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn push(&mut self, item: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn front(&self) -> Option<&T> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn back(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn pop_front(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn pop_back(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn iter(&self) -> std::collections::vec_deque::Iter { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn remove(&mut self, item: &T) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/stl.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 67 | impl TreeNode { [INFO] [stdout] | ------------------------- associated function in this implementation [INFO] [stdout] 68 | fn new(val: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_from_vec` is never used [INFO] [stdout] --> src/stl.rs:77:12 [INFO] [stdout] | [INFO] [stdout] 77 | pub fn build_tree_from_vec(v: Vec>) -> Option>>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `kmp` is never used [INFO] [stdout] --> src/stl.rs:107:12 [INFO] [stdout] | [INFO] [stdout] 107 | pub fn kmp(s: &str, patten: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/store_water.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `store_water` is never used [INFO] [stdout] --> src/store_water.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strong_password_checker_ii.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `strong_password_checker_ii` is never used [INFO] [stdout] --> src/strong_password_checker_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn strong_password_checker_ii(password: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sufficient_subset.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/sufficient_subset.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sufficient_subset` is never used [INFO] [stdout] --> src/sufficient_subset.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn sufficient_subset( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/three_sum.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum` is never used [INFO] [stdout] --> src/three_sum.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn three_sum(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/three_sum_closest.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum_closest` is never used [INFO] [stdout] --> src/three_sum_closest.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeAncestor` is never constructed [INFO] [stdout] --> src/tree_ancestor.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct TreeAncestor { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_kth_ancestor` are never used [INFO] [stdout] --> src/tree_ancestor.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl TreeAncestor { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 29 | fn new(n: i32, parent: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn get_kth_ancestor(&self, node: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/unequal_triplets.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unequal_triplets` is never used [INFO] [stdout] --> src/unequal_triplets.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn unequal_triplets(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/validate_stack_sequences.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `validate_stack_sequences` is never used [INFO] [stdout] --> src/validate_stack_sequences.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn validate_stack_sequences(pushed: Vec, popped: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/vowel_strings.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `vowel_strings` is never used [INFO] [stdout] --> src/vowel_strings.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn vowel_strings(words: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/ways_to_make_fair.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `ways_to_make_fair` is never used [INFO] [stdout] --> src/ways_to_make_fair.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn ways_to_make_fair(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generatePeopleVec` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn generatePeopleVec(scores: Vec, ages: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `generate_people_vec` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getMaxValue` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn getMaxValue(v: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ help: convert the identifier to snake case: `get_max_value` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `peopleVec` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut peopleVec = generatePeopleVec(scores, ages); [INFO] [stdout] | ^^^^^^^^^ help: convert the identifier to snake case: `people_vec` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getHead` should have a snake case name [INFO] [stdout] --> src/next_larger_nodes.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn getHead(input: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^ help: convert the identifier to snake case: `get_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/three_sum.rs:35:40 [INFO] [stdout] | [INFO] [stdout] 35 | while right > 0 && right - 1 >= 0 && nums[right] == nums[right - 1] { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.63s [INFO] running `Command { std: "docker" "inspect" "3690f2475b55dbe89886249716f097f449fbf99aee699b7754d53ef10aab6905", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "3690f2475b55dbe89886249716f097f449fbf99aee699b7754d53ef10aab6905", kill_on_drop: false }` [INFO] [stdout] 3690f2475b55dbe89886249716f097f449fbf99aee699b7754d53ef10aab6905 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 73d6ee32acfa4b86ccad626453d6bbbabe4bf265512c7a12fd0c17c7a5bd4dfc [INFO] running `Command { std: "docker" "start" "-a" "73d6ee32acfa4b86ccad626453d6bbbabe4bf265512c7a12fd0c17c7a5bd4dfc", kill_on_drop: false }` [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/btree_game_winning_move.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `black` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | black, [INFO] [stdout] | ^^^^^ help: convert the identifier to upper camel case: `Black` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_camel_case_types)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `white` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | white, [INFO] [stdout] | ^^^^^ help: convert the identifier to upper camel case (notice the capitalization): `White` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `nothing` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | nothing, [INFO] [stdout] | ^^^^^^^ help: convert the identifier to upper camel case: `Nothing` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashMap` [INFO] [stdout] --> src/kth_smallest.rs:1:36 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{BinaryHeap, HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `fs::File` and `io::Read` [INFO] [stdout] --> src/max_value_after_reverse.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{fs::File, io::Read}; [INFO] [stdout] | ^^^^^^^^ ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/min_number_of_frogs.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ops::Add` [INFO] [stdout] --> src/num_tile_possibilities.rs:1:33 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{collections::HashMap, ops::Add}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap`, `HashSet`, `fs::File`, and `io::Read` [INFO] [stdout] --> src/three_sum.rs:2:19 [INFO] [stdout] | [INFO] [stdout] 2 | collections::{HashMap, HashSet}, [INFO] [stdout] | ^^^^^^^ ^^^^^^^ [INFO] [stdout] 3 | fs::File, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] 4 | io::Read, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:36 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:73 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:81 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/del_nodes.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | mut root: Option>>, [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: `k` [INFO] [stdout] --> src/find_longest_subarray.rs:27:14 [INFO] [stdout] | [INFO] [stdout] 27 | for (k, v) in prefix_sum { [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/hardest_worker.rs:4:27 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn hardest_worker(n: i32, logs: Vec>) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `step` [INFO] [stdout] --> src/is_robot_bounded.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | let mut step = 0; [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_step` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/is_robot_bounded.rs:5:13 [INFO] [stdout] | [INFO] [stdout] 5 | let mut step = 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/largest_vals_from_labels.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut pair_vec = { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_times` [INFO] [stdout] --> src/make_array_increasing.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let max_times = arr1.len().min(arr2.len()); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_times` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/max_equal_rows_after_flips.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let n = matrix[0].len(); [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/max_equal_rows_after_flips.rs:57:13 [INFO] [stdout] | [INFO] [stdout] 57 | let mut hash_map = matrix.iter().fold(HashMap::new(), |mut a, b| { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `batch_size` [INFO] [stdout] --> src/max_happy_groups.rs:4:29 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_batch_size` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `groups` [INFO] [stdout] --> src/max_happy_groups.rs:4:46 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_groups` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `count` is never read [INFO] [stdout] --> src/maximum_tastiness.rs:8:17 [INFO] [stdout] | [INFO] [stdout] 8 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/min_side_jumps.rs:13:17 [INFO] [stdout] | [INFO] [stdout] 13 | let mut prev_dp; [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/min_side_jumps.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | let mut curr_dp; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `empty_item` [INFO] [stdout] --> src/num_moves_stones_ii.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let empty_item = stones.last().unwrap() - stones[0] + 1 - n; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_empty_item` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/num_moves_stones_ii.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let mut max_ans = 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/num_moves_stones_ii.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let mut min_ans = 0; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `sum_range` [INFO] [stdout] --> src/num_pairs_divisible_by60.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let sum_range = (2, 1000); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_sum_range` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/num_tile_possibilities.rs:7:17 [INFO] [stdout] | [INFO] [stdout] 7 | let mut result = 0; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/num_tile_possibilities.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut result = 0; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `curr_y` is never read [INFO] [stdout] --> src/powerful_integers.rs:42:17 [INFO] [stdout] | [INFO] [stdout] 42 | let mut curr_y = 1; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/rearrange_barcodes.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | for i in 0..barcodes.len() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rearrange_barcodes.rs:54:13 [INFO] [stdout] | [INFO] [stdout] 54 | let mut hash_map = barcodes.iter().fold(HashMap::new(), |mut a, b| { [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/rearrange_barcodes.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let mut vec_pair = hash_map [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/rearrange_barcodes.rs:94:13 [INFO] [stdout] | [INFO] [stdout] 94 | let mut hash_map: HashMap = b.iter().fold(HashMap::new(), |mut a, b| { [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/rearrange_barcodes.rs:101:20 [INFO] [stdout] | [INFO] [stdout] 101 | for (numb, mut times) in hash_map { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/smallest_repunit_div_by_k.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let result = -1; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/store_water.rs:4:24 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [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/store_water.rs:4:46 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `temp_target` [INFO] [stdout] --> src/three_sum_closest.rs:20:17 [INFO] [stdout] | [INFO] [stdout] 20 | let temp_target = target - temp_nums[i]; [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_temp_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/add_negabinary.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_negabinary` is never used [INFO] [stdout] --> src/add_negabinary.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn add_negabinary(arr1: Vec, arr2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/average_value.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `average_value` is never used [INFO] [stdout] --> src/average_value.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn average_value(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/best_team_score.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `People` is never constructed [INFO] [stdout] --> src/best_team_score.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct People { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `is_confused` is never used [INFO] [stdout] --> src/best_team_score.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl People { [INFO] [stdout] | ----------- method in this implementation [INFO] [stdout] 20 | fn is_confused(&self, other: &Self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generatePeopleVec` is never used [INFO] [stdout] --> src/best_team_score.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn generatePeopleVec(scores: Vec, ages: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getMaxValue` is never used [INFO] [stdout] --> src/best_team_score.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn getMaxValue(v: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `best_team_score` is never used [INFO] [stdout] --> src/best_team_score.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn best_team_score(scores: Vec, ages: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/btree_game_winning_move.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/btree_game_winning_move.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `btree_game_winning_move` is never used [INFO] [stdout] --> src/btree_game_winning_move.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/check_x_matrix.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_x_matrix` is never used [INFO] [stdout] --> src/check_x_matrix.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn check_x_matrix(grid: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/combination_sum.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combination_sum` is never used [INFO] [stdout] --> src/combination_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/combination_sum2.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combination_sum2` is never used [INFO] [stdout] --> src/combination_sum2.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn combination_sum2(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/count_points.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_points` and `is_point_in_circle` are never used [INFO] [stdout] --> src/count_points.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_points(points: Vec>, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_point_in_circle(point: (i32, i32), circle: (i32, i32, i32)) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/count_time.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_time`, `get_hour_part_times`, and `get_min_part_times` are never used [INFO] [stdout] --> src/count_time.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_time(time: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn get_hour_part_times(part: &str) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn get_min_part_times(part: &str) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/del_nodes.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/del_nodes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/del_nodes.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `del_nodes` is never used [INFO] [stdout] --> src/del_nodes.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn del_nodes( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/distinct_averages.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distinct_averages` is never used [INFO] [stdout] --> src/distinct_averages.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn distinct_averages(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_anagrams.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `LOWER_A_U8` is never used [INFO] [stdout] --> src/find_anagrams.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const LOWER_A_U8: u8 = b'a'; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_anagrams` and `check` are never used [INFO] [stdout] --> src/find_anagrams.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_anagrams(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn check(map: &[i32; 26]) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_longest_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_longest_subarray` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn find_longest_subarray(mut array: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_vec_max_item` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:57:4 [INFO] [stdout] | [INFO] [stdout] 57 | fn get_vec_max_item(v: &Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_vec_min_item` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:67:4 [INFO] [stdout] | [INFO] [stdout] 67 | fn get_vec_min_item(v: &Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `string_is_number` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:77:4 [INFO] [stdout] | [INFO] [stdout] 77 | fn string_is_number(s: &String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `convert_str_vec_to_string` is never used [INFO] [stdout] --> src/find_longest_subarray.rs:106:4 [INFO] [stdout] | [INFO] [stdout] 106 | fn convert_str_vec_to_string(str_vec: Vec<&str>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_max_k.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_k` is never used [INFO] [stdout] --> src/find_max_k.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_max_k(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_substring.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_substring` and `check` are never used [INFO] [stdout] --> src/find_substring.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_substring(s: String, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn check(map: &HashMap<&str, i32>) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/finding_users_active_minutes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `finding_users_active_minutes` is never used [INFO] [stdout] --> src/finding_users_active_minutes.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn finding_users_active_minutes(logs: Vec>, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/flip_chess.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Chess` is never used [INFO] [stdout] --> src/flip_chess.rs:8:6 [INFO] [stdout] | [INFO] [stdout] 8 | enum Chess { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `flip_chess` and `oper` are never used [INFO] [stdout] --> src/flip_chess.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 15 | pub fn flip_chess(chessboard: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn oper(x: i32, y: i32, chess_map: &mut Vec>, choose_pos: &mut Vec<(i32, i32)>) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/frog_position.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/frog_position.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/frog_position.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 9 | fn new(this: i32, edges: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `frog_position` is never used [INFO] [stdout] --> src/frog_position.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn frog_position(n: i32, edges: Vec>, t: i32, target: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/get_smallest_string.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_smallest_string` is never used [INFO] [stdout] --> src/get_smallest_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn get_smallest_string(n: i32, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hardest_worker.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `hardest_worker` is never used [INFO] [stdout] --> src/hardest_worker.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn hardest_worker(n: i32, logs: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/have_conflict.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `have_conflict` is never used [INFO] [stdout] --> src/have_conflict.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn have_conflict(event1: Vec, event2: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/is_robot_bounded.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_robot_bounded` is never used [INFO] [stdout] --> src/is_robot_bounded.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_robot_bounded(instructions: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/is_valid.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_valid2` and `is_valid` are never used [INFO] [stdout] --> src/is_valid.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn is_valid2(mut s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/k_smallest_pairs.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/k_smallest_pairs.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/k_smallest_pairs.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 25 | impl Pair { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 26 | fn new(x: usize, y: usize, x_value: i32, y_value: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `k_smallest_pairs` is never used [INFO] [stdout] --> src/k_smallest_pairs.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn k_smallest_pairs(nums1: Vec, nums2: Vec, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/kth_smallest.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Group` is never constructed [INFO] [stdout] --> src/kth_smallest.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Group { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/kth_smallest.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl Group { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 12 | fn new(index_vec: Vec, value_vec: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `kth_smallest` and `kth_smallest_1` are never used [INFO] [stdout] --> src/kth_smallest.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 53 | pub fn kth_smallest(mat: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 101 | pub fn kth_smallest_1(mat: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/largest_vals_from_labels.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/largest_vals_from_labels.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/largest_vals_from_labels.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl Pair { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 18 | fn new(value: i32, label: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_vals_from_labels` is never used [INFO] [stdout] --> src/largest_vals_from_labels.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn largest_vals_from_labels( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/length_of_lis.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_lis` is never used [INFO] [stdout] --> src/length_of_lis.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/level_order.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/level_order.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | #[inline] [INFO] [stdout] 13 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order` is never used [INFO] [stdout] --> src/level_order.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn level_order(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/longest_prefix.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_prefix` is never used [INFO] [stdout] --> src/longest_prefix.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn longest_prefix(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/make_array_increasing.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `make_array_increasing` is never used [INFO] [stdout] --> src/make_array_increasing.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn make_array_increasing(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_coins.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_coins` is never used [INFO] [stdout] --> src/max_coins.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_coins(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_equal_rows_after_flips.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_equal_rows_after_flips`, `is_equal_or_mirror`, `use_hash_map`, and `reverse_vec` are never used [INFO] [stdout] --> src/max_equal_rows_after_flips.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_equal_rows_after_flips(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn is_equal_or_mirror(a: &Vec, b: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn use_hash_map(mut matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | pub fn reverse_vec(a: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_happy_groups.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_happy_groups` is never used [INFO] [stdout] --> src/max_happy_groups.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_rep_opt1.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_rep_opt1` is never used [INFO] [stdout] --> src/max_rep_opt1.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn max_rep_opt1(text: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_sum_after_partitioning.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_after_partitioning` is never used [INFO] [stdout] --> src/max_sum_after_partitioning.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_sum_after_partitioning(arr: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_sum_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/max_sum_bst.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | #[inline] [INFO] [stdout] 16 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_bst` is never used [INFO] [stdout] --> src/max_sum_bst.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 26 | pub fn max_sum_bst(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_from_vec` is never used [INFO] [stdout] --> src/max_sum_bst.rs:79:8 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn build_tree_from_vec(v: Vec>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_sum_div_three.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_div_three` is never used [INFO] [stdout] --> src/max_sum_div_three.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn max_sum_div_three(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_total_fruits.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_total_fruits` and `get_prefix_sum` are never used [INFO] [stdout] --> src/max_total_fruits.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn get_prefix_sum(a: &Vec>, k: i32, start_pos: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_value_after_reverse.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_value_after_reverse` and `abs` are never used [INFO] [stdout] --> src/max_value_after_reverse.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_value_after_reverse(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn abs(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/maximum_tastiness.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_tastiness` is never used [INFO] [stdout] --> src/maximum_tastiness.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn maximum_tastiness(mut price: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/mct_from_leaf_values.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `mct_from_leaf_values` is never used [INFO] [stdout] --> src/mct_from_leaf_values.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn mct_from_leaf_values(mut arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_difficulty.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_difficulty` and `get_max` are never used [INFO] [stdout] --> src/min_difficulty.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn min_difficulty(job_difficulty: Vec, d: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn get_max(a: &Vec, left: usize, right: usize) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_number_of_frogs.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_number_of_frogs` and `get_index` are never used [INFO] [stdout] --> src/min_number_of_frogs.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_number_of_frogs(croak_of_frogs: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | fn get_index(c: &char) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_push_box.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `DIRECTION` is never used [INFO] [stdout] --> src/min_push_box.rs:5:7 [INFO] [stdout] | [INFO] [stdout] 5 | const DIRECTION: [(i32, i32); 4] = [(0, 1), (-1, 0), (0, -1), (1, 0)]; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_push_box` is never used [INFO] [stdout] --> src/min_push_box.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn min_push_box(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `transform` is never used [INFO] [stdout] --> src/min_push_box.rs:311:4 [INFO] [stdout] | [INFO] [stdout] 311 | fn transform(grid: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/min_side_jumps.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_side_jumps_dp` and `min_side_jumps` are never used [INFO] [stdout] --> src/min_side_jumps.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_side_jumps_dp(obstacles: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | pub fn min_side_jumps(obstacles: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/moves_to_make_zigzag.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `moves_to_make_zigzag` is never used [INFO] [stdout] --> src/moves_to_make_zigzag.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn moves_to_make_zigzag(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/next_larger_nodes.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/next_larger_nodes.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `next_larger_nodes` is never used [INFO] [stdout] --> src/next_larger_nodes.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn next_larger_nodes(mut head: Option>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getHead` is never used [INFO] [stdout] --> src/next_larger_nodes.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn getHead(input: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_moves_stones_ii.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_moves_stones_ii` is never used [INFO] [stdout] --> src/num_moves_stones_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_moves_stones_ii(mut stones: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_of_minutes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_of_minutes` is never used [INFO] [stdout] --> src/num_of_minutes.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn num_of_minutes(n: i32, head_id: i32, manager: Vec, inform_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_pairs_divisible_by60.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_pairs_divisible_by60` and `method2` are never used [INFO] [stdout] --> src/num_pairs_divisible_by60.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn num_pairs_divisible_by60(time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn method2(time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_smaller_by_frequency.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_smaller_by_frequency` and `f` are never used [INFO] [stdout] --> src/num_smaller_by_frequency.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn num_smaller_by_frequency(queries: Vec, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn f(s: &str) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_tile_possibilities.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_tile_possibilities` and `not_use_map` are never used [INFO] [stdout] --> src/num_tile_possibilities.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn num_tile_possibilities(tiles: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn not_use_map(tiles: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/odd_string.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `odd_string` is never used [INFO] [stdout] --> src/odd_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn odd_string(words: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/permute.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `permute` is never used [INFO] [stdout] --> src/permute.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/powerful_integers.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `powerful_integers` is never used [INFO] [stdout] --> src/powerful_integers.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn powerful_integers(mut x: i32, mut y: i32, bound: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/query_string.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `query_string` and `query_string_better` are never used [INFO] [stdout] --> src/query_string.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn query_string(s: String, n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn query_string_better(s: String, n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/rearrange_barcodes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/rearrange_barcodes.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rearrange_barcodes`, `use_binaryheap`, and `better_method` are never used [INFO] [stdout] --> src/rearrange_barcodes.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 24 | pub fn rearrange_barcodes(barcodes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn use_binaryheap(barcodes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | pub fn better_method(b: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check` is never used [INFO] [stdout] --> src/rearrange_barcodes.rs:131:4 [INFO] [stdout] | [INFO] [stdout] 131 | fn check(a: &Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/reverse.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse` is never used [INFO] [stdout] --> src/reverse.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn reverse(mut x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sample_stats.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sample_stats` is never used [INFO] [stdout] --> src/sample_stats.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn sample_stats(count: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/shortest_path_binary_matrix.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `shortest_path_binary_matrix` is never used [INFO] [stdout] --> src/shortest_path_binary_matrix.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn shortest_path_binary_matrix(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/single_number.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `single_number` and `single_number1` are never used [INFO] [stdout] --> src/single_number.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn single_number1(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/smallest_repunit_div_by_k.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `smallest_repunit_div_by_k` is never used [INFO] [stdout] --> src/smallest_repunit_div_by_k.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn smallest_repunit_div_by_k(k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sort_people.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sort_people` is never used [INFO] [stdout] --> src/sort_people.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn sort_people(names: Vec, heights: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `compare` is never used [INFO] [stdout] --> src/sort_people.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn compare(this: &(i32, usize), other: &(i32, usize)) -> Ordering { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `OrderedQueue` is never constructed [INFO] [stdout] --> src/stl.rs:6:16 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct OrderedQueue { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/stl.rs:14:16 [INFO] [stdout] | [INFO] [stdout] 10 | / impl OrderedQueue [INFO] [stdout] 11 | | where [INFO] [stdout] 12 | | T: Ord + PartialOrd + Copy, [INFO] [stdout] | |___________________________________- associated items in this implementation [INFO] [stdout] 13 | { [INFO] [stdout] 14 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn push(&mut self, item: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn front(&self) -> Option<&T> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn back(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn pop_front(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn pop_back(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn iter(&self) -> std::collections::vec_deque::Iter { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn remove(&mut self, item: &T) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/stl.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 67 | impl TreeNode { [INFO] [stdout] | ------------------------- associated function in this implementation [INFO] [stdout] 68 | fn new(val: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree_from_vec` is never used [INFO] [stdout] --> src/stl.rs:77:12 [INFO] [stdout] | [INFO] [stdout] 77 | pub fn build_tree_from_vec(v: Vec>) -> Option>>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `kmp` is never used [INFO] [stdout] --> src/stl.rs:107:12 [INFO] [stdout] | [INFO] [stdout] 107 | pub fn kmp(s: &str, patten: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/store_water.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `store_water` is never used [INFO] [stdout] --> src/store_water.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strong_password_checker_ii.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `strong_password_checker_ii` is never used [INFO] [stdout] --> src/strong_password_checker_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn strong_password_checker_ii(password: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sufficient_subset.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/sufficient_subset.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sufficient_subset` is never used [INFO] [stdout] --> src/sufficient_subset.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn sufficient_subset( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/three_sum.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum` is never used [INFO] [stdout] --> src/three_sum.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn three_sum(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/three_sum_closest.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum_closest` is never used [INFO] [stdout] --> src/three_sum_closest.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeAncestor` is never constructed [INFO] [stdout] --> src/tree_ancestor.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct TreeAncestor { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_kth_ancestor` are never used [INFO] [stdout] --> src/tree_ancestor.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl TreeAncestor { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 29 | fn new(n: i32, parent: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn get_kth_ancestor(&self, node: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/unequal_triplets.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unequal_triplets` is never used [INFO] [stdout] --> src/unequal_triplets.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn unequal_triplets(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/validate_stack_sequences.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `validate_stack_sequences` is never used [INFO] [stdout] --> src/validate_stack_sequences.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn validate_stack_sequences(pushed: Vec, popped: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/vowel_strings.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `vowel_strings` is never used [INFO] [stdout] --> src/vowel_strings.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn vowel_strings(words: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/ways_to_make_fair.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `ways_to_make_fair` is never used [INFO] [stdout] --> src/ways_to_make_fair.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn ways_to_make_fair(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generatePeopleVec` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn generatePeopleVec(scores: Vec, ages: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `generate_people_vec` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getMaxValue` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn getMaxValue(v: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ help: convert the identifier to snake case: `get_max_value` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `peopleVec` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut peopleVec = generatePeopleVec(scores, ages); [INFO] [stdout] | ^^^^^^^^^ help: convert the identifier to snake case: `people_vec` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getHead` should have a snake case name [INFO] [stdout] --> src/next_larger_nodes.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn getHead(input: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^ help: convert the identifier to snake case: `get_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/three_sum.rs:35:40 [INFO] [stdout] | [INFO] [stdout] 35 | while right > 0 && right - 1 >= 0 && nums[right] == nums[right - 1] { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling leetcode v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/btree_game_winning_move.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `black` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | black, [INFO] [stdout] | ^^^^^ help: convert the identifier to upper camel case: `Black` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_camel_case_types)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `white` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | white, [INFO] [stdout] | ^^^^^ help: convert the identifier to upper camel case (notice the capitalization): `White` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `nothing` should have an upper camel case name [INFO] [stdout] --> src/flip_chess.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | nothing, [INFO] [stdout] | ^^^^^^^ help: convert the identifier to upper camel case: `Nothing` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashMap` [INFO] [stdout] --> src/kth_smallest.rs:1:36 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{BinaryHeap, HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ops::Add` [INFO] [stdout] --> src/num_tile_possibilities.rs:1:33 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{collections::HashMap, ops::Add}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap` and `HashSet` [INFO] [stdout] --> src/three_sum.rs:2:19 [INFO] [stdout] | [INFO] [stdout] 2 | collections::{HashMap, HashSet}, [INFO] [stdout] | ^^^^^^^ ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:36 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:73 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/btree_game_winning_move.rs:24:81 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/del_nodes.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | mut root: Option>>, [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: `k` [INFO] [stdout] --> src/find_longest_subarray.rs:27:14 [INFO] [stdout] | [INFO] [stdout] 27 | for (k, v) in prefix_sum { [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/hardest_worker.rs:4:27 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn hardest_worker(n: i32, logs: Vec>) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/hardest_worker.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | let n = 10; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `logs` [INFO] [stdout] --> src/hardest_worker.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | let logs = vec![vec![0, 3], vec![2, 5], vec![0, 9], vec![1, 15]]; [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_logs` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `step` [INFO] [stdout] --> src/is_robot_bounded.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | let mut step = 0; [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_step` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/is_robot_bounded.rs:5:13 [INFO] [stdout] | [INFO] [stdout] 5 | let mut step = 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/largest_vals_from_labels.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut pair_vec = { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_times` [INFO] [stdout] --> src/make_array_increasing.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let max_times = arr1.len().min(arr2.len()); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_times` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/max_equal_rows_after_flips.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let n = matrix[0].len(); [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/max_equal_rows_after_flips.rs:57:13 [INFO] [stdout] | [INFO] [stdout] 57 | let mut hash_map = matrix.iter().fold(HashMap::new(), |mut a, b| { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `batch_size` [INFO] [stdout] --> src/max_happy_groups.rs:4:29 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_batch_size` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `groups` [INFO] [stdout] --> src/max_happy_groups.rs:4:46 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_groups` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `count` is never read [INFO] [stdout] --> src/maximum_tastiness.rs:8:17 [INFO] [stdout] | [INFO] [stdout] 8 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/min_side_jumps.rs:13:17 [INFO] [stdout] | [INFO] [stdout] 13 | let mut prev_dp; [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/min_side_jumps.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | let mut curr_dp; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `ans` [INFO] [stdout] --> src/next_larger_nodes.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | let ans = vec![5, 5, 0]; [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_ans` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/next_larger_nodes.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | let result = Solution::next_larger_nodes(getHead(input)); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `ans` [INFO] [stdout] --> src/next_larger_nodes.rs:59:9 [INFO] [stdout] | [INFO] [stdout] 59 | let ans = vec![7, 0, 5, 5, 0]; [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_ans` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/next_larger_nodes.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | let result = Solution::next_larger_nodes(getHead(input)); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `empty_item` [INFO] [stdout] --> src/num_moves_stones_ii.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let empty_item = stones.last().unwrap() - stones[0] + 1 - n; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_empty_item` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/num_moves_stones_ii.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let mut max_ans = 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/num_moves_stones_ii.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let mut min_ans = 0; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `sum_range` [INFO] [stdout] --> src/num_pairs_divisible_by60.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let sum_range = (2, 1000); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_sum_range` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/num_tile_possibilities.rs:7:17 [INFO] [stdout] | [INFO] [stdout] 7 | let mut result = 0; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/num_tile_possibilities.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut result = 0; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `curr_y` is never read [INFO] [stdout] --> src/powerful_integers.rs:42:17 [INFO] [stdout] | [INFO] [stdout] 42 | let mut curr_y = 1; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/rearrange_barcodes.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | for i in 0..barcodes.len() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rearrange_barcodes.rs:54:13 [INFO] [stdout] | [INFO] [stdout] 54 | let mut hash_map = barcodes.iter().fold(HashMap::new(), |mut a, b| { [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/rearrange_barcodes.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let mut vec_pair = hash_map [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/rearrange_barcodes.rs:94:13 [INFO] [stdout] | [INFO] [stdout] 94 | let mut hash_map: HashMap = b.iter().fold(HashMap::new(), |mut a, b| { [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/rearrange_barcodes.rs:101:20 [INFO] [stdout] | [INFO] [stdout] 101 | for (numb, mut times) in hash_map { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/smallest_repunit_div_by_k.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let result = -1; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/store_water.rs:4:24 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [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/store_water.rs:4:46 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn store_water(mut bucket: Vec, mut vat: Vec) -> i32 { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `temp_target` [INFO] [stdout] --> src/three_sum_closest.rs:20:17 [INFO] [stdout] | [INFO] [stdout] 20 | let temp_target = target - temp_nums[i]; [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_temp_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/average_value.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `average_value` is never used [INFO] [stdout] --> src/average_value.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn average_value(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/btree_game_winning_move.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/btree_game_winning_move.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `btree_game_winning_move` is never used [INFO] [stdout] --> src/btree_game_winning_move.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/check_x_matrix.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_x_matrix` is never used [INFO] [stdout] --> src/check_x_matrix.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn check_x_matrix(grid: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/del_nodes.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/del_nodes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/del_nodes.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `del_nodes` is never used [INFO] [stdout] --> src/del_nodes.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn del_nodes( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/distinct_averages.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distinct_averages` is never used [INFO] [stdout] --> src/distinct_averages.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn distinct_averages(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/find_max_k.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_k` is never used [INFO] [stdout] --> src/find_max_k.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_max_k(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/finding_users_active_minutes.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `finding_users_active_minutes` is never used [INFO] [stdout] --> src/finding_users_active_minutes.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn finding_users_active_minutes(logs: Vec>, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/flip_chess.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Chess` is never used [INFO] [stdout] --> src/flip_chess.rs:8:6 [INFO] [stdout] | [INFO] [stdout] 8 | enum Chess { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `flip_chess` and `oper` are never used [INFO] [stdout] --> src/flip_chess.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 15 | pub fn flip_chess(chessboard: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn oper(x: i32, y: i32, chess_map: &mut Vec>, choose_pos: &mut Vec<(i32, i32)>) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `this` is never read [INFO] [stdout] --> src/frog_position.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 3 | struct Node { [INFO] [stdout] | ---- field in this struct [INFO] [stdout] 4 | this: i32, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hardest_worker.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `hardest_worker` is never used [INFO] [stdout] --> src/hardest_worker.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn hardest_worker(n: i32, logs: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid2` is never used [INFO] [stdout] --> src/is_valid.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_valid2(mut s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_smallest_1` is never used [INFO] [stdout] --> src/kth_smallest.rs:101:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 101 | pub fn kth_smallest_1(mat: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/level_order.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/level_order.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | #[inline] [INFO] [stdout] 13 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order` is never used [INFO] [stdout] --> src/level_order.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn level_order(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_happy_groups.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_happy_groups` is never used [INFO] [stdout] --> src/max_happy_groups.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_rep_opt1.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_rep_opt1` is never used [INFO] [stdout] --> src/max_rep_opt1.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn max_rep_opt1(text: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_sum_div_three.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_div_three` is never used [INFO] [stdout] --> src/max_sum_div_three.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn max_sum_div_three(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/maximum_tastiness.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_tastiness` is never used [INFO] [stdout] --> src/maximum_tastiness.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn maximum_tastiness(mut price: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/min_push_box.rs:111:16 [INFO] [stdout] | [INFO] [stdout] 111 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/num_smaller_by_frequency.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_smaller_by_frequency` and `f` are never used [INFO] [stdout] --> src/num_smaller_by_frequency.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn num_smaller_by_frequency(queries: Vec, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn f(s: &str) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/odd_string.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `odd_string` is never used [INFO] [stdout] --> src/odd_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn odd_string(words: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/permute.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `permute` is never used [INFO] [stdout] --> src/permute.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sample_stats.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sample_stats` is never used [INFO] [stdout] --> src/sample_stats.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn sample_stats(count: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/shortest_path_binary_matrix.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `shortest_path_binary_matrix` is never used [INFO] [stdout] --> src/shortest_path_binary_matrix.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn shortest_path_binary_matrix(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `OrderedQueue` is never constructed [INFO] [stdout] --> src/stl.rs:6:16 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct OrderedQueue { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/stl.rs:14:16 [INFO] [stdout] | [INFO] [stdout] 10 | / impl OrderedQueue [INFO] [stdout] 11 | | where [INFO] [stdout] 12 | | T: Ord + PartialOrd + Copy, [INFO] [stdout] | |___________________________________- associated items in this implementation [INFO] [stdout] 13 | { [INFO] [stdout] 14 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn push(&mut self, item: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn front(&self) -> Option<&T> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn back(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn pop_front(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn pop_back(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn iter(&self) -> std::collections::vec_deque::Iter { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn remove(&mut self, item: &T) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/sufficient_subset.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/sufficient_subset.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | #[inline] [INFO] [stdout] 12 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sufficient_subset` is never used [INFO] [stdout] --> src/sufficient_subset.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 24 | pub fn sufficient_subset( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/three_sum_closest.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum_closest` is never used [INFO] [stdout] --> src/three_sum_closest.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeAncestor` is never constructed [INFO] [stdout] --> src/tree_ancestor.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct TreeAncestor { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_kth_ancestor` are never used [INFO] [stdout] --> src/tree_ancestor.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl TreeAncestor { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 29 | fn new(n: i32, parent: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn get_kth_ancestor(&self, node: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/unequal_triplets.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unequal_triplets` is never used [INFO] [stdout] --> src/unequal_triplets.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn unequal_triplets(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/vowel_strings.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `vowel_strings` is never used [INFO] [stdout] --> src/vowel_strings.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn vowel_strings(words: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generatePeopleVec` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn generatePeopleVec(scores: Vec, ages: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `generate_people_vec` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getMaxValue` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:41:4 [INFO] [stdout] | [INFO] [stdout] 41 | fn getMaxValue(v: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ help: convert the identifier to snake case: `get_max_value` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `peopleVec` should have a snake case name [INFO] [stdout] --> src/best_team_score.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut peopleVec = generatePeopleVec(scores, ages); [INFO] [stdout] | ^^^^^^^^^ help: convert the identifier to snake case: `people_vec` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `getHead` should have a snake case name [INFO] [stdout] --> src/next_larger_nodes.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn getHead(input: Vec) -> Option> { [INFO] [stdout] | ^^^^^^^ help: convert the identifier to snake case: `get_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/three_sum.rs:35:40 [INFO] [stdout] | [INFO] [stdout] 35 | while right > 0 && right - 1 >= 0 && nums[right] == nums[right - 1] { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 1.39s [INFO] running `Command { std: "docker" "inspect" "73d6ee32acfa4b86ccad626453d6bbbabe4bf265512c7a12fd0c17c7a5bd4dfc", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "73d6ee32acfa4b86ccad626453d6bbbabe4bf265512c7a12fd0c17c7a5bd4dfc", kill_on_drop: false }` [INFO] [stdout] 73d6ee32acfa4b86ccad626453d6bbbabe4bf265512c7a12fd0c17c7a5bd4dfc