[INFO] cloning repository https://github.com/Yogaflre/leetcode [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Yogaflre/leetcode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYogaflre%2Fleetcode", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYogaflre%2Fleetcode'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 46bc713f7e471d5b2a48e923c9526e08bd9c6309 [INFO] checking Yogaflre/leetcode against master#9fa580b1175018b0a276b0bc68f9827a106f7260 for pr-82565 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYogaflre%2Fleetcode" "/workspace/builds/worker-10/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-10/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Yogaflre/leetcode on toolchain 9fa580b1175018b0a276b0bc68f9827a106f7260 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+9fa580b1175018b0a276b0bc68f9827a106f7260" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/Yogaflre/leetcode [INFO] finished tweaking git repo https://github.com/Yogaflre/leetcode [INFO] tweaked toml for git repo https://github.com/Yogaflre/leetcode written to /workspace/builds/worker-10/source/Cargo.toml [INFO] crate git repo https://github.com/Yogaflre/leetcode already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+9fa580b1175018b0a276b0bc68f9827a106f7260" "fetch" "--locked" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-10/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-10/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" "rustops/crates-build-env@sha256:f2f6bcd4b43ebee4e173f653a26493129bdb64017c85f916b780ca7fbdbaa79d" "/opt/rustwide/cargo-home/bin/cargo" "+9fa580b1175018b0a276b0bc68f9827a106f7260" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] df59e20424c802109d57f03ed6d8a3ffeeedd66eb1cb9e370b9faf02f38e8a73 [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "df59e20424c802109d57f03ed6d8a3ffeeedd66eb1cb9e370b9faf02f38e8a73", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "df59e20424c802109d57f03ed6d8a3ffeeedd66eb1cb9e370b9faf02f38e8a73", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "df59e20424c802109d57f03ed6d8a3ffeeedd66eb1cb9e370b9faf02f38e8a73", kill_on_drop: false }` [INFO] [stdout] df59e20424c802109d57f03ed6d8a3ffeeedd66eb1cb9e370b9faf02f38e8a73 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-10/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-10/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:f2f6bcd4b43ebee4e173f653a26493129bdb64017c85f916b780ca7fbdbaa79d" "/opt/rustwide/cargo-home/bin/cargo" "+9fa580b1175018b0a276b0bc68f9827a106f7260" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 65b766882c2453dd67fb42ff0ac40c2db9d4f4aeeb221e4962ee8eaf6fecf1bc [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "65b766882c2453dd67fb42ff0ac40c2db9d4f4aeeb221e4962ee8eaf6fecf1bc", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.81 [INFO] [stderr] Compiling getrandom v0.1.15 [INFO] [stderr] Checking cfg-if v0.1.10 [INFO] [stderr] Checking ppv-lite86 v0.2.10 [INFO] [stderr] Checking rand_core v0.5.1 [INFO] [stderr] Checking rand_chacha v0.2.2 [INFO] [stderr] Checking rand v0.7.3 [INFO] [stderr] Checking leetcode v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/base/list_node.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/greedy/queue_reconstruction_by_height.rs:30:9 [INFO] [stdout] | [INFO] [stdout] 30 | / /** [INFO] [stdout] 31 | | * [[7,0],[7,1],[6,1],[5,0],[5,2],[4,4]] [7,0]插入0 [INFO] [stdout] 32 | | * [[7,0],[7,1],[6,1],[5,0],[5,2],[4,4]] [7,1]插入1 [INFO] [stdout] 33 | | * [[7,0],[6,1],[7,1],[5,0],[5,2],[4,4]] [6,1]插入1 [INFO] [stdout] ... | [INFO] [stdout] 36 | | * [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]] [4,4]插入4 [INFO] [stdout] 37 | | */ [INFO] [stdout] | |___________^ [INFO] [stdout] 38 | / for p in people { [INFO] [stdout] 39 | | res.insert(p[1] as usize, p); [INFO] [stdout] 40 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_doc_comments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/medium/merge_intervals.rs:17:5 [INFO] [stdout] | [INFO] [stdout] 17 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:30:23 [INFO] [stdout] | [INFO] [stdout] 30 | let mid = ((l + r) / 2); [INFO] [stdout] | ^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:75:15 [INFO] [stdout] | [INFO] [stdout] 75 | while (index < p_path.len() && index < q_path.len() && p_path[index] == q_path[index]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/base/list_node.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/greedy/queue_reconstruction_by_height.rs:30:9 [INFO] [stdout] | [INFO] [stdout] 30 | / /** [INFO] [stdout] 31 | | * [[7,0],[7,1],[6,1],[5,0],[5,2],[4,4]] [7,0]插入0 [INFO] [stdout] 32 | | * [[7,0],[7,1],[6,1],[5,0],[5,2],[4,4]] [7,1]插入1 [INFO] [stdout] 33 | | * [[7,0],[6,1],[7,1],[5,0],[5,2],[4,4]] [6,1]插入1 [INFO] [stdout] ... | [INFO] [stdout] 36 | | * [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]] [4,4]插入4 [INFO] [stdout] 37 | | */ [INFO] [stdout] | |___________^ [INFO] [stdout] 38 | / for p in people { [INFO] [stdout] 39 | | res.insert(p[1] as usize, p); [INFO] [stdout] 40 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_doc_comments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/medium/merge_intervals.rs:17:5 [INFO] [stdout] | [INFO] [stdout] 17 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:30:23 [INFO] [stdout] | [INFO] [stdout] 30 | let mid = ((l + r) / 2); [INFO] [stdout] | ^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:75:15 [INFO] [stdout] | [INFO] [stdout] 75 | while (index < p_path.len() && index < q_path.len() && p_path[index] == q_path[index]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `matrix` [INFO] [stdout] --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:39 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn kth_smallest_binary_search(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:62 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn kth_smallest_binary_search(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/base/bit_map.rs:76:23 [INFO] [stdout] | [INFO] [stdout] 76 | fn set(&mut self, n: usize) {} [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/base/bit_map.rs:78:19 [INFO] [stdout] | [INFO] [stdout] 78 | fn get(&self, n: usize) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/base/heap.rs:112:13 [INFO] [stdout] | [INFO] [stdout] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/base/heap.rs:112:29 [INFO] [stdout] | [INFO] [stdout] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/base/heap.rs:117:17 [INFO] [stdout] | [INFO] [stdout] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `mains` [INFO] [stdout] --> src/base/matchs.rs:107:16 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_mains` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `aims` [INFO] [stdout] --> src/base/matchs.rs:107:35 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_aims` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/base/matchs.rs:107:53 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/base/matchs.rs:107:63 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/base/matchs.rs:118:8 [INFO] [stdout] | [INFO] [stdout] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `b` [INFO] [stdout] --> src/base/matchs.rs:118:17 [INFO] [stdout] | [INFO] [stdout] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nodes` [INFO] [stdout] --> src/base/tree_node.rs:32:19 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nodes` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/bit/reverse_bits.rs:29:13 [INFO] [stdout] | [INFO] [stdout] 29 | for i in 0..32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `graph` [INFO] [stdout] --> src/graph/is_graph_bipartite.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn is_bipartite(graph: Vec>) -> bool { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `heights` [INFO] [stdout] --> src/hard/largest_rectangle_in_histogram.rs:18:35 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn largest_rectangle_area(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_heights` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `l` is never read [INFO] [stdout] --> src/hard/maximal_rectangle.rs:51:13 [INFO] [stdout] | [INFO] [stdout] 51 | let mut l = i; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tmp` [INFO] [stdout] --> src/hard/maximal_rectangle.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut tmp = j; [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_tmp` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/hash/longest_harmonious_subsequence.rs:41:17 [INFO] [stdout] | [INFO] [stdout] 41 | for (k, v) in map.iter() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `metrix` [INFO] [stdout] --> src/medium/course_schedule.rs:75:13 [INFO] [stdout] | [INFO] [stdout] 75 | let metrix: Vec> = vec![vec![0; num_courses as usize]; num_courses as usize]; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_metrix` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `prerequisites` [INFO] [stdout] --> src/medium/course_schedule.rs:73:42 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn can_finish2(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_prerequisites` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `str` [INFO] [stdout] --> src/medium/string_to_integer_atoi.rs:42:20 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn my_atoi(str: String) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_str` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/tree/house_robber_iii.rs:73:21 [INFO] [stdout] | [INFO] [stdout] 73 | let a = node.borrow(); [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/base/binary.rs:6:18 [INFO] [stdout] | [INFO] [stdout] 6 | fn num_to_binary(mut num: i8) -> String { [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: cannot borrow `count_table` as mutable because it is also borrowed as immutable [INFO] [stdout] --> src/base/huffman_coding.rs:12:24 [INFO] [stdout] | [INFO] [stdout] 11 | match count_table.get(&i) { [INFO] [stdout] | ----------- immutable borrow occurs here [INFO] [stdout] 12 | Some(n) => count_table.insert(i, n + 1), [INFO] [stdout] | ^^^^^^^^^^^ - immutable borrow later used here [INFO] [stdout] | | [INFO] [stdout] | mutable borrow occurs here [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mutable_borrow_reservation_conflict)]` on by default [INFO] [stdout] = warning: this borrowing pattern was not meant to be accepted, and may become a hard error in the future [INFO] [stdout] = note: for more information, see issue #59159 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/base/list_node.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut pre = &root; [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/base/sort_algo.rs:87:10 [INFO] [stdout] | [INFO] [stdout] 87 | fn merge(mut nums: Vec) -> Vec { [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/hard/maximal_rectangle.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut tmp = j; [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/hard/regular_expression_matching.rs:58:27 [INFO] [stdout] | [INFO] [stdout] 58 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [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/hard/regular_expression_matching.rs:58:54 [INFO] [stdout] | [INFO] [stdout] 58 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [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/linked_list/reverse_linked_list.rs:21:9 [INFO] [stdout] | [INFO] [stdout] 21 | mut pre: Option>, [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/array_nesting.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `array_nesting` [INFO] [stdout] --> src/array/array_nesting.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn array_nesting(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/beautiful_arrangement_ii.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `construct_array` [INFO] [stdout] --> src/array/beautiful_arrangement_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn construct_array(n: i32, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/degree_of_an_array.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_shortest_sub_array` [INFO] [stdout] --> src/array/degree_of_an_array.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn find_shortest_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/find_the_duplicate_number.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_duplicate` [INFO] [stdout] --> src/array/find_the_duplicate_number.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn find_duplicate(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest_binary_search` [INFO] [stdout] --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn kth_smallest_binary_search(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest_heap` [INFO] [stdout] --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn kth_smallest_heap(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/max_chunks_to_make_sorted.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_chunks_to_sorted` [INFO] [stdout] --> src/array/max_chunks_to_make_sorted.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn max_chunks_to_sorted(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/max_consecutive_ones.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_max_consecutive_ones` [INFO] [stdout] --> src/array/max_consecutive_ones.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn find_max_consecutive_ones(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/reshape_the_matrix.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `matrix_reshape` [INFO] [stdout] --> src/array/reshape_the_matrix.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn matrix_reshape(nums: Vec>, r: i32, c: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/search_a_2d_matrix_ii.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_matrix` [INFO] [stdout] --> src/array/search_a_2d_matrix_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_matrix2` [INFO] [stdout] --> src/array/search_a_2d_matrix_ii.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn search_matrix2(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/set_mismatch.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_error_nums` [INFO] [stdout] --> src/array/set_mismatch.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn find_error_nums(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_error_nums_sort` [INFO] [stdout] --> src/array/set_mismatch.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn find_error_nums_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/array/toeplitz_matrix.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_toeplitz_matrix` [INFO] [stdout] --> src/array/toeplitz_matrix.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn is_toeplitz_matrix(matrix: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/backtracking/generate_parentheses.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate_parenthesis` [INFO] [stdout] --> src/backtracking/generate_parentheses.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate` [INFO] [stdout] --> src/backtracking/generate_parentheses.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | fn generate(result: &mut Vec, temp: String, l: i32, r: i32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/backtracking/permutations.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `permute2` [INFO] [stdout] --> src/backtracking/permutations.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn permute2(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/backtracking/permutations.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn recursive(result: &mut Vec>, nums: Vec, tmp: Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `eight_queen` [INFO] [stdout] --> src/base/backtracking.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn eight_queen() -> [usize; 8] { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `put` [INFO] [stdout] --> src/base/backtracking.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn put(row: usize, board: &mut [usize; 8]) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `is_ok` [INFO] [stdout] --> src/base/backtracking.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn is_ok(board: &[usize; 8], row: usize, column: usize) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `zero_one_package` [INFO] [stdout] --> src/base/backtracking.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn zero_one_package(items: &[i32], capacity: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rmatch` [INFO] [stdout] --> src/base/backtracking.rs:68:4 [INFO] [stdout] | [INFO] [stdout] 68 | fn rmatch(a: String, b: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rmatch_recursive` [INFO] [stdout] --> src/base/backtracking.rs:76:4 [INFO] [stdout] | [INFO] [stdout] 76 | fn rmatch_recursive(a: &[char], ai: usize, b: &[char], bi: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `num_to_binary` [INFO] [stdout] --> src/base/binary.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn num_to_binary(mut num: i8) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_to_num` [INFO] [stdout] --> src/base/binary.rs:25:4 [INFO] [stdout] | [INFO] [stdout] 25 | fn binary_to_num(binary: String) -> i8 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `loop_search` [INFO] [stdout] --> src/base/binary_search.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn loop_search(nums: &Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `recursive_search` [INFO] [stdout] --> src/base/binary_search.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn recursive_search(nums: &Vec, target: i32, left: usize, right: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_first` [INFO] [stdout] --> src/base/binary_search.rs:35:4 [INFO] [stdout] | [INFO] [stdout] 35 | fn find_first(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_end` [INFO] [stdout] --> src/base/binary_search.rs:60:4 [INFO] [stdout] | [INFO] [stdout] 60 | fn find_end(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_first_bigger` [INFO] [stdout] --> src/base/binary_search.rs:85:4 [INFO] [stdout] | [INFO] [stdout] 85 | fn find_first_bigger(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_last_smaller` [INFO] [stdout] --> src/base/binary_search.rs:107:4 [INFO] [stdout] | [INFO] [stdout] 107 | fn find_last_smaller(nums: &Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/bit_map.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn new(nbits: usize) -> BitMap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set` [INFO] [stdout] --> src/base/bit_map.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | fn set(&mut self, n: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/base/bit_map.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | fn get(&self, n: usize) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/bit_map.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn new(nbits: usize) -> BloomFilter { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set` [INFO] [stdout] --> src/base/bit_map.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn set(&mut self, n: usize) {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/base/bit_map.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn get(&self, n: usize) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/consistant_hash.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn create(nodes: Vec, replica: u8) -> ConsistantHash { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `hash_virtual` [INFO] [stdout] --> src/base/consistant_hash.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn hash_virtual(key: &String) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_first_node` [INFO] [stdout] --> src/base/consistant_hash.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn find_first_node(&mut self, key: &String) -> &mut Node { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_first_node_by_index` [INFO] [stdout] --> src/base/consistant_hash.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn find_first_node_by_index(&mut self, index: u64) -> &mut Node { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add` [INFO] [stdout] --> src/base/consistant_hash.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 86 | fn add(&mut self, k: String, v: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete` [INFO] [stdout] --> src/base/consistant_hash.rs:94:8 [INFO] [stdout] | [INFO] [stdout] 94 | fn delete(&mut self, k: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_node` [INFO] [stdout] --> src/base/consistant_hash.rs:102:8 [INFO] [stdout] | [INFO] [stdout] 102 | fn add_node(&mut self, address: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_node` [INFO] [stdout] --> src/base/consistant_hash.rs:120:8 [INFO] [stdout] | [INFO] [stdout] 120 | fn delete_node(&mut self, address: String) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/graph.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn create(n: usize) -> Graph { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `addEdge` [INFO] [stdout] --> src/base/graph.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn addEdge(&mut self, i: usize, j: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `bfs` [INFO] [stdout] --> src/base/graph.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn bfs(&self, i: usize, j: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/base/graph.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn dfs(&self, i: usize, j: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs_recursive` [INFO] [stdout] --> src/base/graph.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn dfs_recursive(&self, i: usize, j: usize, items: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `distribute_candy` [INFO] [stdout] --> src/base/greedy.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn distribute_candy(mut candies: i32, mut children: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_disjoint_area` [INFO] [stdout] --> src/base/greedy.rs:25:4 [INFO] [stdout] | [INFO] [stdout] 25 | fn find_disjoint_area(mut areas: Vec<(i32, i32)>) -> Vec<(i32, i32)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `remove_num` [INFO] [stdout] --> src/base/greedy.rs:47:4 [INFO] [stdout] | [INFO] [stdout] 47 | fn remove_num(num: u32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `heapify` [INFO] [stdout] --> src/base/heap.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn heapify(nums: &mut Vec, mut index: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/heap.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | fn create(mut nums: Vec) -> Heap { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/base/heap.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn insert(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_max` [INFO] [stdout] --> src/base/heap.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn remove_max(&mut self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sort` [INFO] [stdout] --> src/base/heap.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn sort(&mut self) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `topN` [INFO] [stdout] --> src/base/heap.rs:112:8 [INFO] [stdout] | [INFO] [stdout] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_mid` [INFO] [stdout] --> src/base/heap.rs:117:8 [INFO] [stdout] | [INFO] [stdout] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `huffman_coding` [INFO] [stdout] --> src/base/huffman_coding.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn huffman_coding(text: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `default` [INFO] [stdout] --> src/base/java_map.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn default() -> JavaMap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/java_map.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn new(capacity: u64) -> JavaMap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/base/java_map.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn size(&self) -> u64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `init_capacity` [INFO] [stdout] --> src/base/java_map.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | fn init_capacity(capacity: u64) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_threshold` [INFO] [stdout] --> src/base/java_map.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn get_threshold(capacity: u64, load_factor: f32) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_index` [INFO] [stdout] --> src/base/java_map.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | fn get_index(k: &K, capacity: u64) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/base/java_map.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | fn get(&mut self, k: K) -> Option<&V> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/base/java_map.rs:94:8 [INFO] [stdout] | [INFO] [stdout] 94 | fn put(&mut self, k: K, v: V) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `resize` [INFO] [stdout] --> src/base/java_map.rs:120:8 [INFO] [stdout] | [INFO] [stdout] 120 | fn resize(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove` [INFO] [stdout] --> src/base/java_map.rs:133:8 [INFO] [stdout] | [INFO] [stdout] 133 | fn remove(&mut self, k: K) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `JumpTable` [INFO] [stdout] --> src/base/jump_table.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct JumpTable {} [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/list_node.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/list_node.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn create(nums: Vec) -> Option> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/list_node.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/list_node.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn create(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bp` [INFO] [stdout] --> src/base/matchs.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn bp(main: &str, aim: &str) -> bool { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rk` [INFO] [stdout] --> src/base/matchs.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn rk(main: &str, aim: &str) -> bool { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `hash` [INFO] [stdout] --> src/base/matchs.rs:49:4 [INFO] [stdout] | [INFO] [stdout] 49 | fn hash(text: &str, dict: &HashMap) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bm` [INFO] [stdout] --> src/base/matchs.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn bm(a: &str, b: &str) -> bool { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bad_char` [INFO] [stdout] --> src/base/matchs.rs:92:4 [INFO] [stdout] | [INFO] [stdout] 92 | fn bad_char(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `good_suffix` [INFO] [stdout] --> src/base/matchs.rs:107:4 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kmp` [INFO] [stdout] --> src/base/matchs.rs:118:4 [INFO] [stdout] | [INFO] [stdout] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bubble` [INFO] [stdout] --> src/base/sort_algo.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn bubble(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `insert` [INFO] [stdout] --> src/base/sort_algo.rs:25:4 [INFO] [stdout] | [INFO] [stdout] 25 | fn insert(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `select` [INFO] [stdout] --> src/base/sort_algo.rs:40:4 [INFO] [stdout] | [INFO] [stdout] 40 | fn select(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `fast` [INFO] [stdout] --> src/base/sort_algo.rs:58:4 [INFO] [stdout] | [INFO] [stdout] 58 | fn fast(nums: &mut Vec, left: usize, right: usize) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `merge` [INFO] [stdout] --> src/base/sort_algo.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn merge(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `do_merge` [INFO] [stdout] --> src/base/sort_algo.rs:98:4 [INFO] [stdout] | [INFO] [stdout] 98 | fn do_merge(a: Vec, b: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/tree_node.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `example` [INFO] [stdout] --> src/base/tree_node.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn example() -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/tree_node.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_range` [INFO] [stdout] --> src/binary_search/find_first_and_last_position_of_element_in_sorted_array.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_min` [INFO] [stdout] --> src/binary_search/find_minimum_in_rotated_sorted_array.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/binary_search/find_smallest_letter_greater_than_target.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_greatest_letter` [INFO] [stdout] --> src/binary_search/find_smallest_letter_greater_than_target.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn next_greatest_letter(letters: Vec, target: char) -> char { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/binary_search/powx_n.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_pow` [INFO] [stdout] --> src/binary_search/powx_n.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn my_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/binary_search/single_element_in_a_sorted_array.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_non_duplicate` [INFO] [stdout] --> src/binary_search/single_element_in_a_sorted_array.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn single_non_duplicate(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_non_duplicate2` [INFO] [stdout] --> src/binary_search/single_element_in_a_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn single_non_duplicate2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/binary_search/sqrtx.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_sqrt` [INFO] [stdout] --> src/binary_search/sqrtx.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/binary_number_with_alternating_bits.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_alternating_bits` [INFO] [stdout] --> src/bit/binary_number_with_alternating_bits.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn has_alternating_bits(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/counting_bits.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_bits` [INFO] [stdout] --> src/bit/counting_bits.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn count_bits(num: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_bits2` [INFO] [stdout] --> src/bit/counting_bits.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn count_bits2(num: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_bits3` [INFO] [stdout] --> src/bit/counting_bits.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_bits3(num: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_bits4` [INFO] [stdout] --> src/bit/counting_bits.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn count_bits4(num: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/hamming_distance.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `hamming_distance` [INFO] [stdout] --> src/bit/hamming_distance.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn hamming_distance(x: i32, y: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/maximum_product_of_word_lengths.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_product` [INFO] [stdout] --> src/bit/maximum_product_of_word_lengths.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn max_product(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/missing_number.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `missing_number` [INFO] [stdout] --> src/bit/missing_number.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn missing_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/number_complement.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_complement` [INFO] [stdout] --> src/bit/number_complement.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn find_complement(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/power_of_four.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_power_of_four` [INFO] [stdout] --> src/bit/power_of_four.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn is_power_of_four(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/power_of_two.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_power_of_two` [INFO] [stdout] --> src/bit/power_of_two.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn is_power_of_two(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/reverse_bits.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_bits` [INFO] [stdout] --> src/bit/reverse_bits.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn reverse_bits(x: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/single_number.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_number` [INFO] [stdout] --> src/bit/single_number.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/single_number_iii.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_number` [INFO] [stdout] --> src/bit/single_number_iii.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn single_number(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/bit/sum_of_two_integers.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_sum` [INFO] [stdout] --> src/bit/sum_of_two_integers.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn get_sum(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/dynamic_programming/best_time_to_buy_and_sell_stock_with_cooldown.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/dynamic_programming/best_time_to_buy_and_sell_stock_with_cooldown.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit2` [INFO] [stdout] --> src/dynamic_programming/best_time_to_buy_and_sell_stock_with_cooldown.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn max_profit2(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/dynamic_programming/best_time_to_buy_and_sell_stock_with_cooldown.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn recursive(prices: &Vec, index: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/dynamic_programming/climbing_stairs.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `climb_stairs` [INFO] [stdout] --> src/dynamic_programming/climbing_stairs.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `climb` [INFO] [stdout] --> src/dynamic_programming/climbing_stairs.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn climb(n: usize, items: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/dynamic_programming/coin_change.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `coin_change` [INFO] [stdout] --> src/dynamic_programming/coin_change.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `change` [INFO] [stdout] --> src/dynamic_programming/coin_change.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | fn change(coins: &Vec, amount: i32, items: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/dynamic_programming/fibonacci_number.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fib` [INFO] [stdout] --> src/dynamic_programming/fibonacci_number.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn fib(n: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `lib_loop` [INFO] [stdout] --> src/dynamic_programming/fibonacci_number.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn lib_loop(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/dynamic_programming/house_robber.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob` [INFO] [stdout] --> src/dynamic_programming/house_robber.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/dynamic_programming/house_robber.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | fn recursive(nums: &Vec, index: usize, items: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_path_sum` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_path_sum2` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_path_sum2(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `path_sum2` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | fn path_sum2(grid: &Vec>, i: usize, j: usize, matrix: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_path_sum3` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn min_path_sum3(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `path_sum3` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn path_sum3(grid: &Vec>, i: usize, j: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `zero_one_knapsack` [INFO] [stdout] --> src/dynamic_programming/zero_one_knapsack.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn zero_one_knapsack(items: &[i32], capacity: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/distribute_candies_to_people.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `distribute_candies` [INFO] [stdout] --> src/easy/distribute_candies_to_people.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn distribute_candies(candies: i32, num_people: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_disappeared_numbers` [INFO] [stdout] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn find_disappeared_numbers(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_disappeared_numbers2` [INFO] [stdout] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn find_disappeared_numbers2(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/intersection_of_two_arrays.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `intersection` [INFO] [stdout] --> src/easy/intersection_of_two_arrays.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn intersection(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `intersection2` [INFO] [stdout] --> src/easy/intersection_of_two_arrays.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn intersection2(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/longest_common_prefix.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_common_prefix` [INFO] [stdout] --> src/easy/longest_common_prefix.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn longest_common_prefix(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_common_prefix2` [INFO] [stdout] --> src/easy/longest_common_prefix.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn longest_common_prefix2(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/majority_element.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element` [INFO] [stdout] --> src/easy/majority_element.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element2` [INFO] [stdout] --> src/easy/majority_element.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn majority_element2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element3` [INFO] [stdout] --> src/easy/majority_element.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn majority_element3(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/partition_array_into_three_parts_with_equal_sum.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_three_parts_equal_sum` [INFO] [stdout] --> src/easy/partition_array_into_three_parts_with_equal_sum.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn can_three_parts_equal_sum(a: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/plus_one.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `plus_one` [INFO] [stdout] --> src/easy/plus_one.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/remove_duplicates_from_sorted_array.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates` [INFO] [stdout] --> src/easy/remove_duplicates_from_sorted_array.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates2` [INFO] [stdout] --> src/easy/remove_duplicates_from_sorted_array.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn remove_duplicates2(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/reverse_integer.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/easy/reverse_integer.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/roman_to_integer.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `roman_to_int` [INFO] [stdout] --> src/easy/roman_to_integer.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/search_insert_position.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_insert` [INFO] [stdout] --> src/easy/search_insert_position.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/easy/shortest_unsorted_continuous_subarray.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_unsorted_subarray` [INFO] [stdout] --> src/easy/shortest_unsorted_continuous_subarray.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn find_unsorted_subarray(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/graph/is_graph_bipartite.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_bipartite` [INFO] [stdout] --> src/graph/is_graph_bipartite.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn is_bipartite(graph: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/assign_cookies.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_content_children` [INFO] [stdout] --> src/greedy/assign_cookies.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn find_content_children(g: Vec, s: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/best_time_to_buy_and_sell_stock.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/greedy/best_time_to_buy_and_sell_stock.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit2` [INFO] [stdout] --> src/greedy/best_time_to_buy_and_sell_stock.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_profit2(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/best_time_to_buy_and_sell_stock_ii.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/greedy/best_time_to_buy_and_sell_stock_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/can_place_flowers.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_place_flowers` [INFO] [stdout] --> src/greedy/can_place_flowers.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn can_place_flowers(flowerbed: Vec, n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/maximum_subarray.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sub_array` [INFO] [stdout] --> src/greedy/maximum_subarray.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/minimum_number_of_arrows_to_burst_balloons.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_min_arrow_shots` [INFO] [stdout] --> src/greedy/minimum_number_of_arrows_to_burst_balloons.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn find_min_arrow_shots(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/non_decreasing_array.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check_possibility` [INFO] [stdout] --> src/greedy/non_decreasing_array.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn check_possibility(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/non_overlapping_intervals.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `erase_overlap_intervals` [INFO] [stdout] --> src/greedy/non_overlapping_intervals.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn erase_overlap_intervals(intervals: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/greedy/queue_reconstruction_by_height.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reconstruct_queue` [INFO] [stdout] --> src/greedy/queue_reconstruction_by_height.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn reconstruct_queue(people: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/best_time_to_buy_and_sell_stock_iii.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/hard/best_time_to_buy_and_sell_stock_iii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `profit` [INFO] [stdout] --> src/hard/best_time_to_buy_and_sell_stock_iii.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn profit(prices: &Vec, index: usize, twice: bool, items: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/binary_tree_maximum_path_sum.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_path_sum` [INFO] [stdout] --> src/hard/binary_tree_maximum_path_sum.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/hard/binary_tree_maximum_path_sum.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn search(root: &Option>>) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_one_path` [INFO] [stdout] --> src/hard/binary_tree_maximum_path_sum.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | fn search_one_path(root: &Option>>) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/edit_distance.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_distance` [INFO] [stdout] --> src/hard/edit_distance.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `distance` [INFO] [stdout] --> src/hard/edit_distance.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | fn distance( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/hard/find_median_from_data_stream.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_num` [INFO] [stdout] --> src/hard/find_median_from_data_stream.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn add_num(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_median` [INFO] [stdout] --> src/hard/find_median_from_data_stream.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | fn find_median(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/first_missing_positive.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first_missing_positive` [INFO] [stdout] --> src/hard/first_missing_positive.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn first_missing_positive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/jump_game_ii.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump` [INFO] [stdout] --> src/hard/jump_game_ii.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump2` [INFO] [stdout] --> src/hard/jump_game_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn jump2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump_recursive` [INFO] [stdout] --> src/hard/jump_game_ii.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn jump_recursive(nums: &Vec, index: usize, items: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/largest_rectangle_in_histogram.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `largest_rectangle_area` [INFO] [stdout] --> src/hard/largest_rectangle_in_histogram.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn largest_rectangle_area(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `largest_rectangle_area2` [INFO] [stdout] --> src/hard/largest_rectangle_in_histogram.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn largest_rectangle_area2(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/hard/lfu_cache.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/hard/lfu_cache.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/hard/lfu_cache.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/longest_valid_parentheses.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_valid_parentheses` [INFO] [stdout] --> src/hard/longest_valid_parentheses.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn longest_valid_parentheses(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/maximal_rectangle.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `maximal_rectangle` [INFO] [stdout] --> src/hard/maximal_rectangle.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_rectangle` [INFO] [stdout] --> src/hard/maximal_rectangle.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn get_rectangle( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/median_of_two_sorted_arrays.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_median_sorted_arrays` [INFO] [stdout] --> src/hard/median_of_two_sorted_arrays.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_middle` [INFO] [stdout] --> src/hard/median_of_two_sorted_arrays.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn find_middle(nums: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/merge_k_sorted_lists.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_k_lists` [INFO] [stdout] --> src/hard/merge_k_sorted_lists.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn merge_k_lists(lists: Vec>>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_k_lists2` [INFO] [stdout] --> src/hard/merge_k_sorted_lists.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn merge_k_lists2(lists: Vec>>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists` [INFO] [stdout] --> src/hard/merge_k_sorted_lists.rs:77:12 [INFO] [stdout] | [INFO] [stdout] 77 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/minimum_window_substring.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_window` [INFO] [stdout] --> src/hard/minimum_window_substring.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/n_queens.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `solve_n_queens` [INFO] [stdout] --> src/hard/n_queens.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn solve_n_queens(n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/hard/n_queens.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn put(row: usize, mut items: Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_ok` [INFO] [stdout] --> src/hard/n_queens.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn is_ok(row: usize, column: usize, items: &Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/n_queens_ii.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `total_n_queens` [INFO] [stdout] --> src/hard/n_queens_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn total_n_queens(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/hard/n_queens_ii.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | fn put(row: usize, mut items: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_ok` [INFO] [stdout] --> src/hard/n_queens_ii.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | fn is_ok(row: usize, column: usize, items: &Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/regular_expression_matching.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match` [INFO] [stdout] --> src/hard/regular_expression_matching.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rmatch` [INFO] [stdout] --> src/hard/regular_expression_matching.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/remove_invalid_parentheses.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_invalid_parentheses` [INFO] [stdout] --> src/hard/remove_invalid_parentheses.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn remove_invalid_parentheses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/hard/remove_invalid_parentheses.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec` [INFO] [stdout] --> src/hard/serialize_and_deserialize_binary_tree.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Codec; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> src/hard/serialize_and_deserialize_binary_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | fn serialize(root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> src/hard/serialize_and_deserialize_binary_tree.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn deserialize(data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/sliding_window_maximum.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sliding_window` [INFO] [stdout] --> src/hard/sliding_window_maximum.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn max_sliding_window(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sliding_window2` [INFO] [stdout] --> src/hard/sliding_window_maximum.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn max_sliding_window2(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/trapping_rain_water.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `trap` [INFO] [stdout] --> src/hard/trapping_rain_water.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/wildcard_matching.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match` [INFO] [stdout] --> src/hard/wildcard_matching.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match2` [INFO] [stdout] --> src/hard/wildcard_matching.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match2(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive_match` [INFO] [stdout] --> src/hard/wildcard_matching.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | fn recursive_match( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hard/word_search_ii.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_words` [INFO] [stdout] --> src/hard/word_search_ii.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/hard/word_search_ii.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | fn search( [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hash/contains_duplicate.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains_duplicate` [INFO] [stdout] --> src/hash/contains_duplicate.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hash/longest_consecutive_sequence.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_consecutive` [INFO] [stdout] --> src/hash/longest_consecutive_sequence.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_consecutive2` [INFO] [stdout] --> src/hash/longest_consecutive_sequence.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn longest_consecutive2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hash/longest_harmonious_subsequence.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_lhs` [INFO] [stdout] --> src/hash/longest_harmonious_subsequence.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn find_lhs(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/hash/two_sum.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/hash/two_sum.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum2` [INFO] [stdout] --> src/hash/two_sum.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn two_sum2(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/add_two_numbers_ii.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/linked_list/add_two_numbers_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/intersection_of_two_linked_lists.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_intersection_node` [INFO] [stdout] --> src/linked_list/intersection_of_two_linked_lists.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn get_intersection_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/linked_list_cycle_ii.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `detect_cycle` [INFO] [stdout] --> src/linked_list/linked_list_cycle_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn detect_cycle(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/merge_two_sorted_lists.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists` [INFO] [stdout] --> src/linked_list/merge_two_sorted_lists.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists2` [INFO] [stdout] --> src/linked_list/merge_two_sorted_lists.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn merge_two_lists2( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/odd_even_linked_list.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `odd_even_list` [INFO] [stdout] --> src/linked_list/odd_even_linked_list.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn odd_even_list(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/palindrome_linked_list.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/linked_list/palindrome_linked_list.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_loop` [INFO] [stdout] --> src/linked_list/palindrome_linked_list.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn reverse_loop(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/remove_duplicates_from_sorted_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_duplicates` [INFO] [stdout] --> src/linked_list/remove_duplicates_from_sorted_list.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/remove_nth_node_from_end_of_list.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_nth_from_end` [INFO] [stdout] --> src/linked_list/remove_nth_node_from_end_of_list.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/reverse_linked_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_list` [INFO] [stdout] --> src/linked_list/reverse_linked_list.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_list_recursive` [INFO] [stdout] --> src/linked_list/reverse_linked_list.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | fn reverse_list_recursive( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_list_loop` [INFO] [stdout] --> src/linked_list/reverse_linked_list.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | fn reverse_list_loop(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/swap_nodes_in_pairs.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `swap_pairs` [INFO] [stdout] --> src/linked_list/swap_nodes_in_pairs.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `swap_pairs2` [INFO] [stdout] --> src/linked_list/swap_nodes_in_pairs.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn swap_pairs2(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/add_two_numbers.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/medium/add_two_numbers.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/binary_tree_level_order_traversal.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order` [INFO] [stdout] --> src/medium/binary_tree_level_order_traversal.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/combination_sum.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `combination_sum` [INFO] [stdout] --> src/medium/combination_sum.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/combination_sum.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn recursive( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/combinations.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `combine` [INFO] [stdout] --> src/medium/combinations.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn combine(n: i32, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/combinations.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | fn recursive(s: i32, n: i32, k: i32, mut tmp: Vec, results: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree` [INFO] [stdout] --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_recursive` [INFO] [stdout] --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn build_recursive(preorder: &[i32], inorder: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/container_with_most_water.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_area` [INFO] [stdout] --> src/medium/container_with_most_water.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_area2` [INFO] [stdout] --> src/medium/container_with_most_water.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn max_area2(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/course_schedule.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_finish` [INFO] [stdout] --> src/medium/course_schedule.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/medium/course_schedule.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | fn dfs(graph: &Vec>, flags: &mut Vec, i: usize) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_finish2` [INFO] [stdout] --> src/medium/course_schedule.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn can_finish2(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/decode_string.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `decode_string` [INFO] [stdout] --> src/medium/decode_string.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn decode_string(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/find_all_anagrams_in_a_string.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_anagrams` [INFO] [stdout] --> src/medium/find_all_anagrams_in_a_string.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn find_anagrams(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_anagrams2` [INFO] [stdout] --> src/medium/find_all_anagrams_in_a_string.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn find_anagrams2(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_anagrams3` [INFO] [stdout] --> src/medium/find_all_anagrams_in_a_string.rs:98:12 [INFO] [stdout] | [INFO] [stdout] 98 | pub fn find_anagrams3(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/flatten_binary_tree_to_linked_list.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `flatten` [INFO] [stdout] --> src/medium/flatten_binary_tree_to_linked_list.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/group_anagrams.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `group_anagrams` [INFO] [stdout] --> src/medium/group_anagrams.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/medium/insert_delete_getrandom_o1.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/medium/insert_delete_getrandom_o1.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove` [INFO] [stdout] --> src/medium/insert_delete_getrandom_o1.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_random` [INFO] [stdout] --> src/medium/insert_delete_getrandom_o1.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | fn get_random(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/jump_game.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_jump` [INFO] [stdout] --> src/medium/jump_game.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_jump2` [INFO] [stdout] --> src/medium/jump_game.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn can_jump2(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump2` [INFO] [stdout] --> src/medium/jump_game.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn jump2(nums: &Vec, start: usize) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/letter_combinations_of_a_phone_number.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations` [INFO] [stdout] --> src/medium/letter_combinations_of_a_phone_number.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `combine` [INFO] [stdout] --> src/medium/letter_combinations_of_a_phone_number.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn combine(base: Vec, next: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/longest_increasing_subsequence.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_lis` [INFO] [stdout] --> src/medium/longest_increasing_subsequence.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_lis2` [INFO] [stdout] --> src/medium/longest_increasing_subsequence.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn length_of_lis2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/longest_palindromic_substring.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome` [INFO] [stdout] --> src/medium/longest_palindromic_substring.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check` [INFO] [stdout] --> src/medium/longest_palindromic_substring.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn check(chars: &Vec, mut l: i32, mut r: i32) -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/longest_substring_without_repeating_characters.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_longest_substring` [INFO] [stdout] --> src/medium/longest_substring_without_repeating_characters.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LRUCache` [INFO] [stdout] --> src/medium/lru_cache.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/medium/lru_cache.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/medium/lru_cache.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/medium/lru_cache.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/max_area_of_island.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_area_of_island` [INFO] [stdout] --> src/medium/max_area_of_island.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn max_area_of_island(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find` [INFO] [stdout] --> src/medium/max_area_of_island.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn find(i: usize, j: usize, grid: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/maximal_square.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `maximal_square` [INFO] [stdout] --> src/medium/maximal_square.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn maximal_square(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_square` [INFO] [stdout] --> src/medium/maximal_square.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | fn get_square(i: usize, j: usize, matrix: &Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/maximum_product_subarray.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_product` [INFO] [stdout] --> src/medium/maximum_product_subarray.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/merge_intervals.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/medium/merge_intervals.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/next_permutation.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_permutation` [INFO] [stdout] --> src/medium/next_permutation.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/number_of_islands.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_islands` [INFO] [stdout] --> src/medium/number_of_islands.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `update_islands` [INFO] [stdout] --> src/medium/number_of_islands.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn update_islands(grid: &mut Vec>, i: usize, j: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_of_subarrays` [INFO] [stdout] --> src/medium/number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn num_of_subarrays(arr: Vec, k: i32, threshold: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/numbers_with_same_consecutive_differences.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `nums_same_consec_diff` [INFO] [stdout] --> src/medium/numbers_with_same_consecutive_differences.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn nums_same_consec_diff(n: i32, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/numbers_with_same_consecutive_differences.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn recursive(n: i32, k: i32, pre: i32, tmp: String, nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/partition_equal_subset_sum.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_partition` [INFO] [stdout] --> src/medium/partition_equal_subset_sum.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_partition2` [INFO] [stdout] --> src/medium/partition_equal_subset_sum.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn can_partition2(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `backtracking` [INFO] [stdout] --> src/medium/partition_equal_subset_sum.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn backtracking(left: i32, nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/perfect_squares.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_squares` [INFO] [stdout] --> src/medium/perfect_squares.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn num_squares(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/perfect_squares.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn recursive(n: usize, items: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/product_of_array_except_self.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `product_except_self` [INFO] [stdout] --> src/medium/product_of_array_except_self.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `product_except_self2` [INFO] [stdout] --> src/medium/product_of_array_except_self.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn product_except_self2(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `product_except_self3` [INFO] [stdout] --> src/medium/product_of_array_except_self.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn product_except_self3(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/remove_linked_list_elements.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_elements` [INFO] [stdout] --> src/medium/remove_linked_list_elements.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn remove_elements(head: Option>, val: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/rotate_image.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate` [INFO] [stdout] --> src/medium/rotate_image.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/search_in_rotated_sorted_array.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/medium/search_in_rotated_sorted_array.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/sort_list.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sort_list` [INFO] [stdout] --> src/medium/sort_list.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/medium/sort_list.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | fn merge(l: Option>, r: Option>) -> Option> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/spiral_matrix.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `spiral_order` [INFO] [stdout] --> src/medium/spiral_matrix.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn spiral_order(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/spiral_matrix.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn recursive(matrix: &mut Vec>, is_rotate: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/string_to_integer_atoi.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/medium/string_to_integer_atoi.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn my_atoi(str: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/subarray_sum_equals_k.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subarray_sum` [INFO] [stdout] --> src/medium/subarray_sum_equals_k.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn subarray_sum(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subarray_sum2` [INFO] [stdout] --> src/medium/subarray_sum_equals_k.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn subarray_sum2(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subarray_sum3` [INFO] [stdout] --> src/medium/subarray_sum_equals_k.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn subarray_sum3(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/subsets.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subsets` [INFO] [stdout] --> src/medium/subsets.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subset` [INFO] [stdout] --> src/medium/subsets.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn subset(nums: Vec, set: &mut HashSet>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/target_sum.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_target_sum_ways` [INFO] [stdout] --> src/medium/target_sum.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn find_target_sum_ways(nums: Vec, s: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/target_sum.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn recursive( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/task_scheduler.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `least_interval` [INFO] [stdout] --> src/medium/task_scheduler.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn least_interval(tasks: Vec, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/three_sum.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum` [INFO] [stdout] --> src/medium/three_sum.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum1` [INFO] [stdout] --> src/medium/three_sum.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn three_sum1(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/three_sum_closest.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum_closest` [INFO] [stdout] --> src/medium/three_sum_closest.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/unique_binary_search_trees.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_trees` [INFO] [stdout] --> src/medium/unique_binary_search_trees.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn num_trees(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/unique_paths.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths2` [INFO] [stdout] --> src/medium/unique_paths.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn unique_paths2(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths` [INFO] [stdout] --> src/medium/unique_paths.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/unique_paths.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn recursive(m: usize, n: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/unique_paths_ii.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths_with_obstacles` [INFO] [stdout] --> src/medium/unique_paths_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/medium/unique_paths_ii.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn recursive(grid: &Vec>, i: usize, j: usize, matrix: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/validate_binary_search_tree.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst` [INFO] [stdout] --> src/medium/validate_binary_search_tree.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `valid_recursive` [INFO] [stdout] --> src/medium/validate_binary_search_tree.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | fn valid_recursive(root: Option>>, min_val: i64, max_val: i64) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/word_break.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `word_break` [INFO] [stdout] --> src/medium/word_break.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `break_recursive` [INFO] [stdout] --> src/medium/word_break.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn break_recursive( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/word_search.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `exist` [INFO] [stdout] --> src/medium/word_search.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `exist_recursive` [INFO] [stdout] --> src/medium/word_search.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | fn exist_recursive( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/zigzag_conversion.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `convert` [INFO] [stdout] --> src/medium/zigzag_conversion.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/sort/kth_largest_element_in_an_array.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_kth_largest` [INFO] [stdout] --> src/sort/kth_largest_element_in_an_array.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn find_kth_largest(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fast` [INFO] [stdout] --> src/sort/kth_largest_element_in_an_array.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | fn fast(nums: &mut Vec, left: i32, right: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/sort/sort_characters_by_frequency.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `frequency_sort` [INFO] [stdout] --> src/sort/sort_characters_by_frequency.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn frequency_sort(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/sort/sort_colors.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sort_colors` [INFO] [stdout] --> src/sort/sort_colors.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn sort_colors(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/sort/top_k_frequent_elements.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top_k_frequent` [INFO] [stdout] --> src/sort/top_k_frequent_elements.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top_k_frequent2` [INFO] [stdout] --> src/sort/top_k_frequent_elements.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn top_k_frequent2(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top_k_frequent3` [INFO] [stdout] --> src/sort/top_k_frequent_elements.rs:84:12 [INFO] [stdout] | [INFO] [stdout] 84 | pub fn top_k_frequent3(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/stack_and_queue/daily_temperatures.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `daily_temperatures` [INFO] [stdout] --> src/stack_and_queue/daily_temperatures.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn daily_temperatures(t: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `daily_temperatures2` [INFO] [stdout] --> src/stack_and_queue/daily_temperatures.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn daily_temperatures2(t: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MyQueue` [INFO] [stdout] --> src/stack_and_queue/implement_queue_using_stacks.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/stack_and_queue/implement_queue_using_stacks.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/stack_and_queue/implement_queue_using_stacks.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/stack_and_queue/implement_queue_using_stacks.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `peek` [INFO] [stdout] --> src/stack_and_queue/implement_queue_using_stacks.rs:73:8 [INFO] [stdout] | [INFO] [stdout] 73 | fn peek(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `empty` [INFO] [stdout] --> src/stack_and_queue/implement_queue_using_stacks.rs:83:8 [INFO] [stdout] | [INFO] [stdout] 83 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MyStack` [INFO] [stdout] --> src/stack_and_queue/implement_stack_using_queues.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct MyStack { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/stack_and_queue/implement_stack_using_queues.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/stack_and_queue/implement_stack_using_queues.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/stack_and_queue/implement_stack_using_queues.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top` [INFO] [stdout] --> src/stack_and_queue/implement_stack_using_queues.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `empty` [INFO] [stdout] --> src/stack_and_queue/implement_stack_using_queues.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MinStack` [INFO] [stdout] --> src/stack_and_queue/min_stack.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/stack_and_queue/min_stack.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/stack_and_queue/min_stack.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/stack_and_queue/min_stack.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top` [INFO] [stdout] --> src/stack_and_queue/min_stack.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_min` [INFO] [stdout] --> src/stack_and_queue/min_stack.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | fn get_min(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/stack_and_queue/next_greater_element_ii.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_greater_elements` [INFO] [stdout] --> src/stack_and_queue/next_greater_element_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn next_greater_elements(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/stack_and_queue/valid_parentheses.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid` [INFO] [stdout] --> src/stack_and_queue/valid_parentheses.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid2` [INFO] [stdout] --> src/stack_and_queue/valid_parentheses.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn is_valid2(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/string/add_strings.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_strings` [INFO] [stdout] --> src/string/add_strings.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn add_strings(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/string/count_binary_substrings.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_binary_substrings` [INFO] [stdout] --> src/string/count_binary_substrings.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn count_binary_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/string/isomorphic_strings.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_isomorphic` [INFO] [stdout] --> src/string/isomorphic_strings.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/string/longest_palindrome.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome` [INFO] [stdout] --> src/string/longest_palindrome.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn longest_palindrome(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/string/palindrome_number.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/string/palindrome_number.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome2` [INFO] [stdout] --> src/string/palindrome_number.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn is_palindrome2(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome3` [INFO] [stdout] --> src/string/palindrome_number.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn is_palindrome3(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/string/palindromic_substrings.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_substrings` [INFO] [stdout] --> src/string/palindromic_substrings.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn count_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/string/palindromic_substrings.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn search(chars: &Vec, mut left: usize, mut right: usize) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/string/valid_anagram.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_anagram` [INFO] [stdout] --> src/string/valid_anagram.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/average_of_levels_in_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `average_of_levels` [INFO] [stdout] --> src/tree/average_of_levels_in_binary_tree.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn average_of_levels(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/balanced_binary_tree.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_balanced` [INFO] [stdout] --> src/tree/balanced_binary_tree.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn is_balanced(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `depth` [INFO] [stdout] --> src/tree/balanced_binary_tree.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | fn depth(root: &Option>>) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/binary_tree_inorder_traversal.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder_traversal` [INFO] [stdout] --> src/tree/binary_tree_inorder_traversal.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/binary_tree_inorder_traversal.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn recursive(root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `loops` [INFO] [stdout] --> src/tree/binary_tree_inorder_traversal.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn loops(mut root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/binary_tree_postorder_traversal.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `postorder_traversal` [INFO] [stdout] --> src/tree/binary_tree_postorder_traversal.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/binary_tree_postorder_traversal.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn recursive(root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `loops` [INFO] [stdout] --> src/tree/binary_tree_postorder_traversal.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | fn loops(mut root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/binary_tree_preorder_traversal.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_traversal` [INFO] [stdout] --> src/tree/binary_tree_preorder_traversal.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/binary_tree_preorder_traversal.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn recursive(root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `loops` [INFO] [stdout] --> src/tree/binary_tree_preorder_traversal.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn loops(mut root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/convert_bst_to_greater_tree.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `convert_bst` [INFO] [stdout] --> src/tree/convert_bst_to_greater_tree.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn convert_bst(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/convert_bst_to_greater_tree.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn dfs(root: &mut Option>>, tmp: &mut i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_array_to_bst` [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `creator` [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn creator(nums: &Vec, l: i32, r: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/convert_sorted_list_to_binary_search_tree.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_list_to_bst` [INFO] [stdout] --> src/tree/convert_sorted_list_to_binary_search_tree.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn sorted_list_to_bst(head: Option>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `creator` [INFO] [stdout] --> src/tree/convert_sorted_list_to_binary_search_tree.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn creator( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/diameter_of_binary_tree.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `diameter_of_binary_tree` [INFO] [stdout] --> src/tree/diameter_of_binary_tree.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `depth` [INFO] [stdout] --> src/tree/diameter_of_binary_tree.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | fn depth(root: &Option>>) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/find_bottom_left_tree_value.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_bottom_left_value` [INFO] [stdout] --> src/tree/find_bottom_left_tree_value.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn find_bottom_left_value(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_mode` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn find_mode(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn inorder( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | fn check(val: i32, res: &mut Vec, pre: &mut (Option, usize), count: &mut usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/house_robber_iii.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob` [INFO] [stdout] --> src/tree/house_robber_iii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rob(root: Option>>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/house_robber_iii.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn dfs(root: &Option>>) -> (i32, i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob2` [INFO] [stdout] --> src/tree/house_robber_iii.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn rob2(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/house_robber_iii.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn recursive(root: &Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/tree/implement_trie_prefix_tree.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn create(words: Vec<&str>) -> Trie { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/tree/implement_trie_prefix_tree.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/tree/implement_trie_prefix_tree.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/tree/implement_trie_prefix_tree.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn search(&mut self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `starts_with` [INFO] [stdout] --> src/tree/implement_trie_prefix_tree.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn starts_with(&mut self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/invert_binary_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `invert_tree` [INFO] [stdout] --> src/tree/invert_binary_tree.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | fn recursive(root: Option>>, list: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest2` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn kth_smallest2(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive2` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn recursive2(root: Option>>, k: i32, res: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/longest_univalue_path.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_univalue_path` [INFO] [stdout] --> src/tree/longest_univalue_path.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn longest_univalue_path(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_length` [INFO] [stdout] --> src/tree/longest_univalue_path.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | fn max_length(root: &Option>>, pre_val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `lowest_common_ancestor` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | fn dfs(root: Option>>, pv: i32, qv: i32) -> Option>> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `lowest_common_ancestor` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn dfs(root: Option>>, p: i32, q: i32) -> Option>> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `lowest_common_ancestor2` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn lowest_common_ancestor2( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs2` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | fn dfs2(root: &Option>>, target: i32, paths: &mut Vec) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/maximum_depth_of_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_depth` [INFO] [stdout] --> src/tree/maximum_depth_of_binary_tree.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/merge_two_binary_trees.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_trees` [INFO] [stdout] --> src/tree/merge_two_binary_trees.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn merge_trees( [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/minimum_absolute_difference_in_bst.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_minimum_difference` [INFO] [stdout] --> src/tree/minimum_absolute_difference_in_bst.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn get_minimum_difference(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/tree/minimum_absolute_difference_in_bst.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | fn inorder(root: Option>>, pre: &mut Option, res: &mut i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/minimum_depth_of_binary_tree.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_depth` [INFO] [stdout] --> src/tree/minimum_depth_of_binary_tree.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/path_sum.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_path_sum` [INFO] [stdout] --> src/tree/path_sum.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn has_path_sum(root: Option>>, sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/path_sum_iii.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `path_sum` [INFO] [stdout] --> src/tree/path_sum_iii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn path_sum(root: Option>>, sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `root_sum` [INFO] [stdout] --> src/tree/path_sum_iii.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | fn root_sum(root: &Option>>, sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/second_minimum_node_in_a_binary_tree.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_second_minimum_value` [INFO] [stdout] --> src/tree/second_minimum_node_in_a_binary_tree.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn find_second_minimum_value(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/subtree_of_another_tree.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_subtree` [INFO] [stdout] --> src/tree/subtree_of_another_tree.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn is_subtree(s: Option>>, t: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check` [INFO] [stdout] --> src/tree/subtree_of_another_tree.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn check(s: &Option>>, t: &Option>>) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/sum_of_left_leaves.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sum_of_left_leaves` [INFO] [stdout] --> src/tree/sum_of_left_leaves.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn sum_of_left_leaves(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/symmetric_tree.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric` [INFO] [stdout] --> src/tree/symmetric_tree.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `symmetric_recursive` [INFO] [stdout] --> src/tree/symmetric_tree.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | fn symmetric_recursive( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `symmetric_loop` [INFO] [stdout] --> src/tree/symmetric_tree.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn symmetric_loop(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/trim_a_binary_search_tree.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `trim_bst` [INFO] [stdout] --> src/tree/trim_a_binary_search_tree.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn trim_bst( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/two_sum_iv_input_is_a_bst.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_target` [INFO] [stdout] --> src/tree/two_sum_iv_input_is_a_bst.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn find_target(root: Option>>, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/tree/two_sum_iv_input_is_a_bst.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn inorder(root: Option>>, values: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/is_subsequence.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_subsequence` [INFO] [stdout] --> src/two_point/is_subsequence.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn is_subsequence(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/linked_list_cycle.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_cycle` [INFO] [stdout] --> src/two_point/linked_list_cycle.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn has_cycle(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/longest_word_in_dictionary_through_deleting.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_longest_word` [INFO] [stdout] --> src/two_point/longest_word_in_dictionary_through_deleting.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn find_longest_word(s: String, d: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/merge_sorted_array.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/two_point/merge_sorted_array.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge2` [INFO] [stdout] --> src/two_point/merge_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn merge2(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/move_zeroes.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_zeroes` [INFO] [stdout] --> src/two_point/move_zeroes.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/partition_labels.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `partition_labels` [INFO] [stdout] --> src/two_point/partition_labels.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn partition_labels(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/reverse_vowels_of_a_string.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_vowels` [INFO] [stdout] --> src/two_point/reverse_vowels_of_a_string.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn reverse_vowels(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/sum_of_square_numbers.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `judge_square_sum` [INFO] [stdout] --> src/two_point/sum_of_square_numbers.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn judge_square_sum(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/two_sum_ii_input_array_is_sorted.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/two_point/two_sum_ii_input_array_is_sorted.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn two_sum(numbers: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/valid_palindrome.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/two_point/valid_palindrome.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/valid_palindrome_ii.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `valid_palindrome` [INFO] [stdout] --> src/two_point/valid_palindrome_ii.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn valid_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/two_point/valid_palindrome_ii.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn recursive(s: &Vec, l: usize, r: usize, flag: bool) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `addEdge` should have a snake case name [INFO] [stdout] --> src/base/graph.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn addEdge(&mut self, i: usize, j: usize) { [INFO] [stdout] | ^^^^^^^ help: convert the identifier to snake case: `add_edge` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `topN` should have a snake case name [INFO] [stdout] --> src/base/heap.rs:112:8 [INFO] [stdout] | [INFO] [stdout] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stdout] | ^^^^ help: convert the identifier to snake case: `top_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `Vec::::split_off` that must be used [INFO] [stdout] --> src/easy/remove_duplicates_from_sorted_array.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | nums.split_off(index); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: use `.truncate()` if you don't need the other half [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `matrix` [INFO] [stdout] --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:39 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn kth_smallest_binary_search(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/array/kth_smallest_element_in_a_sorted_matrix.rs:25:62 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn kth_smallest_binary_search(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/base/bit_map.rs:76:23 [INFO] [stdout] | [INFO] [stdout] 76 | fn set(&mut self, n: usize) {} [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/base/bit_map.rs:78:19 [INFO] [stdout] | [INFO] [stdout] 78 | fn get(&self, n: usize) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/base/heap.rs:112:13 [INFO] [stdout] | [INFO] [stdout] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/base/heap.rs:112:29 [INFO] [stdout] | [INFO] [stdout] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/base/heap.rs:117:17 [INFO] [stdout] | [INFO] [stdout] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `mains` [INFO] [stdout] --> src/base/matchs.rs:107:16 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_mains` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `aims` [INFO] [stdout] --> src/base/matchs.rs:107:35 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_aims` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/base/matchs.rs:107:53 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/base/matchs.rs:107:63 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/base/matchs.rs:118:8 [INFO] [stdout] | [INFO] [stdout] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `b` [INFO] [stdout] --> src/base/matchs.rs:118:17 [INFO] [stdout] | [INFO] [stdout] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nodes` [INFO] [stdout] --> src/base/tree_node.rs:32:19 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nodes` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/bit/reverse_bits.rs:29:13 [INFO] [stdout] | [INFO] [stdout] 29 | for i in 0..32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `graph` [INFO] [stdout] --> src/graph/is_graph_bipartite.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn is_bipartite(graph: Vec>) -> bool { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `heights` [INFO] [stdout] --> src/hard/largest_rectangle_in_histogram.rs:18:35 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn largest_rectangle_area(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_heights` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `l` is never read [INFO] [stdout] --> src/hard/maximal_rectangle.rs:51:13 [INFO] [stdout] | [INFO] [stdout] 51 | let mut l = i; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tmp` [INFO] [stdout] --> src/hard/maximal_rectangle.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut tmp = j; [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_tmp` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/hash/longest_harmonious_subsequence.rs:41:17 [INFO] [stdout] | [INFO] [stdout] 41 | for (k, v) in map.iter() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `metrix` [INFO] [stdout] --> src/medium/course_schedule.rs:75:13 [INFO] [stdout] | [INFO] [stdout] 75 | let metrix: Vec> = vec![vec![0; num_courses as usize]; num_courses as usize]; [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_metrix` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `prerequisites` [INFO] [stdout] --> src/medium/course_schedule.rs:73:42 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn can_finish2(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_prerequisites` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `str` [INFO] [stdout] --> src/medium/string_to_integer_atoi.rs:42:20 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn my_atoi(str: String) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_str` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/tree/house_robber_iii.rs:73:21 [INFO] [stdout] | [INFO] [stdout] 73 | let a = node.borrow(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `t` [INFO] [stdout] --> src/tree/implement_trie_prefix_tree.rs:92:9 [INFO] [stdout] | [INFO] [stdout] 92 | let t: Trie = Trie::create(words); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_t` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 669 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/base/binary.rs:6:18 [INFO] [stdout] | [INFO] [stdout] 6 | fn num_to_binary(mut num: i8) -> String { [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: cannot borrow `count_table` as mutable because it is also borrowed as immutable [INFO] [stdout] --> src/base/huffman_coding.rs:12:24 [INFO] [stdout] | [INFO] [stdout] 11 | match count_table.get(&i) { [INFO] [stdout] | ----------- immutable borrow occurs here [INFO] [stdout] 12 | Some(n) => count_table.insert(i, n + 1), [INFO] [stdout] | ^^^^^^^^^^^ - immutable borrow later used here [INFO] [stdout] | | [INFO] [stdout] | mutable borrow occurs here [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mutable_borrow_reservation_conflict)]` on by default [INFO] [stdout] = warning: this borrowing pattern was not meant to be accepted, and may become a hard error in the future [INFO] [stdout] = note: for more information, see issue #59159 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/base/list_node.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut pre = &root; [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/base/sort_algo.rs:87:10 [INFO] [stdout] | [INFO] [stdout] 87 | fn merge(mut nums: Vec) -> Vec { [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/hard/maximal_rectangle.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut tmp = j; [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/hard/regular_expression_matching.rs:58:27 [INFO] [stdout] | [INFO] [stdout] 58 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [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/hard/regular_expression_matching.rs:58:54 [INFO] [stdout] | [INFO] [stdout] 58 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [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/linked_list/reverse_linked_list.rs:21:9 [INFO] [stdout] | [INFO] [stdout] 21 | mut pre: Option>, [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_matrix2` [INFO] [stdout] --> src/array/search_a_2d_matrix_ii.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn search_matrix2(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_error_nums_sort` [INFO] [stdout] --> src/array/set_mismatch.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn find_error_nums_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/bit_map.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn new(nbits: usize) -> BloomFilter { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set` [INFO] [stdout] --> src/base/bit_map.rs:76:8 [INFO] [stdout] | [INFO] [stdout] 76 | fn set(&mut self, n: usize) {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/base/bit_map.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn get(&self, n: usize) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_mid` [INFO] [stdout] --> src/base/heap.rs:117:8 [INFO] [stdout] | [INFO] [stdout] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `default` [INFO] [stdout] --> src/base/java_map.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn default() -> JavaMap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/base/java_map.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn size(&self) -> u64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `JumpTable` [INFO] [stdout] --> src/base/jump_table.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct JumpTable {} [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/base/list_node.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/list_node.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn create(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `good_suffix` [INFO] [stdout] --> src/base/matchs.rs:107:4 [INFO] [stdout] | [INFO] [stdout] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bubble` [INFO] [stdout] --> src/base/sort_algo.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn bubble(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `insert` [INFO] [stdout] --> src/base/sort_algo.rs:25:4 [INFO] [stdout] | [INFO] [stdout] 25 | fn insert(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `select` [INFO] [stdout] --> src/base/sort_algo.rs:40:4 [INFO] [stdout] | [INFO] [stdout] 40 | fn select(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `fast` [INFO] [stdout] --> src/base/sort_algo.rs:58:4 [INFO] [stdout] | [INFO] [stdout] 58 | fn fast(nums: &mut Vec, left: usize, right: usize) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `create` [INFO] [stdout] --> src/base/tree_node.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_non_duplicate2` [INFO] [stdout] --> src/binary_search/single_element_in_a_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn single_non_duplicate2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_bits2` [INFO] [stdout] --> src/bit/counting_bits.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn count_bits2(num: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_bits3` [INFO] [stdout] --> src/bit/counting_bits.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_bits3(num: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_bits4` [INFO] [stdout] --> src/bit/counting_bits.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn count_bits4(num: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_path_sum` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_path_sum3` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn min_path_sum3(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `path_sum3` [INFO] [stdout] --> src/dynamic_programming/minimum_path_sum.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn path_sum3(grid: &Vec>, i: usize, j: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_disappeared_numbers2` [INFO] [stdout] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn find_disappeared_numbers2(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_common_prefix2` [INFO] [stdout] --> src/easy/longest_common_prefix.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn longest_common_prefix2(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element2` [INFO] [stdout] --> src/easy/majority_element.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn majority_element2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element3` [INFO] [stdout] --> src/easy/majority_element.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn majority_element3(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates2` [INFO] [stdout] --> src/easy/remove_duplicates_from_sorted_array.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn remove_duplicates2(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit2` [INFO] [stdout] --> src/greedy/best_time_to_buy_and_sell_stock.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_profit2(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump2` [INFO] [stdout] --> src/hard/jump_game_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn jump2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump_recursive` [INFO] [stdout] --> src/hard/jump_game_ii.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn jump_recursive(nums: &Vec, index: usize, items: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `largest_rectangle_area2` [INFO] [stdout] --> src/hard/largest_rectangle_in_histogram.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn largest_rectangle_area2(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_k_lists2` [INFO] [stdout] --> src/hard/merge_k_sorted_lists.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn merge_k_lists2(lists: Vec>>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists` [INFO] [stdout] --> src/hard/merge_k_sorted_lists.rs:77:12 [INFO] [stdout] | [INFO] [stdout] 77 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sliding_window2` [INFO] [stdout] --> src/hard/sliding_window_maximum.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn max_sliding_window2(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match2` [INFO] [stdout] --> src/hard/wildcard_matching.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match2(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive_match` [INFO] [stdout] --> src/hard/wildcard_matching.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | fn recursive_match( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_consecutive2` [INFO] [stdout] --> src/hash/longest_consecutive_sequence.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn longest_consecutive2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum2` [INFO] [stdout] --> src/hash/two_sum.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn two_sum2(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/add_two_numbers_ii.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/linked_list/add_two_numbers_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/intersection_of_two_linked_lists.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_intersection_node` [INFO] [stdout] --> src/linked_list/intersection_of_two_linked_lists.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn get_intersection_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/linked_list_cycle_ii.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `detect_cycle` [INFO] [stdout] --> src/linked_list/linked_list_cycle_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn detect_cycle(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists` [INFO] [stdout] --> src/linked_list/merge_two_sorted_lists.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/odd_even_linked_list.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `odd_even_list` [INFO] [stdout] --> src/linked_list/odd_even_linked_list.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn odd_even_list(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/remove_duplicates_from_sorted_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_duplicates` [INFO] [stdout] --> src/linked_list/remove_duplicates_from_sorted_list.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_list_loop` [INFO] [stdout] --> src/linked_list/reverse_linked_list.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | fn reverse_list_loop(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/linked_list/swap_nodes_in_pairs.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `swap_pairs` [INFO] [stdout] --> src/linked_list/swap_nodes_in_pairs.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `swap_pairs2` [INFO] [stdout] --> src/linked_list/swap_nodes_in_pairs.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn swap_pairs2(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_area2` [INFO] [stdout] --> src/medium/container_with_most_water.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn max_area2(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_finish2` [INFO] [stdout] --> src/medium/course_schedule.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn can_finish2(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_anagrams2` [INFO] [stdout] --> src/medium/find_all_anagrams_in_a_string.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn find_anagrams2(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_anagrams3` [INFO] [stdout] --> src/medium/find_all_anagrams_in_a_string.rs:98:12 [INFO] [stdout] | [INFO] [stdout] 98 | pub fn find_anagrams3(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/medium/flatten_binary_tree_to_linked_list.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `flatten` [INFO] [stdout] --> src/medium/flatten_binary_tree_to_linked_list.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_jump2` [INFO] [stdout] --> src/medium/jump_game.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn can_jump2(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump2` [INFO] [stdout] --> src/medium/jump_game.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn jump2(nums: &Vec, start: usize) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_lis2` [INFO] [stdout] --> src/medium/longest_increasing_subsequence.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn length_of_lis2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_partition2` [INFO] [stdout] --> src/medium/partition_equal_subset_sum.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn can_partition2(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `backtracking` [INFO] [stdout] --> src/medium/partition_equal_subset_sum.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn backtracking(left: i32, nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `product_except_self2` [INFO] [stdout] --> src/medium/product_of_array_except_self.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn product_except_self2(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `product_except_self3` [INFO] [stdout] --> src/medium/product_of_array_except_self.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn product_except_self3(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subarray_sum3` [INFO] [stdout] --> src/medium/subarray_sum_equals_k.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn subarray_sum3(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum1` [INFO] [stdout] --> src/medium/three_sum.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn three_sum1(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths2` [INFO] [stdout] --> src/medium/unique_paths.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn unique_paths2(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top_k_frequent3` [INFO] [stdout] --> src/sort/top_k_frequent_elements.rs:84:12 [INFO] [stdout] | [INFO] [stdout] 84 | pub fn top_k_frequent3(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `daily_temperatures2` [INFO] [stdout] --> src/stack_and_queue/daily_temperatures.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn daily_temperatures2(t: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid2` [INFO] [stdout] --> src/stack_and_queue/valid_parentheses.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn is_valid2(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome2` [INFO] [stdout] --> src/string/palindrome_number.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn is_palindrome2(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome3` [INFO] [stdout] --> src/string/palindrome_number.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn is_palindrome3(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/binary_tree_inorder_traversal.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn recursive(root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/binary_tree_postorder_traversal.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn recursive(root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/binary_tree_preorder_traversal.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn recursive(root: Option>>, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/convert_bst_to_greater_tree.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `convert_bst` [INFO] [stdout] --> src/tree/convert_bst_to_greater_tree.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn convert_bst(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/convert_bst_to_greater_tree.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn dfs(root: &mut Option>>, tmp: &mut i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_array_to_bst` [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `creator` [INFO] [stdout] --> src/tree/convert_sorted_array_to_binary_search_tree.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn creator(nums: &Vec, l: i32, r: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/convert_sorted_list_to_binary_search_tree.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_list_to_bst` [INFO] [stdout] --> src/tree/convert_sorted_list_to_binary_search_tree.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn sorted_list_to_bst(head: Option>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `creator` [INFO] [stdout] --> src/tree/convert_sorted_list_to_binary_search_tree.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn creator( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/find_bottom_left_tree_value.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_bottom_left_value` [INFO] [stdout] --> src/tree/find_bottom_left_tree_value.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn find_bottom_left_value(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_mode` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn find_mode(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn inorder( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check` [INFO] [stdout] --> src/tree/find_mode_in_binary_search_tree.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | fn check(val: i32, res: &mut Vec, pre: &mut (Option, usize), count: &mut usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/house_robber_iii.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob` [INFO] [stdout] --> src/tree/house_robber_iii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rob(root: Option>>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/house_robber_iii.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn dfs(root: &Option>>) -> (i32, i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob2` [INFO] [stdout] --> src/tree/house_robber_iii.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn rob2(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/house_robber_iii.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn recursive(root: &Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/invert_binary_tree.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `invert_tree` [INFO] [stdout] --> src/tree/invert_binary_tree.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | fn recursive(root: Option>>, list: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest2` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn kth_smallest2(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive2` [INFO] [stdout] --> src/tree/kth_smallest_element_in_a_bst.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn recursive2(root: Option>>, k: i32, res: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/longest_univalue_path.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_univalue_path` [INFO] [stdout] --> src/tree/longest_univalue_path.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn longest_univalue_path(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_length` [INFO] [stdout] --> src/tree/longest_univalue_path.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | fn max_length(root: &Option>>, pre_val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `lowest_common_ancestor` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_search_tree.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | fn dfs(root: Option>>, pv: i32, qv: i32) -> Option>> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `lowest_common_ancestor` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn dfs(root: Option>>, p: i32, q: i32) -> Option>> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `lowest_common_ancestor2` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn lowest_common_ancestor2( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs2` [INFO] [stdout] --> src/tree/lowest_common_ancestor_of_a_binary_tree.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | fn dfs2(root: &Option>>, target: i32, paths: &mut Vec) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/merge_two_binary_trees.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_trees` [INFO] [stdout] --> src/tree/merge_two_binary_trees.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn merge_trees( [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/minimum_absolute_difference_in_bst.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_minimum_difference` [INFO] [stdout] --> src/tree/minimum_absolute_difference_in_bst.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn get_minimum_difference(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/tree/minimum_absolute_difference_in_bst.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | fn inorder(root: Option>>, pre: &mut Option, res: &mut i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/second_minimum_node_in_a_binary_tree.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_second_minimum_value` [INFO] [stdout] --> src/tree/second_minimum_node_in_a_binary_tree.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn find_second_minimum_value(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/subtree_of_another_tree.rs:35:8 [INFO] [stdout] | [INFO] [stdout] 35 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_subtree` [INFO] [stdout] --> src/tree/subtree_of_another_tree.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn is_subtree(s: Option>>, t: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check` [INFO] [stdout] --> src/tree/subtree_of_another_tree.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn check(s: &Option>>, t: &Option>>) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `symmetric_loop` [INFO] [stdout] --> src/tree/symmetric_tree.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn symmetric_loop(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/tree/two_sum_iv_input_is_a_bst.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_target` [INFO] [stdout] --> src/tree/two_sum_iv_input_is_a_bst.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn find_target(root: Option>>, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder` [INFO] [stdout] --> src/tree/two_sum_iv_input_is_a_bst.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn inorder(root: Option>>, values: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/two_point/linked_list_cycle.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_cycle` [INFO] [stdout] --> src/two_point/linked_list_cycle.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn has_cycle(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge2` [INFO] [stdout] --> src/two_point/merge_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn merge2(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `addEdge` should have a snake case name [INFO] [stdout] --> src/base/graph.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn addEdge(&mut self, i: usize, j: usize) { [INFO] [stdout] | ^^^^^^^ help: convert the identifier to snake case: `add_edge` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `topN` should have a snake case name [INFO] [stdout] --> src/base/heap.rs:112:8 [INFO] [stdout] | [INFO] [stdout] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stdout] | ^^^^ help: convert the identifier to snake case: `top_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused return value of `Vec::::split_off` that must be used [INFO] [stdout] --> src/easy/remove_duplicates_from_sorted_array.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | nums.split_off(index); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: use `.truncate()` if you don't need the other half [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 175 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 9.84s [INFO] running `Command { std: "docker" "inspect" "65b766882c2453dd67fb42ff0ac40c2db9d4f4aeeb221e4962ee8eaf6fecf1bc", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "65b766882c2453dd67fb42ff0ac40c2db9d4f4aeeb221e4962ee8eaf6fecf1bc", kill_on_drop: false }` [INFO] [stdout] 65b766882c2453dd67fb42ff0ac40c2db9d4f4aeeb221e4962ee8eaf6fecf1bc