[INFO] cloning repository https://github.com/Yoogurt/LeetCode_Rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Yoogurt/LeetCode_Rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYoogurt%2FLeetCode_Rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYoogurt%2FLeetCode_Rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 76315e552cf03b1f87ed8879044632d068945f7d [INFO] checking Yoogurt/LeetCode_Rust/76315e552cf03b1f87ed8879044632d068945f7d against try#ccf408f4326a858c00dd845a64a86b16f360a801 for pr-129466-2 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FYoogurt%2FLeetCode_Rust" "/workspace/builds/worker-4-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Yoogurt/LeetCode_Rust on toolchain ccf408f4326a858c00dd845a64a86b16f360a801 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/Yoogurt/LeetCode_Rust [INFO] finished tweaking git repo https://github.com/Yoogurt/LeetCode_Rust [INFO] tweaked toml for git repo https://github.com/Yoogurt/LeetCode_Rust written to /workspace/builds/worker-4-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/Yoogurt/LeetCode_Rust already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:6252d7ea7fb8caaf7af6d800c5fb250a9cd862b9a7f9508afb3c54fa7fe1102e" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] d88adc9b7982fbebe13ec71bc157271ad62186818321bb848a0f07805b6c5f0b [INFO] running `Command { std: "docker" "start" "-a" "d88adc9b7982fbebe13ec71bc157271ad62186818321bb848a0f07805b6c5f0b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "d88adc9b7982fbebe13ec71bc157271ad62186818321bb848a0f07805b6c5f0b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "d88adc9b7982fbebe13ec71bc157271ad62186818321bb848a0f07805b6c5f0b", kill_on_drop: false }` [INFO] [stdout] d88adc9b7982fbebe13ec71bc157271ad62186818321bb848a0f07805b6c5f0b [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:6252d7ea7fb8caaf7af6d800c5fb250a9cd862b9a7f9508afb3c54fa7fe1102e" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 8faaa9087371a272d4cc345f561f26f241be3319191aa9bfdf3374593aac616e [INFO] running `Command { std: "docker" "start" "-a" "8faaa9087371a272d4cc345f561f26f241be3319191aa9bfdf3374593aac616e", kill_on_drop: false }` [INFO] [stderr] Copying to /tmp/fixit [INFO] [stderr] Running `cargo fix --edition` [INFO] [stderr] Migrating Cargo.toml from 2021 edition to 2024 [INFO] [stderr] Checking Base v0.1.0 (/tmp/fixit/base) [INFO] [stdout] warning: crate `Base` should have a snake case name [INFO] [stdout] | [INFO] [stdout] = help: convert the identifier to snake case: `base` [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Checking code v0.1.0 (/tmp/fixit) [INFO] [stderr] Migrating src/main.rs from 2021 edition to 2024 [INFO] [stderr] Fixed src/code_606.rs (1 fix) [INFO] [stderr] Fixed src/code_73.rs (1 fix) [INFO] [stderr] Fixed src/code_474.rs (1 fix) [INFO] [stderr] Fixed src/code_226.rs (1 fix) [INFO] [stderr] Fixed src/code_63.rs (1 fix) [INFO] [stderr] Fixed src/code_95.rs (1 fix) [INFO] [stderr] Fixed src/code_113.rs (1 fix) [INFO] [stderr] Fixed src/code_543.rs (1 fix) [INFO] [stderr] Fixed src/code_67.rs (1 fix) [INFO] [stderr] Fixed src/code_2596.rs (2 fixes) [INFO] [stderr] Fixed src/code_120.rs (1 fix) [INFO] [stderr] Fixed src/code_lcp_50.rs (2 fixes) [INFO] [stderr] Fixed src/code_1971.rs (1 fix) [INFO] [stderr] Fixed src/code_2605.rs (1 fix) [INFO] [stderr] Fixed src/code_1005.rs (1 fix) [INFO] [stderr] Fixed src/code_257.rs (1 fix) [INFO] [stderr] Fixed src/code_98.rs (1 fix) [INFO] [stderr] Fixed src/code_337.rs (1 fix) [INFO] [stderr] Fixed src/code_100.rs (1 fix) [INFO] [stderr] Fixed src/code_235.rs (1 fix) [INFO] [stderr] Fixed src/code_696.rs (1 fix) [INFO] [stderr] Fixed src/code_203.rs (1 fix) [INFO] [stderr] Fixed src/code_48.rs (1 fix) [INFO] [stderr] Fixed src/code_1228.rs (1 fix) [INFO] [stderr] Fixed src/code_494.rs (2 fixes) [INFO] [stderr] Fixed src/code_14.rs (1 fix) [INFO] [stderr] Fixed src/code_102.rs (1 fix) [INFO] [stderr] Fixed src/code_101.rs (1 fix) [INFO] [stderr] Fixed src/code_111.rs (1 fix) [INFO] [stderr] Fixed src/code_1232.rs (3 fixes) [INFO] [stderr] Fixed src/code_404.rs (1 fix) [INFO] [stderr] Fixed src/code_680.rs (1 fix) [INFO] [stderr] Fixed src/code_64.rs (1 fix) [INFO] [stdout] warning: value assigned to `current_level` is never read [INFO] [stdout] --> src/code_102.rs:18:17 [INFO] [stdout] | [INFO] [stdout] 18 | let mut current_level = Vec::>>::new(); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `read_count` is assigned to, but never used [INFO] [stdout] --> src/code_157.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | let mut read_count = 0; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_read_count` instead [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable pattern [INFO] [stdout] --> src/code_657.rs:17:13 [INFO] [stdout] | [INFO] [stdout] 11 | 'D' => { [INFO] [stdout] | --- matches all the relevant values [INFO] [stdout] ... [INFO] [stdout] 17 | 'D' => { [INFO] [stdout] | ^^^ no value can reach this [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/code_1971.rs:6:23 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn valid_path(n: i32, edges: Vec>, source: i32, destination: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> src/code_64.rs:7:49 [INFO] [stdout] | [INFO] [stdout] 7 | grid.into_iter().enumerate().for_each(|(y, value)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_y` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/code_95.rs:59:31 [INFO] [stdout] | [INFO] [stdout] 59 | fn visit_child_and_insert(target: i32, [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/code_95.rs:60:31 [INFO] [stdout] | [INFO] [stdout] 60 | ... node: Rc>, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/code_95.rs:61:31 [INFO] [stdout] | [INFO] [stdout] 61 | ... result: &mut Vec>>) { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `allow_deletion` is never read [INFO] [stdout] --> src/code_680.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | allow_deletion = false; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `left` [INFO] [stdout] --> src/code_680.rs:16:21 [INFO] [stdout] | [INFO] [stdout] 16 | let left =s[*left_index]; [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_left` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `right` [INFO] [stdout] --> src/code_680.rs:17:21 [INFO] [stdout] | [INFO] [stdout] 17 | let right = s[*right_index]; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_right` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `left_left` [INFO] [stdout] --> src/code_680.rs:18:21 [INFO] [stdout] | [INFO] [stdout] 18 | let left_left = s[*left_index + 1]; [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_left` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `right_right` [INFO] [stdout] --> src/code_680.rs:19:21 [INFO] [stdout] | [INFO] [stdout] 19 | let right_right = s[*right_index - 1]; [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_right_right` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `scan_index` is never read [INFO] [stdout] --> src/code_696.rs:9:17 [INFO] [stdout] | [INFO] [stdout] 9 | let mut scan_index = start_index; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/main.rs:131:8 [INFO] [stdout] | [INFO] [stdout] 131 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: the lint level is defined here [INFO] [stdout] --> src/main.rs:130:8 [INFO] [stdout] | [INFO] [stdout] 130 | #[warn(dead_code)] [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `wei_bag_problem1` is never used [INFO] [stdout] --> src/bag.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn wei_bag_problem1(weight: Vec, value: Vec, bag_size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/code_1.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_same_tree` is never used [INFO] [stdout] --> src/code_100.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn is_same_tree( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_string` is never used [INFO] [stdout] --> src/code_1005.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_string(words: Vec, s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_symmetric` and `is_symmetric_compare` are never used [INFO] [stdout] --> src/code_101.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_symmetric_compare( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order` is never used [INFO] [stdout] --> src/code_102.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/code_104.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sorted_array_to_bst_internal` and `sorted_array_to_bst` are never used [INFO] [stdout] --> src/code_108.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn sorted_array_to_bst_internal(nums: &Vec, left: usize, right: usize) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_depth` is never used [INFO] [stdout] --> src/code_111.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `has_path_sum` is never used [INFO] [stdout] --> src/code_112.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit_2` is never used [INFO] [stdout] --> src/code_121.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_profit_2(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/code_122.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `next`, `iter_check_path`, and `has_valid_path` are never used [INFO] [stdout] --> src/code_1391.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn next((last_x, last_y): (i32, i32), [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 138 | fn iter_check_path(mut last: (i32, i32), [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 168 | pub fn has_valid_path(grid: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_common_prefix` is never used [INFO] [stdout] --> src/code_14.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn longest_common_prefix(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BrowserHistory` is never constructed [INFO] [stdout] --> src/code_1472.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct BrowserHistory { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `visit`, `back`, and `forward` are never used [INFO] [stdout] --> src/code_1472.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl BrowserHistory { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 11 | fn new(homepage: String) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn visit(&mut self, url: String) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn back(&mut self, steps: i32) -> String { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn forward(&mut self, steps: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum` is never used [INFO] [stdout] --> src/code_15.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn three_sum(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `eval_rpn` is never used [INFO] [stdout] --> src/code_150.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `read` and `read4` are never used [INFO] [stdout] --> src/code_157.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- methods in this implementation [INFO] [stdout] 4 | pub fn read(&self, buf: &mut [char], n: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn read4(&self, _buf4: &mut [char]) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `point_in_line`, `point_in_line_y`, and `intersection` are never used [INFO] [stdout] --> src/code_1603.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn point_in_line(start: &Vec, end: &Vec, (x, _y): (f64, f64)) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 8 | fn point_in_line_y<'a>(mut start: &'a Vec, mut end: &'a Vec, y: f64) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn intersection( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array_2` is never used [INFO] [stdout] --> src/code_1617.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_sub_array_2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `title_to_number` is never used [INFO] [stdout] --> src/code_171.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn title_to_number(column_title: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_number` is never used [INFO] [stdout] --> src/code_179.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn largest_number(mut nums: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `hammingWeight` is never used [INFO] [stdout] --> src/code_191.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn hammingWeight (n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rob` is never used [INFO] [stdout] --> src/code_198.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_two_numbers` is never used [INFO] [stdout] --> src/code_2.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn add_two_numbers(l1: Option>, l2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/code_20.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `mark_island_visit` and `num_islands` are never used [INFO] [stdout] --> src/code_200.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn mark_island_visit((x, y): (usize, usize), grid: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn num_islands(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_elements` is never used [INFO] [stdout] --> src/code_203.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn remove_elements(mut head: Option>, val: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_primes` is never used [INFO] [stdout] --> src/code_204.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_primes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/code_205.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_sub_array_len` is never used [INFO] [stdout] --> src/code_209.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/code_21.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn merge_two_lists(mut list1: Option>, mut list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum3_internal` and `combination_sum3` are never used [INFO] [stdout] --> src/code_216.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn combination_sum3_internal(k: i32, lower: i32, sum: i32, target: i32, current: &mut Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn combination_sum3(k: i32, n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `generate_parenthesis_rec` and `generate_parenthesis` are never used [INFO] [stdout] --> src/code_22.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn generate_parenthesis_rec(left: i32, remain: i32, current: String, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `left_stack`, `right_stack`, and `use_left_stack` are never read [INFO] [stdout] --> src/code_225.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyStack { [INFO] [stdout] | ------- fields in this struct [INFO] [stdout] 4 | left_stack: VecDeque, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] 5 | right_stack: VecDeque, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] 6 | use_left_stack: bool, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `fill_backup_queue`, `pop`, `top`, and `empty` are never used [INFO] [stdout] --> src/code_225.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 25 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn fill_backup_queue(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn top(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `invert_tree` is never used [INFO] [stdout] --> src/code_226.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `stack_1` and `stack_2` are never read [INFO] [stdout] --> src/code_232.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 1 | struct MyQueue { [INFO] [stdout] | ------- fields in this struct [INFO] [stdout] 2 | stack_1: Vec, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 3 | stack_2: Vec, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `fill_stack`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/code_232.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 20 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn fill_stack(&mut self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn peek(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor_2` is never used [INFO] [stdout] --> src/code_235.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn lowest_common_ancestor_2(root: Option>>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/code_236.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_strobogrammatic` is never used [INFO] [stdout] --> src/code_246.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_strobogrammatic(num: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `binary_tree_paths_internal` and `binary_tree_paths` are never used [INFO] [stdout] --> src/code_257.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn binary_tree_paths_internal(node: Option>>, current: &mut Vec, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn binary_tree_paths(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_digits` is never used [INFO] [stdout] --> src/code_258.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn add_digits(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/code_26.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_number` is never used [INFO] [stdout] --> src/code_2605.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_number(nums1: Vec, nums2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `VISIT` is never used [INFO] [stdout] --> src/code_261.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const VISIT: i32 = 1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `IN` is never used [INFO] [stdout] --> src/code_261.rs:4:7 [INFO] [stdout] | [INFO] [stdout] 4 | const IN: i32 = 2; [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `valid_tree` is never used [INFO] [stdout] --> src/code_261.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn valid_tree(n: i32, edges: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `matrix_sum` is never used [INFO] [stdout] --> src/code_2679.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn matrix_sum(mut nums: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_element` is never used [INFO] [stdout] --> src/code_27.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn remove_element(nums: &mut Vec, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `move_zeroes` is never used [INFO] [stdout] --> src/code_283.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_hint` is never used [INFO] [stdout] --> src/code_299.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn get_hint(secret: String, guess: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/code_3.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_lis` is never used [INFO] [stdout] --> src/code_300.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `bulb_switch` is never used [INFO] [stdout] --> src/code_319.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn bulb_switch(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `coin_change` is never used [INFO] [stdout] --> src/code_322.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn coin_change(mut coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rob_internal` and `rob_2` are never used [INFO] [stdout] --> src/code_337.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn rob_internal(node: Option>>) -> (i32, i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn rob_2(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `integer_break` is never used [INFO] [stdout] --> src/code_343.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn integer_break(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_vowels` is never used [INFO] [stdout] --> src/code_345.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn reverse_vowels(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combination_sum4` is never used [INFO] [stdout] --> src/code_377.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn combination_sum4(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `byte_order` and `can_construct` are never used [INFO] [stdout] --> src/code_383.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn byte_order(byte: u8) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 8 | pub fn can_construct(ransom_note: String, magazine: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination` and `combination_sum` are never used [INFO] [stdout] --> src/code_39.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn combination(candidates: &Vec, index: usize, current: &mut Vec, sum: i32, target: i32, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_subsequence` is never used [INFO] [stdout] --> src/code_392.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_subsequence(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sum_of_left_leaves_internal` and `sum_of_left_leaves` are never used [INFO] [stdout] --> src/code_404.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn sum_of_left_leaves_internal(root: Option>>, is_left: bool) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn sum_of_left_leaves(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_strings` is never used [INFO] [stdout] --> src/code_415.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn add_strings(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trap` is never used [INFO] [stdout] --> src/code_42.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `jump` is never used [INFO] [stdout] --> src/code_45.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_content_children` is never used [INFO] [stdout] --> src/code_455.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_content_children(mut g: Vec, mut s: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `permute_internal` and `permute` are never used [INFO] [stdout] --> src/code_46.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn permute_internal(remain: &mut Vec, current: &mut Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `permute_unique_internal` and `permute_unique` are never used [INFO] [stdout] --> src/code_47.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn permute_unique_internal(remain: &mut Vec, current: &mut Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn permute_unique(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_form` is never used [INFO] [stdout] --> src/code_474.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn find_max_form(strs: Vec, m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_consecutive_ones` is never used [INFO] [stdout] --> src/code_485.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_max_consecutive_ones(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `next_greater_element` is never used [INFO] [stdout] --> src/code_496.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn next_greater_element(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `double_palindrome_length_of`, `single_palindrome_length_of`, and `longest_palindrome` are never used [INFO] [stdout] --> src/code_5.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn double_palindrome_length_of(data: &Vec, index: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn single_palindrome_length_of(data: &Vec, index: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_words` is never used [INFO] [stdout] --> src/code_500.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_words(words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `next_greater_elements` is never used [INFO] [stdout] --> src/code_503.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn next_greater_elements(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `convert_to_base7` is never used [INFO] [stdout] --> src/code_504.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn convert_to_base7(mut num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `fib` is never used [INFO] [stdout] --> src/code_509.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn fib(n: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `change` is never used [INFO] [stdout] --> src/code_518.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn change(amount: i32, coins: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `letter_is_upper` and `detect_capital_use` are never used [INFO] [stdout] --> src/code_520.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | [INFO] [stdout] 5 | fn letter_is_upper(char: u8) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 9 | pub fn detect_capital_use(word: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/code_53.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `update_matrix` is never used [INFO] [stdout] --> src/code_542.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn update_matrix(mat: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `depth_of` and `diameter_of_binary_tree` are never used [INFO] [stdout] --> src/code_543.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | fn depth_of(root: Option>>, result: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_jump` is never used [INFO] [stdout] --> src/code_55.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_record` is never used [INFO] [stdout] --> src/code_551.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn check_record(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `array_pair_sum` is never used [INFO] [stdout] --> src/code_561.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn array_pair_sum(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_place_flowers` is never used [INFO] [stdout] --> src/code_605.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn can_place_flowers(mut flowerbed: Vec, n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `tree2str` is never used [INFO] [stdout] --> src/code_606.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn tree2str(root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths` is never used [INFO] [stdout] --> src/code_62.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_substrings` is never used [INFO] [stdout] --> src/code_647.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `construct_internal` and `construct_maximum_binary_tree` are never used [INFO] [stdout] --> src/code_654.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn construct_internal(nums: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn construct_maximum_binary_tree(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `judge_circle` is never used [INFO] [stdout] --> src/code_657.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn judge_circle(moves: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `plus_one` is never used [INFO] [stdout] --> src/code_66.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `climb_stairs` is never used [INFO] [stdout] --> src/code_70.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/code_704.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyLinkedList` is never constructed [INFO] [stdout] --> src/code_707.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | struct MyLinkedList { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, `add_at_head`, `add_at_tail`, `add_at_index`, and `delete_at_index` are never used [INFO] [stdout] --> src/code_707.rs:64:8 [INFO] [stdout] | [INFO] [stdout] 63 | impl MyLinkedList { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 64 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn get(&self, index: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn add_at_head(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn add_at_tail(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn add_at_index(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `simplify_path` is never used [INFO] [stdout] --> src/code_71.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn simplify_path(path: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `asteroid_collision` is never used [INFO] [stdout] --> src/code_735.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn asteroid_collision(asteroids: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subsets` and `subset_internal` are never used [INFO] [stdout] --> src/code_78.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn subset_internal( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `all_paths_source_target` and `all_paths_source_target_internal` are never used [INFO] [stdout] --> src/code_797.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn all_paths_source_target(graph: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn all_paths_source_target_internal( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `similar_rgb` and `find_similar_color` are never used [INFO] [stdout] --> src/code_800.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn similar_rgb(color: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn find_similar_color(color: impl AsRef) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_decodings` is never used [INFO] [stdout] --> src/code_91.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_decodings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `validate_stack_sequences` is never used [INFO] [stdout] --> src/code_946.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn validate_stack_sequences(mut pushed: Vec, mut popped: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_valid_bst` and `in_order_visit` are never used [INFO] [stdout] --> src/code_98.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn in_order_visit( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_target_sum_ways` is never used [INFO] [stdout] --> src/code_494.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn find_target_sum_ways(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `valid_path` is never used [INFO] [stdout] --> src/code_1971.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn valid_path(n: i32, edges: Vec>, source: i32, destination: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `has_next_valid_step` and `check_valid_grid` are never used [INFO] [stdout] --> src/code_2596.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn has_next_valid_step((current_x, current_y): (i32, i32), step: i32, grid: &Vec>) -> Option<(i32, i32)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn check_valid_grid(mut grid: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/code_48.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths_with_obstacles` is never used [INFO] [stdout] --> src/code_63.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_path_sum` is never used [INFO] [stdout] --> src/code_64.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_binary` is never used [INFO] [stdout] --> src/code_67.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn add_binary(mut a: String, mut b: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `set_zeroes_to_vec` and `set_zeroes` are never used [INFO] [stdout] --> src/code_73.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn set_zeroes_to_vec((x, y): (usize, usize), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `clone_trees`, `insert_into_node`, `visit_child_and_insert`, and `generate_trees` are never used [INFO] [stdout] --> src/code_95.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn clone_trees(node: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | fn insert_into_node(target: i32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn visit_child_and_insert(target: i32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn generate_trees(n: i32) -> Vec>>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `path_sum_internal` and `path_sum` are never used [INFO] [stdout] --> src/code_113.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | fn path_sum_internal(target_sum: i32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn path_sum(root: Option>>, target_sum: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_total` is never used [INFO] [stdout] --> src/code_120.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_missing_ranges` is never used [INFO] [stdout] --> src/code_163.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_missing_ranges(nums: Vec, lower: i32, upper: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `give_gem` is never used [INFO] [stdout] --> src/code_lcp_50.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn give_gem(mut gem: Vec, operations: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `validate_palindrome` and `valid_palindrome` are never used [INFO] [stdout] --> src/code_680.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn validate_palindrome(s: &[char], [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn valid_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_binary_substrings` is never used [INFO] [stdout] --> src/code_696.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_binary_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `to_lower_case` is never used [INFO] [stdout] --> src/code_709.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn to_lower_case(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `digit_count` is never used [INFO] [stdout] --> src/code_2283.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn digit_count(num: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_nodes` is never used [INFO] [stdout] --> src/code_222.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn count_nodes(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `defang_i_paddr` is never used [INFO] [stdout] --> src/code_1108.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn defang_i_paddr(address: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_interleave` is never used [INFO] [stdout] --> src/code_97.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn is_interleave(s1: String, s2: String, s3: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_armstrong` is never used [INFO] [stdout] --> src/code_1134.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_armstrong(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_days` is never used [INFO] [stdout] --> src/code_1118.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn number_of_days(year: i32, month: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_vowels` is never used [INFO] [stdout] --> src/code_1119.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn remove_vowels(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_unique_number` is never used [INFO] [stdout] --> src/code_1133.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn largest_unique_number(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `missing_number` is never used [INFO] [stdout] --> src/code_1228.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn missing_number(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_straight_line` is never used [INFO] [stdout] --> src/code_1232.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn check_straight_line(coordinates: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `transform_array` is never used [INFO] [stdout] --> src/code_1243.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn transform_array(mut arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `hammingWeight` should have a snake case name [INFO] [stdout] --> src/code_191.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn hammingWeight (n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `hamming_weight` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/code_200.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | if 0 > x || x >= grid.len() { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/code_200.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | if 0 > y || y >= grid[0].len() { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024 [INFO] [stdout] --> src/code_21.rs:17:15 [INFO] [stdout] | [INFO] [stdout] 17 | while let (Some(n1), Some(n2)) = (list1.as_ref(), list2.as_ref()) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^-----^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | this value has a significant drop implementation which may observe a major change in drop order and requires your discretion [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #124085 [INFO] [stdout] help: the value is now dropped here in Edition 2024 [INFO] [stdout] --> src/code_21.rs:29:9 [INFO] [stdout] | [INFO] [stdout] 29 | } [INFO] [stdout] | ^ [INFO] [stdout] = note: `--force-warn if-let-rescope` implied by `--force-warn rust-2024-compatibility` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024 [INFO] [stdout] --> src/code_21.rs:31:15 [INFO] [stdout] | [INFO] [stdout] 31 | while let Some(n2) = list2.as_ref() { [INFO] [stdout] | ^^^^^^^^^^^^^^^-----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | this value has a significant drop implementation which may observe a major change in drop order and requires your discretion [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #124085 [INFO] [stdout] help: the value is now dropped here in Edition 2024 [INFO] [stdout] --> src/code_21.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | } [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024 [INFO] [stdout] --> src/code_21.rs:41:15 [INFO] [stdout] | [INFO] [stdout] 41 | while let Some(n1) = list1.as_ref() { [INFO] [stdout] | ^^^^^^^^^^^^^^^-----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | this value has a significant drop implementation which may observe a major change in drop order and requires your discretion [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #124085 [INFO] [stdout] help: the value is now dropped here in Edition 2024 [INFO] [stdout] --> src/code_21.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | } [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 155 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:59:13 [INFO] [stdout] | [INFO] [stdout] 59 | tree_node_of![1, 2, 3, -1, -1, 7], [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:60:13 [INFO] [stdout] | [INFO] [stdout] 60 | tree_node_of![1, 2, 3, 4, -1, -1, -1] [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_101.rs:51:39 [INFO] [stdout] | [INFO] [stdout] 51 | assert_eq!(Solution::is_symmetric(tree_node_of![1, 2, 2, -1, 3, -1, 3]), false); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_102.rs:56:38 [INFO] [stdout] | [INFO] [stdout] 56 | assert_eq!(Solution::level_order(tree_node_of![]), Vec::>::new()); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_111.rs:32:40 [INFO] [stdout] | [INFO] [stdout] 32 | println!("{}", Solution::min_depth(tree_node_of![3,9,20,-1,-1,15,7])); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:53:42 [INFO] [stdout] | [INFO] [stdout] 53 | assert_eq!(Solution::remove_elements(list_node_of![1,2,3,4,5], 6), list_node_of!(1,2,3,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:53:72 [INFO] [stdout] | [INFO] [stdout] 53 | assert_eq!(Solution::remove_elements(list_node_of![1,2,3,4,5], 6), list_node_of!(1,2,3,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_226.rs:25:44 [INFO] [stdout] | [INFO] [stdout] 25 | println!("{:?}", Solution::invert_tree(tree_node_of![1,2,3,4,5,6,7])); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_235.rs:50:55 [INFO] [stdout] | [INFO] [stdout] 50 | println!("{:?}", Solution::lowest_common_ancestor(tree_node_of![1,2,3,4,5,6,7,8,9], [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_235.rs:51:55 [INFO] [stdout] | [INFO] [stdout] 51 | ... tree_node_of![4], [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_235.rs:52:55 [INFO] [stdout] | [INFO] [stdout] 52 | ... tree_node_of![3]).unwrap().borrow().val); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_257.rs:42:50 [INFO] [stdout] | [INFO] [stdout] 42 | println!("{:?}", Solution::binary_tree_paths(tree_node_of![1,2,3,4,5,6,7])); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_337.rs:32:38 [INFO] [stdout] | [INFO] [stdout] 32 | println!("{:?}", Solution::rob_2(tree_node_of![ 4,1, -1, 2, -1, 3])); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_404.rs:43:49 [INFO] [stdout] | [INFO] [stdout] 43 | println!("{}", Solution::sum_of_left_leaves(tree_node_of![3,-1, 1])); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_543.rs:37:50 [INFO] [stdout] | [INFO] [stdout] 37 | assert_eq!(Solution::diameter_of_binary_tree(tree_node_of![1, 2]), 1); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_606.rs:40:35 [INFO] [stdout] | [INFO] [stdout] 40 | assert_eq!(Solution::tree2str(tree_node_of![1, 2, 3, 4]), "1(2(4))(3)"); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_98.rs:60:32 [INFO] [stdout] | [INFO] [stdout] 60 | Solution::is_valid_bst(tree_node_of![1, -1, 1]), [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_113.rs:51:29 [INFO] [stdout] | [INFO] [stdout] 51 | dbg!(Solution::path_sum(tree_node_of![5,4,8,11,-1,13,4,7,2,-1,-1,5,1], 22)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_98.rs:56:32 [INFO] [stdout] | [INFO] [stdout] 56 | Solution::is_valid_bst(tree_node_of![5, 1, 4, -1, -1, 3, 6]), [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_98.rs:54:39 [INFO] [stdout] | [INFO] [stdout] 54 | assert_eq!(Solution::is_valid_bst(tree_node_of![2, 1, 3]), true); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_606.rs:39:35 [INFO] [stdout] | [INFO] [stdout] 39 | assert_eq!(Solution::tree2str(tree_node_of![1, 2, 3, -1, 4]), "1(2()(4))(3)"); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_543.rs:34:43 [INFO] [stdout] | [INFO] [stdout] 34 | Solution::diameter_of_binary_tree(tree_node_of![1, 2, 3, 4, 5]), [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:52:72 [INFO] [stdout] | [INFO] [stdout] 52 | assert_eq!(Solution::remove_elements(list_node_of![1,1,3,4,5], 1), list_node_of!(3,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:52:42 [INFO] [stdout] | [INFO] [stdout] 52 | assert_eq!(Solution::remove_elements(list_node_of![1,1,3,4,5], 1), list_node_of!(3,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:51:72 [INFO] [stdout] | [INFO] [stdout] 51 | assert_eq!(Solution::remove_elements(list_node_of![1,2,3,4,5], 1), list_node_of!(2,3,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:51:42 [INFO] [stdout] | [INFO] [stdout] 51 | assert_eq!(Solution::remove_elements(list_node_of![1,2,3,4,5], 1), list_node_of!(2,3,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:50:72 [INFO] [stdout] | [INFO] [stdout] 50 | assert_eq!(Solution::remove_elements(list_node_of![1,2,3,4,5], 3), list_node_of!(1,2,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `list_node_of` in this scope [INFO] [stdout] --> src/code_203.rs:50:42 [INFO] [stdout] | [INFO] [stdout] 50 | assert_eq!(Solution::remove_elements(list_node_of![1,2,3,4,5], 3), list_node_of!(1,2,4,5)); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::list_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_111.rs:31:40 [INFO] [stdout] | [INFO] [stdout] 31 | println!("{}", Solution::min_depth(tree_node_of![2, -1, 3, -1, 4, -1, 5, -1 ,6])); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_102.rs:55:38 [INFO] [stdout] | [INFO] [stdout] 55 | assert_eq!(Solution::level_order(tree_node_of![1]), vec![vec![1]]); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_102.rs:54:38 [INFO] [stdout] | [INFO] [stdout] 54 | assert_eq!(Solution::level_order(tree_node_of![3,9,20,-1,-1,15,7]), vec![vec![3], vec![9,20], vec![15,7]]); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_101.rs:50:39 [INFO] [stdout] | [INFO] [stdout] 50 | assert_eq!(Solution::is_symmetric(tree_node_of![1, 2, 2, 3, 4, 4, 3]), true); [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:53:13 [INFO] [stdout] | [INFO] [stdout] 53 | tree_node_of![1, 2, 3, 4, 5, -1, 7] [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | tree_node_of![1, 2, 3, 4, 5, -1, 7], [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | tree_node_of![1, 2, 3, 4, 5, 6, 7] [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | tree_node_of![1, 2, 3, 2, 5, 6, 7], [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:39:13 [INFO] [stdout] | [INFO] [stdout] 39 | tree_node_of![1, 2, 3, 4, 5, 6, 7] [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: cannot find macro `tree_node_of` in this scope [INFO] [stdout] --> src/code_100.rs:38:13 [INFO] [stdout] | [INFO] [stdout] 38 | tree_node_of![1, 2, 3, 4, 5, 6, 7], [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: consider importing this macro [INFO] [stdout] | [INFO] [stdout] 1 + use Base::tree_node_of; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `to_owned_string` found for struct `Vec<&str>` in the current scope [INFO] [stdout] --> src/code_1005.rs:25:110 [INFO] [stdout] | [INFO] [stdout] 25 | println!("{}", Solution::find_string(vec!["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""].to_owned_string(), "ball".in... [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/vec_string_convert.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | fn to_owned_string(&self) -> Vec; [INFO] [stdout] | --------------- the method is available for `Vec<&str>` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `Vec2OwnedString` which provides `to_owned_string` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::vec_string_convert::Vec2OwnedString; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_owned` with a similar name [INFO] [stdout] | [INFO] [stdout] 25 | println!("{}", Solution::find_string(vec!["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""].to_owned(), "ball".into())) [INFO] [stdout] | ~~~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `to_owned_string` found for struct `Vec<&str>` in the current scope [INFO] [stdout] --> src/code_14.rs:39:79 [INFO] [stdout] | [INFO] [stdout] 39 | println!("{}", Solution::longest_common_prefix(vec!["asd", "asggh", "as"].to_owned_string())); [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/vec_string_convert.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | fn to_owned_string(&self) -> Vec; [INFO] [stdout] | --------------- the method is available for `Vec<&str>` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `Vec2OwnedString` which provides `to_owned_string` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 2 + use Base::vec_string_convert::Vec2OwnedString; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_owned` with a similar name [INFO] [stdout] | [INFO] [stdout] 39 | println!("{}", Solution::longest_common_prefix(vec!["asd", "asggh", "as"].to_owned())); [INFO] [stdout] | ~~~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `to_owned_string` found for struct `Vec<&str>` in the current scope [INFO] [stdout] --> src/code_474.rs:41:54 [INFO] [stdout] | [INFO] [stdout] 41 | Solution::find_max_form(vec!["10", "0", "1"].to_owned_string(), 1, 1) [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/vec_string_convert.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | fn to_owned_string(&self) -> Vec; [INFO] [stdout] | --------------- the method is available for `Vec<&str>` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `Vec2OwnedString` which provides `to_owned_string` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 2 + use Base::vec_string_convert::Vec2OwnedString; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_owned` with a similar name [INFO] [stdout] | [INFO] [stdout] 41 | Solution::find_max_form(vec!["10", "0", "1"].to_owned(), 1, 1) [INFO] [stdout] | ~~~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 2]; 10]` in the current scope [INFO] [stdout] --> src/code_1971.rs:73:106 [INFO] [stdout] | [INFO] [stdout] 73 | println!("{}", Solution::valid_path(6, [[0,7],[0,8],[6,1],[2,0],[0,4],[5,8],[4,7],[1,3],[3,5],[6,5]].into_vec(), 7, 5)); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 2]; 10]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 73 | println!("{}", Solution::valid_path(6, [[0,7],[0,8],[6,1],[2,0],[0,4],[5,8],[4,7],[1,3],[3,5],[6,5]].to_vec(), 7, 5)); [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 5]; 5]` in the current scope [INFO] [stdout] --> src/code_2596.rs:78:124 [INFO] [stdout] | [INFO] [stdout] 78 | println!("{}", Solution::check_valid_grid([[0,11,16,5,20],[17,4,19,10,15],[12,1,8,21,6],[3,18,23,14,9],[24,13,2,7,22]].into_vec())) [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 5]; 5]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 78 | println!("{}", Solution::check_valid_grid([[0,11,16,5,20],[17,4,19,10,15],[12,1,8,21,6],[3,18,23,14,9],[24,13,2,7,22]].to_vec())) [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 3]; 3]` in the current scope [INFO] [stdout] --> src/code_48.rs:34:45 [INFO] [stdout] | [INFO] [stdout] 34 | let mut vec = [[1,2,3],[4,5,6],[7,8,9]].into_vec(); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 3]; 3]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 34 | let mut vec = [[1,2,3],[4,5,6],[7,8,9]].to_vec(); [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 3]; 3]` in the current scope [INFO] [stdout] --> src/code_63.rs:44:43 [INFO] [stdout] | [INFO] [stdout] 44 | [[0, 0, 0], [0, 0, 0], [0, 0, 0]].into_vec())); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 3]; 3]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 44 | [[0, 0, 0], [0, 0, 0], [0, 0, 0]].to_vec())); [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 3]; 2]` in the current scope [INFO] [stdout] --> src/code_64.rs:34:56 [INFO] [stdout] | [INFO] [stdout] 34 | dbg!(Solution::min_path_sum([[1, 2, 3], [4, 5, 6]].into_vec())); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 3]; 2]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 34 | dbg!(Solution::min_path_sum([[1, 2, 3], [4, 5, 6]].to_vec())); [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 4]; 3]` in the current scope [INFO] [stdout] --> src/code_73.rs:48:52 [INFO] [stdout] | [INFO] [stdout] 48 | let mut data = [[0,1,2,0],[3,4,5,2],[1,3,1,5]].into_vec(); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 4]; 3]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 48 | let mut data = [[0,1,2,0],[3,4,5,2],[1,3,1,5]].to_vec(); [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 2]; 4]` in the current scope [INFO] [stdout] --> src/code_lcp_50.rs:32:75 [INFO] [stdout] | [INFO] [stdout] 32 | dbg!(Solution::give_gem(vec![100,0,50,100], [[0,2],[0,1],[3,0],[3,0]].into_vec())); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 2]; 4]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 32 | dbg!(Solution::give_gem(vec![100,0,50,100], [[0,2],[0,1],[3,0],[3,0]].to_vec())); [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `into_vec` found for array `[[{integer}; 2]; 3]` in the current scope [INFO] [stdout] --> src/code_1232.rs:35:65 [INFO] [stdout] | [INFO] [stdout] 35 | dbg!(Solution::check_straight_line([[2, 1], [4, 2], [6, 3]].into_vec())); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] ::: /tmp/fixit/base/src/into_vec.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | fn into_vec(self) -> Vec; [INFO] [stdout] | -------- the method is available for `[[{integer}; 2]; 3]` here [INFO] [stdout] | [INFO] [stdout] = help: items from traits can only be used if the trait is in scope [INFO] [stdout] help: trait `IntoVec` which provides `into_vec` is implemented but not in scope; perhaps you want to import it [INFO] [stdout] | [INFO] [stdout] 1 + use Base::into_vec::IntoVec; [INFO] [stdout] | [INFO] [stdout] help: there is a method `to_vec` with a similar name [INFO] [stdout] | [INFO] [stdout] 35 | dbg!(Solution::check_straight_line([[2, 1], [4, 2], [6, 3]].to_vec())); [INFO] [stdout] | ~~~~~~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `current_level` is never read [INFO] [stdout] --> src/code_102.rs:18:17 [INFO] [stdout] | [INFO] [stdout] 18 | let mut current_level = Vec::>>::new(); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `read_count` is assigned to, but never used [INFO] [stdout] --> src/code_157.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | let mut read_count = 0; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_read_count` instead [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable pattern [INFO] [stdout] --> src/code_657.rs:17:13 [INFO] [stdout] | [INFO] [stdout] 11 | 'D' => { [INFO] [stdout] | --- matches all the relevant values [INFO] [stdout] ... [INFO] [stdout] 17 | 'D' => { [INFO] [stdout] | ^^^ no value can reach this [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/code_1971.rs:6:23 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn valid_path(n: i32, edges: Vec>, source: i32, destination: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> src/code_64.rs:7:49 [INFO] [stdout] | [INFO] [stdout] 7 | grid.into_iter().enumerate().for_each(|(y, value)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_y` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/code_95.rs:59:31 [INFO] [stdout] | [INFO] [stdout] 59 | fn visit_child_and_insert(target: i32, [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/code_95.rs:60:31 [INFO] [stdout] | [INFO] [stdout] 60 | ... node: Rc>, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/code_95.rs:61:31 [INFO] [stdout] | [INFO] [stdout] 61 | ... result: &mut Vec>>) { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `allow_deletion` is never read [INFO] [stdout] --> src/code_680.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | allow_deletion = false; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `left` [INFO] [stdout] --> src/code_680.rs:16:21 [INFO] [stdout] | [INFO] [stdout] 16 | let left =s[*left_index]; [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_left` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `right` [INFO] [stdout] --> src/code_680.rs:17:21 [INFO] [stdout] | [INFO] [stdout] 17 | let right = s[*right_index]; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_right` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `left_left` [INFO] [stdout] --> src/code_680.rs:18:21 [INFO] [stdout] | [INFO] [stdout] 18 | let left_left = s[*left_index + 1]; [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_left` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `right_right` [INFO] [stdout] --> src/code_680.rs:19:21 [INFO] [stdout] | [INFO] [stdout] 19 | let right_right = s[*right_index - 1]; [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_right_right` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `scan_index` is never read [INFO] [stdout] --> src/code_696.rs:9:17 [INFO] [stdout] | [INFO] [stdout] 9 | let mut scan_index = start_index; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 49 previous errors; 14 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] For more information about this error, try `rustc --explain E0599`. [INFO] [stdout] [INFO] [stderr] error: could not compile `code` (bin "code" test) due to 50 previous errors; 14 warnings emitted [INFO] [stderr] error: failed to migrate to next edition [INFO] [stderr] [INFO] [stderr] Caused by: [INFO] [stderr] process didn't exit successfully: `cargo fix --edition --allow-no-vcs --allow-dirty --frozen --all --all-targets --message-format=json` (exit status: 101) [INFO] running `Command { std: "docker" "inspect" "8faaa9087371a272d4cc345f561f26f241be3319191aa9bfdf3374593aac616e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8faaa9087371a272d4cc345f561f26f241be3319191aa9bfdf3374593aac616e", kill_on_drop: false }` [INFO] [stdout] 8faaa9087371a272d4cc345f561f26f241be3319191aa9bfdf3374593aac616e