[INFO] cloning repository https://github.com/KOHSUK/algorithms_in_rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/KOHSUK/algorithms_in_rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKOHSUK%2Falgorithms_in_rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKOHSUK%2Falgorithms_in_rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 7c9631be179666f56b27d6fb43b95a3d57582746 [INFO] checking KOHSUK/algorithms_in_rust/7c9631be179666f56b27d6fb43b95a3d57582746 against try#4d98531622e1718ae0bc3c7a1ab9cd8938428452+rustflags=-Dtail_expr_drop_order for pr-129604 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKOHSUK%2Falgorithms_in_rust" "/workspace/builds/worker-7-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/KOHSUK/algorithms_in_rust on toolchain 4d98531622e1718ae0bc3c7a1ab9cd8938428452 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/KOHSUK/algorithms_in_rust [INFO] finished tweaking git repo https://github.com/KOHSUK/algorithms_in_rust [INFO] tweaked toml for git repo https://github.com/KOHSUK/algorithms_in_rust written to /workspace/builds/worker-7-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/KOHSUK/algorithms_in_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" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 545d49fde4892137727b9aa9787da53431b627d81ed883a1280b80a508efcaac [INFO] running `Command { std: "docker" "start" "-a" "545d49fde4892137727b9aa9787da53431b627d81ed883a1280b80a508efcaac", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "545d49fde4892137727b9aa9787da53431b627d81ed883a1280b80a508efcaac", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "545d49fde4892137727b9aa9787da53431b627d81ed883a1280b80a508efcaac", kill_on_drop: false }` [INFO] [stdout] 545d49fde4892137727b9aa9787da53431b627d81ed883a1280b80a508efcaac [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 8a693ad252d7d06adc0cbb3109daef5117db6ccd09156eda242e6f1215aa3b73 [INFO] running `Command { std: "docker" "start" "-a" "8a693ad252d7d06adc0cbb3109daef5117db6ccd09156eda242e6f1215aa3b73", kill_on_drop: false }` [INFO] [stderr] Checking learn-algorithms-in-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `fmt::Display` [INFO] [stdout] --> src/algorithms/counting_sort.rs:1:15 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{io, fmt::Display}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `fmt::Display` [INFO] [stdout] --> src/aoj/alds1_6_a.rs:1:15 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{io, fmt::Display}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `fmt::Display` [INFO] [stdout] --> src/algorithms/counting_sort.rs:1:15 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{io, fmt::Display}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `fmt::Display` [INFO] [stdout] --> src/aoj/alds1_6_a.rs:1:15 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{io, fmt::Display}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated method `std::error::Error::description`: use the Display impl or to_string() [INFO] [stdout] --> src/leetcode/modules/tree_node.rs:88:27 [INFO] [stdout] | [INFO] [stdout] 88 | f.write_str(&self.description()) [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated method `std::error::Error::description`: use the Display impl or to_string() [INFO] [stdout] --> src/leetcode/modules/tree_node.rs:88:27 [INFO] [stdout] | [INFO] [stdout] 88 | f.write_str(&self.description()) [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/counting_sort.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | let mut arr: Vec = buf.split_whitespace().map(|x| x.parse().unwrap()).collect(); [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: `u` [INFO] [stdout] --> src/aoj/alds1_11_a.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let u = list.next().unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_u` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/aoj/alds1_6_a.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | let mut arr: Vec = buf.split_whitespace().map(|x| x.parse().unwrap()).collect(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `largest` is never read [INFO] [stdout] --> src/aoj/alds1_9_b.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut largest = 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: unused variable: `i` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | for i in 0..t { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:11:13 [INFO] [stdout] | [INFO] [stdout] 11 | let k: usize = inputs[1].parse().unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `q` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let q: i32 = inputs[2].parse().unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_q` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:13:13 [INFO] [stdout] | [INFO] [stdout] 13 | let a = (1..n+1).map(|x| x as i32).collect::>(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/counting_sort.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | let mut arr: Vec = buf.split_whitespace().map(|x| x.parse().unwrap()).collect(); [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: `u` [INFO] [stdout] --> src/aoj/alds1_11_a.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let u = list.next().unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_u` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | root: Option>>, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `index` [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:8:14 [INFO] [stdout] | [INFO] [stdout] 8 | for (index, char) in s.chars().enumerate() { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_index` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/aoj/alds1_6_a.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | let mut arr: Vec = buf.split_whitespace().map(|x| x.parse().unwrap()).collect(); [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/leetcode/insertion_sort_list.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | let mut ptr = &mut head; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `largest` is never read [INFO] [stdout] --> src/aoj/alds1_9_b.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut largest = 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: unused variable: `i` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | for i in 0..t { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:11:13 [INFO] [stdout] | [INFO] [stdout] 11 | let k: usize = inputs[1].parse().unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `q` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let q: i32 = inputs[2].parse().unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_q` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/codeforces/gym/_102222.rs:13:13 [INFO] [stdout] | [INFO] [stdout] 13 | let a = (1..n+1).map(|x| x as i32).collect::>(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | for k in 0..nums1.len() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/counting_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/algorithms/counting_sort.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn print_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `counting_sort` is never used [INFO] [stdout] --> src/algorithms/counting_sort.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn counting_sort(arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MaxHeap` is never constructed [INFO] [stdout] --> src/algorithms/max_heap.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MaxHeap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `heapify`, `add`, `peek`, and `pop` are never used [INFO] [stdout] --> src/algorithms/max_heap.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl MaxHeap { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 10 | fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn heapify(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add(&mut self, item: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn peek(&self) -> Result { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | fn pop(&mut self) -> Result { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/max_heap.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 86 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_case_1` is never used [INFO] [stdout] --> src/algorithms/max_heap.rs:90:4 [INFO] [stdout] | [INFO] [stdout] 90 | fn test_case_1() { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn quick_sort(arr: &mut[i32]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn partition(arr: &mut[i32]) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn print_arr(arr: &[T]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_gaps` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:17:4 [INFO] [stdout] | [INFO] [stdout] 17 | fn generate_gaps(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shell_sort` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn shell_sort(arr: &mut Vec, gaps: &[usize]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:38:4 [INFO] [stdout] | [INFO] [stdout] 38 | fn insertion_sort(arr: &mut Vec, gap: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn insertion_sort() { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn insert(arr: &mut Vec, i: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_a.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_2_a.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/aoj/alds1_2_a.rs:21:4 [INFO] [stdout] | [INFO] [stdout] 21 | fn bubble_sort(n: usize, arr: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn selection_sort(arr: &mut Vec, n: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `select` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn select(arr: &mut Vec, i: usize) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:37:4 [INFO] [stdout] | [INFO] [stdout] 37 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:17:4 [INFO] [stdout] | [INFO] [stdout] 17 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_usize_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn print_usize_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shell_sort` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn shell_sort(arr: &mut Vec, n: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:48:4 [INFO] [stdout] | [INFO] [stdout] 48 | fn insert(arr: &mut Vec, n: usize, g: usize) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_3_a.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse_polish_notation` is never used [INFO] [stdout] --> src/aoj/alds1_3_a.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn reverse_polish_notation(arr: Vec<&str>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_4_c.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exec` is never used [INFO] [stdout] --> src/aoj/alds1_4_c.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn exec(operator: &str, operand: &str, dict: &mut HashMap) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:15:4 [INFO] [stdout] | [INFO] [stdout] 15 | fn merge_sort(arr: &mut Vec, l: usize, r: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn merge(arr: &mut Vec, l: usize, m: usize, r: usize) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:70:4 [INFO] [stdout] | [INFO] [stdout] 70 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_6_a.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_6_a.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn print_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `counting_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_a.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn counting_sort(arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Card` is never constructed [INFO] [stdout] --> src/aoj/alds1_6_c.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct Card { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Card { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 10 | fn new(suit: String, number: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_cards` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:15:4 [INFO] [stdout] | [INFO] [stdout] 15 | fn print_cards(cards: &[Card], indeces: &[usize]) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn print_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check_if_stable` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn check_if_stable(arr1: &[Card], indeces: &[usize], arr2: &[Card], indeces2: &[usize]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:63:4 [INFO] [stdout] | [INFO] [stdout] 63 | fn quick_sort(arr: &mut Vec, indeces: &mut Vec, low: i32, high: i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:72:4 [INFO] [stdout] | [INFO] [stdout] 72 | fn partition(arr: &mut Vec, indeces: &mut Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:88:4 [INFO] [stdout] | [INFO] [stdout] 88 | fn merge_sort(arr: &mut Vec, indeces: &mut Vec, left: usize, right: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:99:4 [INFO] [stdout] | [INFO] [stdout] 99 | fn merge(arr: &mut Vec, indeces: &mut Vec, left: usize, mid: usize, right: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Card` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:18:6 [INFO] [stdout] | [INFO] [stdout] 18 | type Card = (char, usize); [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn quick_sort(cards: &mut[Card]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn partition(cards: &mut[Card]) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_cards` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:44:4 [INFO] [stdout] | [INFO] [stdout] 44 | fn print_cards(cards: &[Card]) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `left` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn left(i: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn right(i: usize) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_heap` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn build_heap(arr: &mut Vec, h: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_heapify` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:34:4 [INFO] [stdout] | [INFO] [stdout] 34 | fn max_heapify(arr: &mut Vec, i: usize, h: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_9_c.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `PriorityQueue` is never constructed [INFO] [stdout] --> src/aoj/alds1_9_c.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct PriorityQueue { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `extractMax` are never used [INFO] [stdout] --> src/aoj/alds1_9_c.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 29 | impl PriorityQueue { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 30 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn insert(&mut self, x: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn extractMax(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/codeforces/gym/_102222.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/codeforces/gym/_102222.rs:18:4 [INFO] [stdout] | [INFO] [stdout] 18 | fn bubble_sort() { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/_912.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/_912.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sort_array` is never used [INFO] [stdout] --> src/leetcode/_912.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn sort_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/leetcode/_912.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn selection_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shell_sort` is never used [INFO] [stdout] --> src/leetcode/_912.rs:38:4 [INFO] [stdout] | [INFO] [stdout] 38 | fn shell_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.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 functions `solve` and `inorder_traversal` are never used [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec, node: Option<&Rc>>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.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 functions `solve` and `level_order` are never used [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec>, node: Option<&Rc>>, level: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.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 functions `solve` and `postorder_traversal` are never used [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec, node: Option<&Rc>>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.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 functions `solve` and `preorder_traversal` are never used [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec, node: Option<&Rc>>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_inorder_and_postorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_pivot`, `split`, and `build_tree` are never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_inorder_and_postorder_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | fn find_pivot(arr: &[i32], postorder: &mut Vec) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn split(sub_tree: Rc>, arr: &mut Vec, postorder: &mut Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | root: Option>>, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `index` [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:8:14 [INFO] [stdout] | [INFO] [stdout] 8 | for (index, char) in s.chars().enumerate() { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_index` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_inorder_and_postorder_traversal.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_pivot`, `construct`, and `build_tree` are never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn find_pivot(preorder: &mut Vec, subtree: &Vec) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn construct(preorder: &mut Vec, inorder: &mut Vec, root: Rc>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal.rs:68:8 [INFO] [stdout] | [INFO] [stdout] 68 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/contains_duplicate.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_duplicate` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/contains_duplicate_ii.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate_ii.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate_ii.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/design_hash_map.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> src/leetcode/design_hash_map.rs:21:7 [INFO] [stdout] | [INFO] [stdout] 21 | const SIZE: i32 = 100003; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashMap` is never constructed [INFO] [stdout] --> src/leetcode/design_hash_map.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct MyHashMap { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/leetcode/design_hash_map.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl MyHashMap { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 28 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn get(&self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn h1(key: i32) -> i32 { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn h2(key: i32) -> i32 { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn h(key: i32, index: i32) -> usize { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/design_hash_set.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> src/leetcode/design_hash_set.rs:24:7 [INFO] [stdout] | [INFO] [stdout] 24 | const SIZE: usize = 10007; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashSet` is never constructed [INFO] [stdout] --> src/leetcode/design_hash_set.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct MyHashSet { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/leetcode/design_hash_set.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 32 | impl MyHashSet { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 33 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn add(&mut self, key: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn contains(&self, key: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn h1(key: i32) -> usize { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn h2(key: i32) -> usize { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn h(key: i32, i: i32) -> usize { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.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/leetcode/find_duplicate_subtrees.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_duplicate_subtrees` is never used [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn find_duplicate_subtrees( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `first_uniq_char` is never used [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn first_uniq_char(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/four_sum_ii.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `four_sum_count` is never used [INFO] [stdout] --> src/leetcode/four_sum_ii.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn four_sum_count( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/four_sum_ii.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/group_anagrams.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_sorted_key` is never used [INFO] [stdout] --> src/leetcode/group_anagrams.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn get_sorted_key(key: &str) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/leetcode/group_anagrams.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 13 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/group_anagrams.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/happy_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/leetcode/happy_number.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32], res: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_happy` is never used [INFO] [stdout] --> src/leetcode/happy_number.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/happy_number.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `run` and `insertion_sort_list` are never used [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 29 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersection` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn intersection(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays_ii.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersect` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays_ii.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn intersect(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays_ii.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/isomorphic_strings.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/leetcode/isomorphic_strings.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/isomorphic_strings.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/jewels_and_stones.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_jewels_in_stones` is never used [INFO] [stdout] --> src/leetcode/jewels_and_stones.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/jewels_and_stones.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/longest_substring_without_repeating_characters.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/leetcode/longest_substring_without_repeating_characters.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/longest_substring_without_repeating_characters.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/lowest_common_ancestor_of_a_binary_tree.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `solve` and `lowest_common_ancestor` are never used [INFO] [stdout] --> src/leetcode/lowest_common_ancestor_of_a_binary_tree.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn solve( [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | let mut ptr = &mut head; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/lowest_common_ancestor_of_a_binary_tree.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.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 functions `solve` and `max_depth` are never used [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(node: Option<&Rc>>) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n:i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_list` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn print_list(list: &Option>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 45 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | #[inline] [INFO] [stdout] 47 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `from_vec` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | fn from_vec(v: Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 69 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 70 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/minimum_index_sum_of_two_lists.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_restaurant` is never used [INFO] [stdout] --> src/leetcode/minimum_index_sum_of_two_lists.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn find_restaurant(list1: Vec, list2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/minimum_index_sum_of_two_lists.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/path_sum.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_leaf`, `solve`, and `has_path_sum` are never used [INFO] [stdout] --> src/leetcode/path_sum.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | // to be honest, want to add this to the TreeNode impl. [INFO] [stdout] 8 | fn is_leaf(node: &Rc>) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn solve(node: Option<&Rc>>, target_sum: i32, current_sum: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/path_sum.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/single_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `single_number` is never used [INFO] [stdout] --> src/leetcode/single_number.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/single_number.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/symmetric_tree.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/symmetric_tree.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 functions `stack_sub_tree`, `check_sub_tree`, and `is_symmetric` are never used [INFO] [stdout] --> src/leetcode/symmetric_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn stack_sub_tree(node: Option<&Rc>>, stack: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn check_sub_tree(node: Option<&Rc>>, stack: &mut Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/symmetric_tree.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Item` is never constructed [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Item { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `top_k_frequent` is never used [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/two_sum.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/leetcode/two_sum.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `main` is never used [INFO] [stdout] --> src/leetcode/two_sum.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn main() { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/valid_sudoku.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `validate` and `is_valid_sudoku` are never used [INFO] [stdout] --> src/leetcode/valid_sudoku.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | fn validate(board: &Vec>, positions: [(usize, usize); 9]) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/valid_sudoku.rs:81:8 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `extractMax` should have a snake case name [INFO] [stdout] --> src/aoj/alds1_9_c.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | fn extractMax(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: convert the identifier to snake case: `extract_max` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 7 | let mut hash_set = HashSet::new(); [INFO] [stdout] | -------- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 11 | let mut result = HashSet::new(); [INFO] [stdout] | ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 17 | result.into_iter().collect::>() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] = note: requested on the command line with `-D tail-expr-drop-order` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:108:14 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ---------------------------- ---------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] | | [INFO] [stdout] | these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 75 | let mut list1 = list1; [INFO] [stdout] | ----- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] 76 | let mut list2 = list2; [INFO] [stdout] | ----- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 108 | Some(Box::new(ListNode::from_vec(new_arr))) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | for k in 0..nums1.len() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 2 previous errors; 204 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] error: could not compile `learn-algorithms-in-rust` (bin "learn-algorithms-in-rust") due to 3 previous errors; 204 warnings emitted [INFO] [stderr] warning: build failed, waiting for other jobs to finish... [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/counting_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/algorithms/counting_sort.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn print_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `counting_sort` is never used [INFO] [stdout] --> src/algorithms/counting_sort.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn counting_sort(arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MaxHeap` is never constructed [INFO] [stdout] --> src/algorithms/max_heap.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MaxHeap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `heapify`, `add`, `peek`, and `pop` are never used [INFO] [stdout] --> src/algorithms/max_heap.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl MaxHeap { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 10 | fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn heapify(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add(&mut self, item: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn peek(&self) -> Result { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | fn pop(&mut self) -> Result { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/max_heap.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 86 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_case_1` is never used [INFO] [stdout] --> src/algorithms/max_heap.rs:90:4 [INFO] [stdout] | [INFO] [stdout] 90 | fn test_case_1() { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn quick_sort(arr: &mut[i32]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/algorithms/quick_sort.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn partition(arr: &mut[i32]) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn print_arr(arr: &[T]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_gaps` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:17:4 [INFO] [stdout] | [INFO] [stdout] 17 | fn generate_gaps(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shell_sort` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn shell_sort(arr: &mut Vec, gaps: &[usize]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/algorithms/shell_sort.rs:38:4 [INFO] [stdout] | [INFO] [stdout] 38 | fn insertion_sort(arr: &mut Vec, gap: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn insertion_sort() { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/aoj/alds1_1_a.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn insert(arr: &mut Vec, i: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_a.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_2_a.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/aoj/alds1_2_a.rs:21:4 [INFO] [stdout] | [INFO] [stdout] 21 | fn bubble_sort(n: usize, arr: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn selection_sort(arr: &mut Vec, n: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `select` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn select(arr: &mut Vec, i: usize) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_b.rs:37:4 [INFO] [stdout] | [INFO] [stdout] 37 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:17:4 [INFO] [stdout] | [INFO] [stdout] 17 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_usize_arr` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn print_usize_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shell_sort` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn shell_sort(arr: &mut Vec, n: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/aoj/alds1_2_d.rs:48:4 [INFO] [stdout] | [INFO] [stdout] 48 | fn insert(arr: &mut Vec, n: usize, g: usize) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_3_a.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse_polish_notation` is never used [INFO] [stdout] --> src/aoj/alds1_3_a.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn reverse_polish_notation(arr: Vec<&str>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_4_c.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exec` is never used [INFO] [stdout] --> src/aoj/alds1_4_c.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn exec(operator: &str, operand: &str, dict: &mut HashMap) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:15:4 [INFO] [stdout] | [INFO] [stdout] 15 | fn merge_sort(arr: &mut Vec, l: usize, r: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:32:4 [INFO] [stdout] | [INFO] [stdout] 32 | fn merge(arr: &mut Vec, l: usize, m: usize, r: usize) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_5_b.rs:70:4 [INFO] [stdout] | [INFO] [stdout] 70 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_6_a.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_6_a.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn print_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `counting_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_a.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn counting_sort(arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Card` is never constructed [INFO] [stdout] --> src/aoj/alds1_6_c.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct Card { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Card { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 10 | fn new(suit: String, number: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_cards` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:15:4 [INFO] [stdout] | [INFO] [stdout] 15 | fn print_cards(cards: &[Card], indeces: &[usize]) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn print_arr(arr: &[usize]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check_if_stable` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn check_if_stable(arr1: &[Card], indeces: &[usize], arr2: &[Card], indeces2: &[usize]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:63:4 [INFO] [stdout] | [INFO] [stdout] 63 | fn quick_sort(arr: &mut Vec, indeces: &mut Vec, low: i32, high: i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:72:4 [INFO] [stdout] | [INFO] [stdout] 72 | fn partition(arr: &mut Vec, indeces: &mut Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:88:4 [INFO] [stdout] | [INFO] [stdout] 88 | fn merge_sort(arr: &mut Vec, indeces: &mut Vec, left: usize, right: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/aoj/alds1_6_c.rs:99:4 [INFO] [stdout] | [INFO] [stdout] 99 | fn merge(arr: &mut Vec, indeces: &mut Vec, left: usize, mid: usize, right: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Card` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:18:6 [INFO] [stdout] | [INFO] [stdout] 18 | type Card = (char, usize); [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn quick_sort(cards: &mut[Card]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn partition(cards: &mut[Card]) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_cards` is never used [INFO] [stdout] --> src/aoj/alds1_6_c_solution.rs:44:4 [INFO] [stdout] | [INFO] [stdout] 44 | fn print_cards(cards: &[Card]) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `left` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn left(i: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn right(i: usize) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_heap` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn build_heap(arr: &mut Vec, h: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_heapify` is never used [INFO] [stdout] --> src/aoj/alds1_9_b.rs:34:4 [INFO] [stdout] | [INFO] [stdout] 34 | fn max_heapify(arr: &mut Vec, i: usize, h: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/aoj/alds1_9_c.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `PriorityQueue` is never constructed [INFO] [stdout] --> src/aoj/alds1_9_c.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct PriorityQueue { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `extractMax` are never used [INFO] [stdout] --> src/aoj/alds1_9_c.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 29 | impl PriorityQueue { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 30 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn insert(&mut self, x: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn extractMax(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/codeforces/gym/_102222.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/codeforces/gym/_102222.rs:18:4 [INFO] [stdout] | [INFO] [stdout] 18 | fn bubble_sort() { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/_912.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/_912.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sort_array` is never used [INFO] [stdout] --> src/leetcode/_912.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn sort_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/leetcode/_912.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn selection_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shell_sort` is never used [INFO] [stdout] --> src/leetcode/_912.rs:38:4 [INFO] [stdout] | [INFO] [stdout] 38 | fn shell_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.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 functions `solve` and `inorder_traversal` are never used [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec, node: Option<&Rc>>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_inorder_traversal.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.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 functions `solve` and `level_order` are never used [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec>, node: Option<&Rc>>, level: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_level_order_traversal.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.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 functions `solve` and `postorder_traversal` are never used [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec, node: Option<&Rc>>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_postorder_traversal.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.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 functions `solve` and `preorder_traversal` are never used [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(arr: &mut Vec, node: Option<&Rc>>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/binary_tree_preorder_traversal.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_inorder_and_postorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_pivot`, `split`, and `build_tree` are never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_inorder_and_postorder_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | fn find_pivot(arr: &[i32], postorder: &mut Vec) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn split(sub_tree: Rc>, arr: &mut Vec, postorder: &mut Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_inorder_and_postorder_traversal.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_pivot`, `construct`, and `build_tree` are never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn find_pivot(preorder: &mut Vec, subtree: &Vec) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn construct(preorder: &mut Vec, inorder: &mut Vec, root: Rc>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal.rs:68:8 [INFO] [stdout] | [INFO] [stdout] 68 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/contains_duplicate.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_duplicate` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/contains_duplicate_ii.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate_ii.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/contains_duplicate_ii.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/design_hash_map.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> src/leetcode/design_hash_map.rs:21:7 [INFO] [stdout] | [INFO] [stdout] 21 | const SIZE: i32 = 100003; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashMap` is never constructed [INFO] [stdout] --> src/leetcode/design_hash_map.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct MyHashMap { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/leetcode/design_hash_map.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl MyHashMap { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 28 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn get(&self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn h1(key: i32) -> i32 { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn h2(key: i32) -> i32 { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn h(key: i32, index: i32) -> usize { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/design_hash_set.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> src/leetcode/design_hash_set.rs:24:7 [INFO] [stdout] | [INFO] [stdout] 24 | const SIZE: usize = 10007; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashSet` is never constructed [INFO] [stdout] --> src/leetcode/design_hash_set.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct MyHashSet { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/leetcode/design_hash_set.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 32 | impl MyHashSet { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 33 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn add(&mut self, key: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn contains(&self, key: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn h1(key: i32) -> usize { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn h2(key: i32) -> usize { [INFO] [stdout] | ^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn h(key: i32, i: i32) -> usize { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.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/leetcode/find_duplicate_subtrees.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_duplicate_subtrees` is never used [INFO] [stdout] --> src/leetcode/find_duplicate_subtrees.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn find_duplicate_subtrees( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `first_uniq_char` is never used [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn first_uniq_char(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/first_unique_character_in_a_string.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/four_sum_ii.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `four_sum_count` is never used [INFO] [stdout] --> src/leetcode/four_sum_ii.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn four_sum_count( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/four_sum_ii.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/group_anagrams.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_sorted_key` is never used [INFO] [stdout] --> src/leetcode/group_anagrams.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn get_sorted_key(key: &str) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/leetcode/group_anagrams.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 13 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/group_anagrams.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/happy_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/leetcode/happy_number.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32], res: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_happy` is never used [INFO] [stdout] --> src/leetcode/happy_number.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/happy_number.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `run` and `insertion_sort_list` are never used [INFO] [stdout] --> src/leetcode/insertion_sort_list.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 29 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersection` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn intersection(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays_ii.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersect` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays_ii.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn intersect(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays_ii.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/isomorphic_strings.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/leetcode/isomorphic_strings.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/isomorphic_strings.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/jewels_and_stones.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_jewels_in_stones` is never used [INFO] [stdout] --> src/leetcode/jewels_and_stones.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/jewels_and_stones.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/longest_substring_without_repeating_characters.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/leetcode/longest_substring_without_repeating_characters.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/longest_substring_without_repeating_characters.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/lowest_common_ancestor_of_a_binary_tree.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `solve` and `lowest_common_ancestor` are never used [INFO] [stdout] --> src/leetcode/lowest_common_ancestor_of_a_binary_tree.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn solve( [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/lowest_common_ancestor_of_a_binary_tree.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.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 functions `solve` and `max_depth` are never used [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn solve(node: Option<&Rc>>) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/maximum_depth_of_binary_tree.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_arr` is never used [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn print_arr(arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/leetcode/merge_sorted_array.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n:i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_list` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn print_list(list: &Option>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 45 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | #[inline] [INFO] [stdout] 47 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `from_vec` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | fn from_vec(v: Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 69 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 70 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/minimum_index_sum_of_two_lists.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_restaurant` is never used [INFO] [stdout] --> src/leetcode/minimum_index_sum_of_two_lists.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn find_restaurant(list1: Vec, list2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/minimum_index_sum_of_two_lists.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/path_sum.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_leaf`, `solve`, and `has_path_sum` are never used [INFO] [stdout] --> src/leetcode/path_sum.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | // to be honest, want to add this to the TreeNode impl. [INFO] [stdout] 8 | fn is_leaf(node: &Rc>) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn solve(node: Option<&Rc>>, target_sum: i32, current_sum: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/path_sum.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/single_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `single_number` is never used [INFO] [stdout] --> src/leetcode/single_number.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/single_number.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/symmetric_tree.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode/symmetric_tree.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 functions `stack_sub_tree`, `check_sub_tree`, and `is_symmetric` are never used [INFO] [stdout] --> src/leetcode/symmetric_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | fn stack_sub_tree(node: Option<&Rc>>, stack: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn check_sub_tree(node: Option<&Rc>>, stack: &mut Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/symmetric_tree.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Item` is never constructed [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Item { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `top_k_frequent` is never used [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/top_k_frequent_elements.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/two_sum.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/leetcode/two_sum.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `main` is never used [INFO] [stdout] --> src/leetcode/two_sum.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn main() { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/leetcode/valid_sudoku.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `validate` and `is_valid_sudoku` are never used [INFO] [stdout] --> src/leetcode/valid_sudoku.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | fn validate(board: &Vec>, positions: [(usize, usize); 9]) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run` is never used [INFO] [stdout] --> src/leetcode/valid_sudoku.rs:81:8 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn run() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `extractMax` should have a snake case name [INFO] [stdout] --> src/aoj/alds1_9_c.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | fn extractMax(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: convert the identifier to snake case: `extract_max` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/leetcode/intersection_of_two_arrays.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 7 | let mut hash_set = HashSet::new(); [INFO] [stdout] | -------- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 11 | let mut result = HashSet::new(); [INFO] [stdout] | ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 17 | result.into_iter().collect::>() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] = note: requested on the command line with `-D tail-expr-drop-order` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/leetcode/merge_two_sorted_lists.rs:108:14 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ---------------------------- ---------------------------- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] | | [INFO] [stdout] | these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 75 | let mut list1 = list1; [INFO] [stdout] | ----- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] 76 | let mut list2 = list2; [INFO] [stdout] | ----- these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 108 | Some(Box::new(ListNode::from_vec(new_arr))) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 2 previous errors; 204 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] error: could not compile `learn-algorithms-in-rust` (bin "learn-algorithms-in-rust" test) due to 3 previous errors; 204 warnings emitted [INFO] running `Command { std: "docker" "inspect" "8a693ad252d7d06adc0cbb3109daef5117db6ccd09156eda242e6f1215aa3b73", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8a693ad252d7d06adc0cbb3109daef5117db6ccd09156eda242e6f1215aa3b73", kill_on_drop: false }` [INFO] [stdout] 8a693ad252d7d06adc0cbb3109daef5117db6ccd09156eda242e6f1215aa3b73