[INFO] updating cached repository https://github.com/Yogaflre/leetcode [INFO] running `"git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "-c" "remote.origin.fetch=refs/heads/*:refs/heads/*" "fetch" "origin" "--force" "--prune"` [INFO] [stderr] From https://github.com/Yogaflre/leetcode [INFO] [stderr] a413ced..174cdea master -> master [INFO] running `"git" "rev-parse" "HEAD"` [INFO] [stdout] 174cdea2a188474171236439a1f31ec08b4ea1c5 [INFO] checking Yogaflre/leetcode against try#d7b51666469c792a8a3f40849607739bae1e705e for pr-71665 [INFO] running `"git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYogaflre%2Fleetcode" "/workspace/builds/worker-8/source"` [INFO] [stderr] Cloning into '/workspace/builds/worker-8/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Yogaflre/leetcode on toolchain d7b51666469c792a8a3f40849607739bae1e705e [INFO] running `"/workspace/cargo-home/bin/cargo" "+d7b51666469c792a8a3f40849607739bae1e705e" "read-manifest" "--manifest-path" "Cargo.toml"` [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-8/source/Cargo.toml [INFO] crate git repo https://github.com/Yogaflre/leetcode already has a lockfile, it will not be regenerated [INFO] running `"/workspace/cargo-home/bin/cargo" "+d7b51666469c792a8a3f40849607739bae1e705e" "fetch" "--locked" "--manifest-path" "Cargo.toml"` [INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/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" "MAP_USER_ID=0" "-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" "--network" "none" "rustops/crates-build-env" "/opt/rustwide/cargo-home/bin/cargo" "+d7b51666469c792a8a3f40849607739bae1e705e" "check" "--frozen" "--all" "--all-targets"` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] 5bac5c315545f7d6baaecd5620ba9e04faca0556fd1e56056fbfcbb7acf21e55 [INFO] running `"docker" "start" "-a" "5bac5c315545f7d6baaecd5620ba9e04faca0556fd1e56056fbfcbb7acf21e55"` [INFO] [stderr] sudo: setrlimit(RLIMIT_CORE): Operation not permitted [INFO] [stderr] Checking leetcode v0.1.0 (/opt/rustwide/workdir) [INFO] [stderr] warning: unused import: `std::collections::HashSet` [INFO] [stderr] --> src/medium/merge_intervals.rs:17:5 [INFO] [stderr] | [INFO] [stderr] 17 | use std::collections::HashSet; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::cmp::min` [INFO] [stderr] --> src/medium/coin_change.rs:19:5 [INFO] [stderr] | [INFO] [stderr] 19 | use std::cmp::min; [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::collections::HashSet` [INFO] [stderr] --> src/medium/merge_intervals.rs:17:5 [INFO] [stderr] | [INFO] [stderr] 17 | use std::collections::HashSet; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::cmp::min` [INFO] [stderr] --> src/medium/coin_change.rs:19:5 [INFO] [stderr] | [INFO] [stderr] 19 | use std::cmp::min; [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nums` [INFO] [stderr] --> src/base/heap.rs:112:13 [INFO] [stderr] | [INFO] [stderr] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `n` [INFO] [stderr] --> src/base/heap.rs:112:29 [INFO] [stderr] | [INFO] [stderr] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nums` [INFO] [stderr] --> src/base/heap.rs:117:17 [INFO] [stderr] | [INFO] [stderr] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stderr] [INFO] [stderr] warning: variable `pre` is assigned to, but never used [INFO] [stderr] --> src/base/list_node.rs:51:13 [INFO] [stderr] | [INFO] [stderr] 51 | let mut pre: &mut Option> = &mut None; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: consider using `_pre` instead [INFO] [stderr] [INFO] [stderr] warning: value assigned to `pre` is never read [INFO] [stderr] --> src/base/list_node.rs:58:13 [INFO] [stderr] | [INFO] [stderr] 58 | pre = temp; [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: unused variable: `mains` [INFO] [stderr] --> src/base/matchs.rs:107:16 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_mains` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `aims` [INFO] [stderr] --> src/base/matchs.rs:107:35 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_aims` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/base/matchs.rs:107:53 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `j` [INFO] [stderr] --> src/base/matchs.rs:107:63 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `a` [INFO] [stderr] --> src/base/matchs.rs:118:8 [INFO] [stderr] | [INFO] [stderr] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `b` [INFO] [stderr] --> src/base/matchs.rs:118:17 [INFO] [stderr] | [INFO] [stderr] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nodes` [INFO] [stderr] --> src/base/tree_node.rs:32:19 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nodes` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `head` [INFO] [stderr] --> src/easy/reverse_linked_list.rs:18:31 [INFO] [stderr] | [INFO] [stderr] 18 | fn reverse_list_recursive(mut head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `lists` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:23:26 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn merge_k_lists(lists: Vec>>) -> Option> { [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_lists` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `left` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:17:13 [INFO] [stderr] | [INFO] [stderr] 17 | let mut left = 0; [INFO] [stderr] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `right` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:18:13 [INFO] [stderr] | [INFO] [stderr] 18 | let mut right = 0; [INFO] [stderr] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_right` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `t` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:20:13 [INFO] [stderr] | [INFO] [stderr] 20 | let t: Vec = t.chars().collect(); [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_t` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:21:13 [INFO] [stderr] | [INFO] [stderr] 21 | for i in 0..s.len() { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `height` [INFO] [stderr] --> src/medium/container_with_most_water.rs:34:22 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn max_area2(height: Vec) -> i32 { [INFO] [stderr] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nums` [INFO] [stderr] --> src/medium/next_permutation.rs:22:29 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stderr] [INFO] [stderr] warning: cannot borrow `count_table` as mutable because it is also borrowed as immutable [INFO] [stderr] --> src/base/huffman_coding.rs:12:24 [INFO] [stderr] | [INFO] [stderr] 11 | match count_table.get(&i) { [INFO] [stderr] | ----------- immutable borrow occurs here [INFO] [stderr] 12 | Some(n) => count_table.insert(i, n + 1), [INFO] [stderr] | ^^^^^^^^^^^ - immutable borrow later used here [INFO] [stderr] | | [INFO] [stderr] | mutable borrow occurs here [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(mutable_borrow_reservation_conflict)]` on by default [INFO] [stderr] = warning: this borrowing pattern was not meant to be accepted, and may become a hard error in the future [INFO] [stderr] = note: for more information, see issue #59159 [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/base/sort_algo.rs:88:10 [INFO] [stderr] | [INFO] [stderr] 88 | fn merge(mut nums: Vec) -> Vec { [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/easy/reverse_linked_list.rs:18:31 [INFO] [stderr] | [INFO] [stderr] 18 | fn reverse_list_recursive(mut head: Option>) -> Option> { [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/regular_expression_matching.rs:59:27 [INFO] [stderr] | [INFO] [stderr] 59 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [INFO] [stderr] | ----^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/regular_expression_matching.rs:59:54 [INFO] [stderr] | [INFO] [stderr] 59 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [INFO] [stderr] | ----^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/minimum_window_substring.rs:17:13 [INFO] [stderr] | [INFO] [stderr] 17 | let mut left = 0; [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/minimum_window_substring.rs:18:13 [INFO] [stderr] | [INFO] [stderr] 18 | let mut right = 0; [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: function is never used: `eight_queen` [INFO] [stderr] --> src/base/backtracking.rs:4:4 [INFO] [stderr] | [INFO] [stderr] 4 | fn eight_queen() -> [usize; 8] { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `put` [INFO] [stderr] --> src/base/backtracking.rs:10:4 [INFO] [stderr] | [INFO] [stderr] 10 | fn put(row: usize, board: &mut [usize; 8]) -> bool { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `is_ok` [INFO] [stderr] --> src/base/backtracking.rs:26:4 [INFO] [stderr] | [INFO] [stderr] 26 | fn is_ok(board: &[usize; 8], row: usize, column: usize) -> bool { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `zero_one_package` [INFO] [stderr] --> src/base/backtracking.rs:46:4 [INFO] [stderr] | [INFO] [stderr] 46 | fn zero_one_package(items: &[i32], capacity: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `rmatch` [INFO] [stderr] --> src/base/backtracking.rs:68:4 [INFO] [stderr] | [INFO] [stderr] 68 | fn rmatch(a: String, b: String) -> bool { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `rmatch_recursive` [INFO] [stderr] --> src/base/backtracking.rs:76:4 [INFO] [stderr] | [INFO] [stderr] 76 | fn rmatch_recursive(a: &[char], ai: usize, b: &[char], bi: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `loop_search` [INFO] [stderr] --> src/base/binary_search.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn loop_search(nums: Vec, target: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `recursive_search` [INFO] [stderr] --> src/base/binary_search.rs:19:4 [INFO] [stderr] | [INFO] [stderr] 19 | fn recursive_search(nums: Vec, target: i32, left: usize, right: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `find_first` [INFO] [stderr] --> src/base/binary_search.rs:34:4 [INFO] [stderr] | [INFO] [stderr] 34 | fn find_first(nums: Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `zero_one_package` [INFO] [stderr] --> src/base/dynamic_programming.rs:4:4 [INFO] [stderr] | [INFO] [stderr] 4 | fn zero_one_package(items: &[i32], capacity: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/base/graph.rs:11:5 [INFO] [stderr] | [INFO] [stderr] 11 | pub fn create(n: usize) -> Graph { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `addEdge` [INFO] [stderr] --> src/base/graph.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn addEdge(&mut self, i: usize, j: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `bfs` [INFO] [stderr] --> src/base/graph.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | pub fn bfs(&self, i: usize, j: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `dfs` [INFO] [stderr] --> src/base/graph.rs:63:5 [INFO] [stderr] | [INFO] [stderr] 63 | pub fn dfs(&self, i: usize, j: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `dfs_recursive` [INFO] [stderr] --> src/base/graph.rs:70:5 [INFO] [stderr] | [INFO] [stderr] 70 | fn dfs_recursive(&self, i: usize, j: usize, items: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `distribute_candy` [INFO] [stderr] --> src/base/greedy.rs:4:4 [INFO] [stderr] | [INFO] [stderr] 4 | fn distribute_candy(mut candies: i32, mut children: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `find_disjoint_area` [INFO] [stderr] --> src/base/greedy.rs:25:4 [INFO] [stderr] | [INFO] [stderr] 25 | fn find_disjoint_area(mut areas: Vec<(i32, i32)>) -> Vec<(i32, i32)> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `remove_num` [INFO] [stderr] --> src/base/greedy.rs:47:4 [INFO] [stderr] | [INFO] [stderr] 47 | fn remove_num(num: u32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `heapify` [INFO] [stderr] --> src/base/heap.rs:10:5 [INFO] [stderr] | [INFO] [stderr] 10 | fn heapify(nums: &mut Vec, mut index: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/base/heap.rs:36:5 [INFO] [stderr] | [INFO] [stderr] 36 | fn create(mut nums: Vec) -> Heap { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `insert` [INFO] [stderr] --> src/base/heap.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | fn insert(&mut self, num: i32) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `remove_max` [INFO] [stderr] --> src/base/heap.rs:65:5 [INFO] [stderr] | [INFO] [stderr] 65 | fn remove_max(&mut self) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sort` [INFO] [stderr] --> src/base/heap.rs:78:5 [INFO] [stderr] | [INFO] [stderr] 78 | fn sort(&mut self) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `topN` [INFO] [stderr] --> src/base/heap.rs:112:5 [INFO] [stderr] | [INFO] [stderr] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find_mid` [INFO] [stderr] --> src/base/heap.rs:117:5 [INFO] [stderr] | [INFO] [stderr] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `huffman_coding` [INFO] [stderr] --> src/base/huffman_coding.rs:6:4 [INFO] [stderr] | [INFO] [stderr] 6 | fn huffman_coding(text: String) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `JumpTable` [INFO] [stderr] --> src/base/jump_table.rs:2:8 [INFO] [stderr] | [INFO] [stderr] 2 | struct JumpTable { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/base/list_node.rs:12:5 [INFO] [stderr] | [INFO] [stderr] 12 | pub fn new(val: i32) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/base/list_node.rs:16:5 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn create(nums: Vec) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/base/list_node.rs:39:5 [INFO] [stderr] | [INFO] [stderr] 39 | pub fn new(val: i32) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/base/list_node.rs:48:5 [INFO] [stderr] | [INFO] [stderr] 48 | pub fn create(nums: Vec) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bp` [INFO] [stderr] --> src/base/matchs.rs:4:4 [INFO] [stderr] | [INFO] [stderr] 4 | fn bp(main: &str, aim: &str) -> bool { [INFO] [stderr] | ^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `rk` [INFO] [stderr] --> src/base/matchs.rs:30:4 [INFO] [stderr] | [INFO] [stderr] 30 | fn rk(main: &str, aim: &str) -> bool { [INFO] [stderr] | ^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `hash` [INFO] [stderr] --> src/base/matchs.rs:49:4 [INFO] [stderr] | [INFO] [stderr] 49 | fn hash(text: &str, dict: &HashMap) -> i32 { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bm` [INFO] [stderr] --> src/base/matchs.rs:69:4 [INFO] [stderr] | [INFO] [stderr] 69 | fn bm(a: &str, b: &str) -> bool { [INFO] [stderr] | ^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bad_char` [INFO] [stderr] --> src/base/matchs.rs:92:4 [INFO] [stderr] | [INFO] [stderr] 92 | fn bad_char(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `good_suffix` [INFO] [stderr] --> src/base/matchs.rs:107:4 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `kmp` [INFO] [stderr] --> src/base/matchs.rs:118:4 [INFO] [stderr] | [INFO] [stderr] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bubble` [INFO] [stderr] --> src/base/sort_algo.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn bubble(mut nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `insert` [INFO] [stderr] --> src/base/sort_algo.rs:25:4 [INFO] [stderr] | [INFO] [stderr] 25 | fn insert(mut nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `select` [INFO] [stderr] --> src/base/sort_algo.rs:40:4 [INFO] [stderr] | [INFO] [stderr] 40 | fn select(mut nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `fast` [INFO] [stderr] --> src/base/sort_algo.rs:59:4 [INFO] [stderr] | [INFO] [stderr] 59 | fn fast(nums: &mut Vec, left: usize, right: usize) { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `merge` [INFO] [stderr] --> src/base/sort_algo.rs:88:4 [INFO] [stderr] | [INFO] [stderr] 88 | fn merge(mut nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `do_merge` [INFO] [stderr] --> src/base/sort_algo.rs:99:4 [INFO] [stderr] | [INFO] [stderr] 99 | fn do_merge(a: Vec, b: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/base/tree_node.rs:16:5 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn new(val: i32) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `example` [INFO] [stderr] --> src/base/tree_node.rs:24:5 [INFO] [stderr] | [INFO] [stderr] 24 | pub fn example() -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/base/tree_node.rs:32:5 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/fibonacci_number.rs:12:8 [INFO] [stderr] | [INFO] [stderr] 12 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `fib` [INFO] [stderr] --> src/easy/fibonacci_number.rs:18:5 [INFO] [stderr] | [INFO] [stderr] 18 | pub fn fib(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `lib_loop` [INFO] [stderr] --> src/easy/fibonacci_number.rs:32:5 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn lib_loop(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/two_sum.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `two_sum` [INFO] [stderr] --> src/easy/two_sum.rs:16:5 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/reverse_integer.rs:25:8 [INFO] [stderr] | [INFO] [stderr] 25 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse` [INFO] [stderr] --> src/easy/reverse_integer.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn reverse(x: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/palindrome_number.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_palindrome` [INFO] [stderr] --> src/easy/palindrome_number.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_palindrome2` [INFO] [stderr] --> src/easy/palindrome_number.rs:45:5 [INFO] [stderr] | [INFO] [stderr] 45 | pub fn is_palindrome2(x: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/valid_parentheses.rs:36:8 [INFO] [stderr] | [INFO] [stderr] 36 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_valid` [INFO] [stderr] --> src/easy/valid_parentheses.rs:38:5 [INFO] [stderr] | [INFO] [stderr] 38 | pub fn is_valid(s: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_valid2` [INFO] [stderr] --> src/easy/valid_parentheses.rs:51:5 [INFO] [stderr] | [INFO] [stderr] 51 | pub fn is_valid2(s: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/merge_two_sorted_lists.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_two_lists` [INFO] [stderr] --> src/easy/merge_two_sorted_lists.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | / pub fn merge_two_lists( [INFO] [stderr] 23 | | l1: Option>, [INFO] [stderr] 24 | | l2: Option>, [INFO] [stderr] 25 | | ) -> Option> { [INFO] [stderr] ... | [INFO] [stderr] 47 | | return result.unwrap().next; [INFO] [stderr] 48 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_two_lists2` [INFO] [stderr] --> src/easy/merge_two_sorted_lists.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | / pub fn merge_two_lists2( [INFO] [stderr] 51 | | l1: Option>, [INFO] [stderr] 52 | | l2: Option>, [INFO] [stderr] 53 | | ) -> Option> { [INFO] [stderr] ... | [INFO] [stderr] 68 | | } [INFO] [stderr] 69 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/maximum_subarray.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_sub_array` [INFO] [stderr] --> src/easy/maximum_subarray.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/climbing_stairs.rs:24:8 [INFO] [stderr] | [INFO] [stderr] 24 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `climb_stairs` [INFO] [stderr] --> src/easy/climbing_stairs.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `climb` [INFO] [stderr] --> src/easy/climbing_stairs.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | fn climb(n: usize, items: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/reverse_linked_list.rs:10:8 [INFO] [stderr] | [INFO] [stderr] 10 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse_list` [INFO] [stderr] --> src/easy/reverse_linked_list.rs:12:5 [INFO] [stderr] | [INFO] [stderr] 12 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse_list_recursive` [INFO] [stderr] --> src/easy/reverse_linked_list.rs:18:5 [INFO] [stderr] | [INFO] [stderr] 18 | fn reverse_list_recursive(mut head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse_list_loop` [INFO] [stderr] --> src/easy/reverse_linked_list.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | fn reverse_list_loop(mut head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/symmetric_tree.rs:27:8 [INFO] [stderr] | [INFO] [stderr] 27 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_symmetric` [INFO] [stderr] --> src/easy/symmetric_tree.rs:29:5 [INFO] [stderr] | [INFO] [stderr] 29 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `symmetric_recursive` [INFO] [stderr] --> src/easy/symmetric_tree.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | / fn symmetric_recursive( [INFO] [stderr] 42 | | left: &Option>>, [INFO] [stderr] 43 | | right: &Option>>, [INFO] [stderr] 44 | | ) -> bool { [INFO] [stderr] ... | [INFO] [stderr] 54 | | }; [INFO] [stderr] 55 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `symmetric_loop` [INFO] [stderr] --> src/easy/symmetric_tree.rs:57:5 [INFO] [stderr] | [INFO] [stderr] 57 | fn symmetric_loop(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/maximum_depth_of_binary_tree.rs:23:8 [INFO] [stderr] | [INFO] [stderr] 23 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_depth` [INFO] [stderr] --> src/easy/maximum_depth_of_binary_tree.rs:25:5 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/single_number.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `single_number` [INFO] [stderr] --> src/easy/single_number.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `single_numbe2` [INFO] [stderr] --> src/easy/single_number.rs:25:5 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn single_numbe2(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find_disappeared_numbers` [INFO] [stderr] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:20:5 [INFO] [stderr] | [INFO] [stderr] 20 | pub fn find_disappeared_numbers(nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find_disappeared_numbers2` [INFO] [stderr] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:37:5 [INFO] [stderr] | [INFO] [stderr] 37 | pub fn find_disappeared_numbers2(nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/linked_list_cycle.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `has_cycle` [INFO] [stderr] --> src/easy/linked_list_cycle.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn has_cycle(head: Option>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/median_of_two_sorted_arrays.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find_median_sorted_arrays` [INFO] [stderr] --> src/hard/median_of_two_sorted_arrays.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find_middle` [INFO] [stderr] --> src/hard/median_of_two_sorted_arrays.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | fn find_middle(nums: Vec) -> f64 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/regular_expression_matching.rs:49:8 [INFO] [stderr] | [INFO] [stderr] 49 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_match` [INFO] [stderr] --> src/hard/regular_expression_matching.rs:51:5 [INFO] [stderr] | [INFO] [stderr] 51 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `rmatch` [INFO] [stderr] --> src/hard/regular_expression_matching.rs:59:5 [INFO] [stderr] | [INFO] [stderr] 59 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_k_lists` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:23:5 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn merge_k_lists(lists: Vec>>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_k_lists2` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn merge_k_lists2(lists: Vec>>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_two_lists` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | / pub fn merge_two_lists( [INFO] [stderr] 51 | | mut one: &Option>, [INFO] [stderr] 52 | | mut two: &Option>, [INFO] [stderr] 53 | | ) -> Option> { [INFO] [stderr] ... | [INFO] [stderr] 79 | | return result.unwrap().next; [INFO] [stderr] 80 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/longest_valid_parentheses.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `longest_valid_parentheses` [INFO] [stderr] --> src/hard/longest_valid_parentheses.rs:24:5 [INFO] [stderr] | [INFO] [stderr] 24 | pub fn longest_valid_parentheses(s: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/first_missing_positive.rs:27:8 [INFO] [stderr] | [INFO] [stderr] 27 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `first_missing_positive` [INFO] [stderr] --> src/hard/first_missing_positive.rs:29:5 [INFO] [stderr] | [INFO] [stderr] 29 | pub fn first_missing_positive(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/trapping_rain_water.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `trap` [INFO] [stderr] --> src/hard/trapping_rain_water.rs:19:5 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn trap(height: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/edit_distance.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 30 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_distance` [INFO] [stderr] --> src/hard/edit_distance.rs:32:5 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `distance` [INFO] [stderr] --> src/hard/edit_distance.rs:42:5 [INFO] [stderr] | [INFO] [stderr] 42 | / fn distance( [INFO] [stderr] 43 | | word1: &Vec, [INFO] [stderr] 44 | | word2: &Vec, [INFO] [stderr] 45 | | i: usize, [INFO] [stderr] ... | [INFO] [stderr] 74 | | return tmp; [INFO] [stderr] 75 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/jump_game_ii.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `jump` [INFO] [stderr] --> src/hard/jump_game_ii.rs:19:5 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn jump(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `jump2` [INFO] [stderr] --> src/hard/jump_game_ii.rs:36:5 [INFO] [stderr] | [INFO] [stderr] 36 | pub fn jump2(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `jump_recursive` [INFO] [stderr] --> src/hard/jump_game_ii.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | fn jump_recursive(nums: &Vec, index: usize, items: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:14:8 [INFO] [stderr] | [INFO] [stderr] 14 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_window` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:16:5 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn min_window(s: String, t: String) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/add_two_numbers.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_two_numbers` [INFO] [stderr] --> src/medium/add_two_numbers.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | / pub fn add_two_numbers( [INFO] [stderr] 22 | | l1: Option>, [INFO] [stderr] 23 | | l2: Option>, [INFO] [stderr] 24 | | ) -> Option> { [INFO] [stderr] ... | [INFO] [stderr] 43 | | return root.next; [INFO] [stderr] 44 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/longest_substring_without_repeating_characters.rs:27:8 [INFO] [stderr] | [INFO] [stderr] 27 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `length_of_longest_substring` [INFO] [stderr] --> src/medium/longest_substring_without_repeating_characters.rs:29:5 [INFO] [stderr] | [INFO] [stderr] 29 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/longest_palindromic_substring.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `longest_palindrome` [INFO] [stderr] --> src/medium/longest_palindromic_substring.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn longest_palindrome(s: String) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `check` [INFO] [stderr] --> src/medium/longest_palindromic_substring.rs:44:5 [INFO] [stderr] | [INFO] [stderr] 44 | fn check(chars: &Vec, mut l: i32, mut r: i32) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/zigzag_conversion.rs:31:8 [INFO] [stderr] | [INFO] [stderr] 31 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `convert` [INFO] [stderr] --> src/medium/zigzag_conversion.rs:33:5 [INFO] [stderr] | [INFO] [stderr] 33 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/container_with_most_water.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_area` [INFO] [stderr] --> src/medium/container_with_most_water.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn max_area(height: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_area2` [INFO] [stderr] --> src/medium/container_with_most_water.rs:34:5 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn max_area2(height: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/three_sum.rs:32:8 [INFO] [stderr] | [INFO] [stderr] 32 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `three_sum` [INFO] [stderr] --> src/medium/three_sum.rs:34:5 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `three_sum1` [INFO] [stderr] --> src/medium/three_sum.rs:74:5 [INFO] [stderr] | [INFO] [stderr] 74 | pub fn three_sum1(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/letter_combinations_of_a_phone_number.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `letter_combinations` [INFO] [stderr] --> src/medium/letter_combinations_of_a_phone_number.rs:19:5 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `combine` [INFO] [stderr] --> src/medium/letter_combinations_of_a_phone_number.rs:78:5 [INFO] [stderr] | [INFO] [stderr] 78 | fn combine(base: Vec, next: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/remove_nth_node_from_end_of_list.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `remove_nth_from_end` [INFO] [stderr] --> src/medium/remove_nth_node_from_end_of_list.rs:23:5 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/generate_parentheses.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `generate_parenthesis` [INFO] [stderr] --> src/medium/generate_parentheses.rs:20:5 [INFO] [stderr] | [INFO] [stderr] 20 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `generate` [INFO] [stderr] --> src/medium/generate_parentheses.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | fn generate(result: &mut Vec, temp: String, l: i32, r: i32) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/next_permutation.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `next_permutation` [INFO] [stderr] --> src/medium/next_permutation.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/search_in_rotated_sorted_array.rs:23:8 [INFO] [stderr] | [INFO] [stderr] 23 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `search` [INFO] [stderr] --> src/medium/search_in_rotated_sorted_array.rs:25:5 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/find_first_and_last_position_of_element_in_sorted_array.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `search_range` [INFO] [stderr] --> src/medium/find_first_and_last_position_of_element_in_sorted_array.rs:20:5 [INFO] [stderr] | [INFO] [stderr] 20 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/combination_sum.rs:31:8 [INFO] [stderr] | [INFO] [stderr] 31 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `combination_sum` [INFO] [stderr] --> src/medium/combination_sum.rs:33:5 [INFO] [stderr] | [INFO] [stderr] 33 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `recursive` [INFO] [stderr] --> src/medium/combination_sum.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | / fn recursive( [INFO] [stderr] 42 | | candidates: &Vec, [INFO] [stderr] 43 | | target: i32, [INFO] [stderr] 44 | | tmp: Vec, [INFO] [stderr] ... | [INFO] [stderr] 65 | | } [INFO] [stderr] 66 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/permutations.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `permute` [INFO] [stderr] --> src/medium/permutations.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `recursive` [INFO] [stderr] --> src/medium/permutations.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | fn recursive(result: &mut Vec>, nums: Vec, tmp: Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/rotate_image.rs:43:8 [INFO] [stderr] | [INFO] [stderr] 43 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `rotate` [INFO] [stderr] --> src/medium/rotate_image.rs:45:5 [INFO] [stderr] | [INFO] [stderr] 45 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/group_anagrams.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `group_anagrams` [INFO] [stderr] --> src/medium/group_anagrams.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/max_area_of_island.rs:25:8 [INFO] [stderr] | [INFO] [stderr] 25 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_area_of_island` [INFO] [stderr] --> src/medium/max_area_of_island.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn max_area_of_island(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find` [INFO] [stderr] --> src/medium/max_area_of_island.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | fn find(i: usize, j: usize, grid: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/jump_game.rs:27:8 [INFO] [stderr] | [INFO] [stderr] 27 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `can_jump` [INFO] [stderr] --> src/medium/jump_game.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `can_jump2` [INFO] [stderr] --> src/medium/jump_game.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn can_jump2(nums: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `jump2` [INFO] [stderr] --> src/medium/jump_game.rs:44:5 [INFO] [stderr] | [INFO] [stderr] 44 | fn jump2(nums: &Vec, start: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/three_sum_closest.rs:14:8 [INFO] [stderr] | [INFO] [stderr] 14 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `three_sum_closest` [INFO] [stderr] --> src/medium/three_sum_closest.rs:16:5 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/merge_intervals.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge` [INFO] [stderr] --> src/medium/merge_intervals.rs:20:5 [INFO] [stderr] | [INFO] [stderr] 20 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/unique_paths.rs:26:8 [INFO] [stderr] | [INFO] [stderr] 26 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `unique_paths` [INFO] [stderr] --> src/medium/unique_paths.rs:28:5 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `unique_paths_recursive` [INFO] [stderr] --> src/medium/unique_paths.rs:39:5 [INFO] [stderr] | [INFO] [stderr] 39 | pub fn unique_paths_recursive(m: i32, n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/coin_change.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `coin_change` [INFO] [stderr] --> src/medium/coin_change.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `change` [INFO] [stderr] --> src/medium/coin_change.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | fn change(coins: &Vec, amount: i32, items: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:24:8 [INFO] [stderr] | [INFO] [stderr] 24 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_path_sum` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_path_sum2` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:47:5 [INFO] [stderr] | [INFO] [stderr] 47 | pub fn min_path_sum2(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `path_sum2` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:51:5 [INFO] [stderr] | [INFO] [stderr] 51 | fn path_sum2(grid: &Vec>, i: usize, j: usize, matrix: &mut Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_path_sum3` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:74:5 [INFO] [stderr] | [INFO] [stderr] 74 | pub fn min_path_sum3(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `path_sum3` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:77:5 [INFO] [stderr] | [INFO] [stderr] 77 | fn path_sum3(grid: &Vec>, i: usize, j: usize) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/sort_colors.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sort_colors` [INFO] [stderr] --> src/medium/sort_colors.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn sort_colors(nums: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/medium/implement_trie_prefix_tree.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn create(words: Vec<&str>) -> Trie { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/medium/implement_trie_prefix_tree.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | fn new() -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `insert` [INFO] [stderr] --> src/medium/implement_trie_prefix_tree.rs:39:5 [INFO] [stderr] | [INFO] [stderr] 39 | fn insert(&mut self, word: String) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `search` [INFO] [stderr] --> src/medium/implement_trie_prefix_tree.rs:58:5 [INFO] [stderr] | [INFO] [stderr] 58 | fn search(&mut self, word: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `starts_with` [INFO] [stderr] --> src/medium/implement_trie_prefix_tree.rs:75:5 [INFO] [stderr] | [INFO] [stderr] 75 | fn starts_with(&mut self, prefix: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/subsets.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `subsets` [INFO] [stderr] --> src/medium/subsets.rs:24:5 [INFO] [stderr] | [INFO] [stderr] 24 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `subset` [INFO] [stderr] --> src/medium/subsets.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | fn subset(nums: Vec, set: &mut HashSet>) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `LRUCache` [INFO] [stderr] --> src/medium/lru_cache.rs:32:8 [INFO] [stderr] | [INFO] [stderr] 32 | struct LRUCache { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/medium/lru_cache.rs:39:5 [INFO] [stderr] | [INFO] [stderr] 39 | fn new(capacity: i32) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/medium/lru_cache.rs:47:5 [INFO] [stderr] | [INFO] [stderr] 47 | fn get(&mut self, key: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `put` [INFO] [stderr] --> src/medium/lru_cache.rs:58:5 [INFO] [stderr] | [INFO] [stderr] 58 | fn put(&mut self, key: i32, value: i32) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/binary_tree_inorder_traversal.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `inorder_traversal` [INFO] [stderr] --> src/medium/binary_tree_inorder_traversal.rs:23:5 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traversal_recursive` [INFO] [stderr] --> src/medium/binary_tree_inorder_traversal.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | fn traversal_recursive(root: Option>>, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traversal_loop` [INFO] [stderr] --> src/medium/binary_tree_inorder_traversal.rs:38:5 [INFO] [stderr] | [INFO] [stderr] 38 | fn traversal_loop(mut root: Option>>, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/binary_tree_preorder_traversal.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `preorder_traversal` [INFO] [stderr] --> src/medium/binary_tree_preorder_traversal.rs:23:5 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traversal_recursive` [INFO] [stderr] --> src/medium/binary_tree_preorder_traversal.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | fn traversal_recursive(root: Option>>, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traversal_loop` [INFO] [stderr] --> src/medium/binary_tree_preorder_traversal.rs:38:5 [INFO] [stderr] | [INFO] [stderr] 38 | fn traversal_loop(mut root: Option>>, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/binary_tree_level_order_traversal.rs:25:8 [INFO] [stderr] | [INFO] [stderr] 25 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `level_order` [INFO] [stderr] --> src/medium/binary_tree_level_order_traversal.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `build_tree` [INFO] [stderr] --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:24:5 [INFO] [stderr] | [INFO] [stderr] 24 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `build_recursive` [INFO] [stderr] --> src/medium/construct_binary_tree_from_preorder_and_inorder_traversal.rs:28:5 [INFO] [stderr] | [INFO] [stderr] 28 | fn build_recursive(preorder: &[i32], inorder: &[i32]) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/unique_binary_search_trees.rs:23:8 [INFO] [stderr] | [INFO] [stderr] 23 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `num_trees` [INFO] [stderr] --> src/medium/unique_binary_search_trees.rs:25:5 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn num_trees(n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/remove_linked_list_elements.rs:11:8 [INFO] [stderr] | [INFO] [stderr] 11 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `remove_elements` [INFO] [stderr] --> src/medium/remove_linked_list_elements.rs:13:5 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn remove_elements(head: Option>, val: i32) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/word_search.rs:20:8 [INFO] [stderr] | [INFO] [stderr] 20 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `exist` [INFO] [stderr] --> src/medium/word_search.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `exist_recursive` [INFO] [stderr] --> src/medium/word_search.rs:35:5 [INFO] [stderr] | [INFO] [stderr] 35 | / fn exist_recursive( [INFO] [stderr] 36 | | board: &Vec>, [INFO] [stderr] 37 | | words: &Vec, [INFO] [stderr] 38 | | i: usize, [INFO] [stderr] ... | [INFO] [stderr] 85 | | return false; [INFO] [stderr] 86 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/medium/sort_list.rs:17:8 [INFO] [stderr] | [INFO] [stderr] 17 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sort_list` [INFO] [stderr] --> src/medium/sort_list.rs:19:5 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn sort_list(head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge` [INFO] [stderr] --> src/medium/sort_list.rs:42:5 [INFO] [stderr] | [INFO] [stderr] 42 | fn merge(l: Option>, r: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `addEdge` should have a snake case name [INFO] [stderr] --> src/base/graph.rs:22:12 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn addEdge(&mut self, i: usize, j: usize) { [INFO] [stderr] | ^^^^^^^ help: convert the identifier to snake case: `add_edge` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_snake_case)]` on by default [INFO] [stderr] [INFO] [stderr] warning: method `topN` should have a snake case name [INFO] [stderr] --> src/base/heap.rs:112:8 [INFO] [stderr] | [INFO] [stderr] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stderr] | ^^^^ help: convert the identifier to snake case: `top_n` [INFO] [stderr] [INFO] [stderr] warning: 241 warnings emitted [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nums` [INFO] [stderr] --> src/base/heap.rs:112:13 [INFO] [stderr] | [INFO] [stderr] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `n` [INFO] [stderr] --> src/base/heap.rs:112:29 [INFO] [stderr] | [INFO] [stderr] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nums` [INFO] [stderr] --> src/base/heap.rs:117:17 [INFO] [stderr] | [INFO] [stderr] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stderr] [INFO] [stderr] warning: variable `pre` is assigned to, but never used [INFO] [stderr] --> src/base/list_node.rs:51:13 [INFO] [stderr] | [INFO] [stderr] 51 | let mut pre: &mut Option> = &mut None; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: consider using `_pre` instead [INFO] [stderr] [INFO] [stderr] warning: value assigned to `pre` is never read [INFO] [stderr] --> src/base/list_node.rs:58:13 [INFO] [stderr] | [INFO] [stderr] 58 | pre = temp; [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: unused variable: `mains` [INFO] [stderr] --> src/base/matchs.rs:107:16 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_mains` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `aims` [INFO] [stderr] --> src/base/matchs.rs:107:35 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_aims` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/base/matchs.rs:107:53 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `j` [INFO] [stderr] --> src/base/matchs.rs:107:63 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `a` [INFO] [stderr] --> src/base/matchs.rs:118:8 [INFO] [stderr] | [INFO] [stderr] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `b` [INFO] [stderr] --> src/base/matchs.rs:118:17 [INFO] [stderr] | [INFO] [stderr] 118 | fn kmp(a: &str, b: &str) -> bool { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nodes` [INFO] [stderr] --> src/base/tree_node.rs:32:19 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nodes` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `head` [INFO] [stderr] --> src/easy/reverse_linked_list.rs:18:31 [INFO] [stderr] | [INFO] [stderr] 18 | fn reverse_list_recursive(mut head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `lists` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:23:26 [INFO] [stderr] | [INFO] [stderr] 23 | pub fn merge_k_lists(lists: Vec>>) -> Option> { [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_lists` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `left` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:17:13 [INFO] [stderr] | [INFO] [stderr] 17 | let mut left = 0; [INFO] [stderr] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `right` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:18:13 [INFO] [stderr] | [INFO] [stderr] 18 | let mut right = 0; [INFO] [stderr] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_right` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `t` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:20:13 [INFO] [stderr] | [INFO] [stderr] 20 | let t: Vec = t.chars().collect(); [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_t` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/hard/minimum_window_substring.rs:21:13 [INFO] [stderr] | [INFO] [stderr] 21 | for i in 0..s.len() { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `height` [INFO] [stderr] --> src/medium/container_with_most_water.rs:34:22 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn max_area2(height: Vec) -> i32 { [INFO] [stderr] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `nums` [INFO] [stderr] --> src/medium/next_permutation.rs:22:29 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stderr] [INFO] [stderr] warning: cannot borrow `count_table` as mutable because it is also borrowed as immutable [INFO] [stderr] --> src/base/huffman_coding.rs:12:24 [INFO] [stderr] | [INFO] [stderr] 11 | match count_table.get(&i) { [INFO] [stderr] | ----------- immutable borrow occurs here [INFO] [stderr] 12 | Some(n) => count_table.insert(i, n + 1), [INFO] [stderr] | ^^^^^^^^^^^ - immutable borrow later used here [INFO] [stderr] | | [INFO] [stderr] | mutable borrow occurs here [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(mutable_borrow_reservation_conflict)]` on by default [INFO] [stderr] = warning: this borrowing pattern was not meant to be accepted, and may become a hard error in the future [INFO] [stderr] = note: for more information, see issue #59159 [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/base/sort_algo.rs:88:10 [INFO] [stderr] | [INFO] [stderr] 88 | fn merge(mut nums: Vec) -> Vec { [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/easy/reverse_linked_list.rs:18:31 [INFO] [stderr] | [INFO] [stderr] 18 | fn reverse_list_recursive(mut head: Option>) -> Option> { [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/regular_expression_matching.rs:59:27 [INFO] [stderr] | [INFO] [stderr] 59 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [INFO] [stderr] | ----^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/regular_expression_matching.rs:59:54 [INFO] [stderr] | [INFO] [stderr] 59 | fn rmatch(s: &[char], mut si: usize, p: &[char], mut pi: usize) -> bool { [INFO] [stderr] | ----^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/minimum_window_substring.rs:17:13 [INFO] [stderr] | [INFO] [stderr] 17 | let mut left = 0; [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/hard/minimum_window_substring.rs:18:13 [INFO] [stderr] | [INFO] [stderr] 18 | let mut right = 0; [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: function is never used: `loop_search` [INFO] [stderr] --> src/base/binary_search.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn loop_search(nums: Vec, target: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `recursive_search` [INFO] [stderr] --> src/base/binary_search.rs:19:4 [INFO] [stderr] | [INFO] [stderr] 19 | fn recursive_search(nums: Vec, target: i32, left: usize, right: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find_mid` [INFO] [stderr] --> src/base/heap.rs:117:5 [INFO] [stderr] | [INFO] [stderr] 117 | fn find_mid(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `JumpTable` [INFO] [stderr] --> src/base/jump_table.rs:2:8 [INFO] [stderr] | [INFO] [stderr] 2 | struct JumpTable { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/base/list_node.rs:39:5 [INFO] [stderr] | [INFO] [stderr] 39 | pub fn new(val: i32) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/base/list_node.rs:48:5 [INFO] [stderr] | [INFO] [stderr] 48 | pub fn create(nums: Vec) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `good_suffix` [INFO] [stderr] --> src/base/matchs.rs:107:4 [INFO] [stderr] | [INFO] [stderr] 107 | fn good_suffix(mains: &Vec, aims: &Vec, i: usize, j: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bubble` [INFO] [stderr] --> src/base/sort_algo.rs:5:4 [INFO] [stderr] | [INFO] [stderr] 5 | fn bubble(mut nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `insert` [INFO] [stderr] --> src/base/sort_algo.rs:25:4 [INFO] [stderr] | [INFO] [stderr] 25 | fn insert(mut nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `select` [INFO] [stderr] --> src/base/sort_algo.rs:40:4 [INFO] [stderr] | [INFO] [stderr] 40 | fn select(mut nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `fast` [INFO] [stderr] --> src/base/sort_algo.rs:59:4 [INFO] [stderr] | [INFO] [stderr] 59 | fn fast(nums: &mut Vec, left: usize, right: usize) { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `create` [INFO] [stderr] --> src/base/tree_node.rs:32:5 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn create(nodes: Vec) -> Option>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_valid2` [INFO] [stderr] --> src/easy/valid_parentheses.rs:51:5 [INFO] [stderr] | [INFO] [stderr] 51 | pub fn is_valid2(s: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_two_lists` [INFO] [stderr] --> src/easy/merge_two_sorted_lists.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | / pub fn merge_two_lists( [INFO] [stderr] 23 | | l1: Option>, [INFO] [stderr] 24 | | l2: Option>, [INFO] [stderr] 25 | | ) -> Option> { [INFO] [stderr] ... | [INFO] [stderr] 47 | | return result.unwrap().next; [INFO] [stderr] 48 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse_list_recursive` [INFO] [stderr] --> src/easy/reverse_linked_list.rs:18:5 [INFO] [stderr] | [INFO] [stderr] 18 | fn reverse_list_recursive(mut head: Option>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `symmetric_loop` [INFO] [stderr] --> src/easy/symmetric_tree.rs:57:5 [INFO] [stderr] | [INFO] [stderr] 57 | fn symmetric_loop(root: Option>>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `single_numbe2` [INFO] [stderr] --> src/easy/single_number.rs:25:5 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn single_numbe2(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find_disappeared_numbers2` [INFO] [stderr] --> src/easy/find_all_numbers_disappeared_in_an_array.rs:37:5 [INFO] [stderr] | [INFO] [stderr] 37 | pub fn find_disappeared_numbers2(nums: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> src/easy/linked_list_cycle.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | struct Solution; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `has_cycle` [INFO] [stderr] --> src/easy/linked_list_cycle.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn has_cycle(head: Option>) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_k_lists2` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn merge_k_lists2(lists: Vec>>) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge_two_lists` [INFO] [stderr] --> src/hard/merge_k_sorted_lists.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | / pub fn merge_two_lists( [INFO] [stderr] 51 | | mut one: &Option>, [INFO] [stderr] 52 | | mut two: &Option>, [INFO] [stderr] 53 | | ) -> Option> { [INFO] [stderr] ... | [INFO] [stderr] 79 | | return result.unwrap().next; [INFO] [stderr] 80 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `jump2` [INFO] [stderr] --> src/hard/jump_game_ii.rs:36:5 [INFO] [stderr] | [INFO] [stderr] 36 | pub fn jump2(nums: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `jump_recursive` [INFO] [stderr] --> src/hard/jump_game_ii.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | fn jump_recursive(nums: &Vec, index: usize, items: &mut Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_area` [INFO] [stderr] --> src/medium/container_with_most_water.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn max_area(height: Vec) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `three_sum1` [INFO] [stderr] --> src/medium/three_sum.rs:74:5 [INFO] [stderr] | [INFO] [stderr] 74 | pub fn three_sum1(nums: Vec) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `can_jump2` [INFO] [stderr] --> src/medium/jump_game.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn can_jump2(nums: Vec) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `jump2` [INFO] [stderr] --> src/medium/jump_game.rs:44:5 [INFO] [stderr] | [INFO] [stderr] 44 | fn jump2(nums: &Vec, start: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `unique_paths_recursive` [INFO] [stderr] --> src/medium/unique_paths.rs:39:5 [INFO] [stderr] | [INFO] [stderr] 39 | pub fn unique_paths_recursive(m: i32, n: i32) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_path_sum` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_path_sum3` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:74:5 [INFO] [stderr] | [INFO] [stderr] 74 | pub fn min_path_sum3(grid: Vec>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `path_sum3` [INFO] [stderr] --> src/medium/minimum_path_sum.rs:77:5 [INFO] [stderr] | [INFO] [stderr] 77 | fn path_sum3(grid: &Vec>, i: usize, j: usize) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traversal_recursive` [INFO] [stderr] --> src/medium/binary_tree_inorder_traversal.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | fn traversal_recursive(root: Option>>, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traversal_recursive` [INFO] [stderr] --> src/medium/binary_tree_preorder_traversal.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | fn traversal_recursive(root: Option>>, result: &mut Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `addEdge` should have a snake case name [INFO] [stderr] --> src/base/graph.rs:22:12 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn addEdge(&mut self, i: usize, j: usize) { [INFO] [stderr] | ^^^^^^^ help: convert the identifier to snake case: `add_edge` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_snake_case)]` on by default [INFO] [stderr] [INFO] [stderr] warning: method `topN` should have a snake case name [INFO] [stderr] --> src/base/heap.rs:112:8 [INFO] [stderr] | [INFO] [stderr] 112 | fn topN(nums: Vec, n: usize) -> Vec { [INFO] [stderr] | ^^^^ help: convert the identifier to snake case: `top_n` [INFO] [stderr] [INFO] [stderr] warning: 65 warnings emitted [INFO] [stderr] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 2.67s [INFO] running `"docker" "inspect" "5bac5c315545f7d6baaecd5620ba9e04faca0556fd1e56056fbfcbb7acf21e55"` [INFO] running `"docker" "rm" "-f" "5bac5c315545f7d6baaecd5620ba9e04faca0556fd1e56056fbfcbb7acf21e55"` [INFO] [stdout] 5bac5c315545f7d6baaecd5620ba9e04faca0556fd1e56056fbfcbb7acf21e55