[INFO] cloning repository https://github.com/tolumide-ng/coding-challenge [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/tolumide-ng/coding-challenge" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftolumide-ng%2Fcoding-challenge", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftolumide-ng%2Fcoding-challenge'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 93d2bd467620ad7d1d06b0ca8e9c5d4eecdf6e4f [INFO] checking tolumide-ng/coding-challenge against try#15a786332e2f0dd343b226ab6bb8ec028a350f73 for pr-81782 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftolumide-ng%2Fcoding-challenge" "/workspace/builds/worker-2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/tolumide-ng/coding-challenge on toolchain 15a786332e2f0dd343b226ab6bb8ec028a350f73 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+15a786332e2f0dd343b226ab6bb8ec028a350f73" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/tolumide-ng/coding-challenge [INFO] finished tweaking git repo https://github.com/tolumide-ng/coding-challenge [INFO] tweaked toml for git repo https://github.com/tolumide-ng/coding-challenge written to /workspace/builds/worker-2/source/Cargo.toml [INFO] crate git repo https://github.com/tolumide-ng/coding-challenge already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+15a786332e2f0dd343b226ab6bb8ec028a350f73" "fetch" "--locked" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:f2f6bcd4b43ebee4e173f653a26493129bdb64017c85f916b780ca7fbdbaa79d" "/opt/rustwide/cargo-home/bin/cargo" "+15a786332e2f0dd343b226ab6bb8ec028a350f73" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] c799e2439ac5c8307c35546b90d50c1decbf5832e5c17cac383f432eba3f5908 [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "c799e2439ac5c8307c35546b90d50c1decbf5832e5c17cac383f432eba3f5908", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "c799e2439ac5c8307c35546b90d50c1decbf5832e5c17cac383f432eba3f5908", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "c799e2439ac5c8307c35546b90d50c1decbf5832e5c17cac383f432eba3f5908", kill_on_drop: false }` [INFO] [stdout] c799e2439ac5c8307c35546b90d50c1decbf5832e5c17cac383f432eba3f5908 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:f2f6bcd4b43ebee4e173f653a26493129bdb64017c85f916b780ca7fbdbaa79d" "/opt/rustwide/cargo-home/bin/cargo" "+15a786332e2f0dd343b226ab6bb8ec028a350f73" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] 6d7958363129950c2a6f09a6a2dd714467a3728d04f5a431a065057d87e3e82d [INFO] running `Command { std: "docker" "start" "-a" "6d7958363129950c2a6f09a6a2dd714467a3728d04f5a431a065057d87e3e82d", kill_on_drop: false }` [INFO] [stderr] Checking data_structures v0.1.0 (/opt/rustwide/workdir/data_structures) [INFO] [stderr] Checking dynamic_pg v0.1.0 (/opt/rustwide/workdir/dynamic_pg) [INFO] [stdout] warning: unused import: `std::cmp` [INFO] [stdout] --> dynamic_pg/src/dynamic_programming/grid_traveller.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cmp; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> dynamic_pg/src/dynamic_programming/how_sum.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/dnode.rs:79:9 [INFO] [stdout] | [INFO] [stdout] 79 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:267:9 [INFO] [stdout] | [INFO] [stdout] 267 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:129:9 [INFO] [stdout] | [INFO] [stdout] 129 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/node.rs:29:9 [INFO] [stdout] | [INFO] [stdout] 29 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/nth_from_last.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use super::node::{Node, NodeOption}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/nth_from_last.rs:72:9 [INFO] [stdout] | [INFO] [stdout] 72 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `NodeRef` [INFO] [stdout] --> data_structures/src/linked_lists/reversed_linked_lists.rs:2:31 [INFO] [stdout] | [INFO] [stdout] 2 | use super::node::{NodeOption, NodeRef}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp` [INFO] [stdout] --> dynamic_pg/src/dynamic_programming/grid_traveller.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cmp; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> dynamic_pg/src/dynamic_programming/how_sum.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/nth_from_last.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use super::node::{Node, NodeOption}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `NodeRef` [INFO] [stdout] --> data_structures/src/linked_lists/reversed_linked_lists.rs:2:31 [INFO] [stdout] | [INFO] [stdout] 2 | use super::node::{NodeOption, NodeRef}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:52:18 [INFO] [stdout] | [INFO] [stdout] 52 | Some(head) => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:93:26 [INFO] [stdout] | [INFO] [stdout] 93 | Some(x) => {} [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> data_structures/src/linked_lists/linked_palindrome.rs:11:17 [INFO] [stdout] | [INFO] [stdout] 11 | let mut original_list = Some(Rc::clone(self.head.as_ref().unwrap())); [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:73:8 [INFO] [stdout] | [INFO] [stdout] 73 | fn add_at_index(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `val` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | val: i32, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `next` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | next: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `head` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:13:5 [INFO] [stdout] | [INFO] [stdout] 13 | head: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_cycle` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | fn has_cycle(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `cycle_position` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | fn cycle_position(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_interception` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | fn get_interception(&self) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_head` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | fn add_at_head(&mut self, value: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_tail` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn add_at_tail(&mut self, value: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | fn get(&self, index: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | fn add_at_index(&mut self, index: i32, value: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:137:8 [INFO] [stdout] | [INFO] [stdout] 137 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `en_queue` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | fn en_queue(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `de_queue` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn de_queue(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `front` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn front(&self) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rear` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn rear(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_full` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:97:8 [INFO] [stdout] | [INFO] [stdout] 97 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:52:18 [INFO] [stdout] | [INFO] [stdout] 52 | Some(head) => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:93:26 [INFO] [stdout] | [INFO] [stdout] 93 | Some(x) => {} [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Map` that must be used [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:41:21 [INFO] [stdout] | [INFO] [stdout] 41 | / vec_safe.iter().map(|val| { [INFO] [stdout] 42 | | if Rc::as_ptr(curr) == Rc::as_ptr(val) { [INFO] [stdout] 43 | | is_intercept = true; [INFO] [stdout] 44 | | intercept = Some(Rc::clone(curr)); [INFO] [stdout] 45 | | } [INFO] [stdout] 46 | | }); [INFO] [stdout] | |_______________________^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: iterators are lazy and do nothing unless consumed [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 39 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Checking algorithms v0.1.0 (/opt/rustwide/workdir/algorithms) [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> data_structures/src/linked_lists/linked_palindrome.rs:11:17 [INFO] [stdout] | [INFO] [stdout] 11 | let mut original_list = Some(Rc::clone(self.head.as_ref().unwrap())); [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:73:8 [INFO] [stdout] | [INFO] [stdout] 73 | fn add_at_index(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `val` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | val: i32, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `next` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | next: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `head` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:13:5 [INFO] [stdout] | [INFO] [stdout] 13 | head: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_cycle` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | fn has_cycle(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `cycle_position` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | fn cycle_position(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_interception` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | fn get_interception(&self) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> algorithms/src/the_algos/two_sums.rs:69:9 [INFO] [stdout] | [INFO] [stdout] 69 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Map` that must be used [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:41:21 [INFO] [stdout] | [INFO] [stdout] 41 | / vec_safe.iter().map(|val| { [INFO] [stdout] 42 | | if Rc::as_ptr(curr) == Rc::as_ptr(val) { [INFO] [stdout] 43 | | is_intercept = true; [INFO] [stdout] 44 | | intercept = Some(Rc::clone(curr)); [INFO] [stdout] 45 | | } [INFO] [stdout] 46 | | }); [INFO] [stdout] | |_______________________^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: iterators are lazy and do nothing unless consumed [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 21 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Node`, `TheNode` [INFO] [stdout] --> data_structures/src/binary_tree/in_order_traversal.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, Node, TheNode}; [INFO] [stdout] | ^^^^ ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TheNode` [INFO] [stdout] --> data_structures/src/binary_tree/level_order_traversal.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, TheNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/binary_tree/level_order_traversal.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TheNode` [INFO] [stdout] --> data_structures/src/binary_tree/lowest_common_ancestor.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, TheNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Node`, `TheNode` [INFO] [stdout] --> data_structures/src/binary_tree/post_order_traversal.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, Node, TheNode}; [INFO] [stdout] | ^^^^ ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Node`, `TheNode` [INFO] [stdout] --> data_structures/src/binary_tree/pre_order_traversal.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, Node, TheNode}; [INFO] [stdout] | ^^^^ ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/binary_tree/pre_order_traversal.rs:78:9 [INFO] [stdout] | [INFO] [stdout] 78 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/binary_tree/priority_queue.rs:250:9 [INFO] [stdout] | [INFO] [stdout] 250 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/dnode.rs:79:9 [INFO] [stdout] | [INFO] [stdout] 79 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:267:9 [INFO] [stdout] | [INFO] [stdout] 267 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:129:9 [INFO] [stdout] | [INFO] [stdout] 129 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/node.rs:29:9 [INFO] [stdout] | [INFO] [stdout] 29 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/nth_from_last.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use super::node::{Node, NodeOption}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> data_structures/src/linked_lists/nth_from_last.rs:72:9 [INFO] [stdout] | [INFO] [stdout] 72 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `NodeRef` [INFO] [stdout] --> data_structures/src/linked_lists/reversed_linked_lists.rs:2:31 [INFO] [stdout] | [INFO] [stdout] 2 | use super::node::{NodeOption, NodeRef}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> data_structures/src/binary_tree/in_order_traversal.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, Node, TheNode}; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> data_structures/src/binary_tree/post_order_traversal.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, Node, TheNode}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> data_structures/src/binary_tree/pre_order_traversal.rs:1:54 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::binary_tree::priority_queue::{BinaryHeap, Node, TheNode}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/nth_from_last.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use super::node::{Node, NodeOption}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `NodeRef` [INFO] [stdout] --> data_structures/src/linked_lists/reversed_linked_lists.rs:2:31 [INFO] [stdout] | [INFO] [stdout] 2 | use super::node::{NodeOption, NodeRef}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `build_tree` [INFO] [stdout] --> algorithms/src/the_algos/bt_from_list.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn build_tree( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `recursive_build_tree` [INFO] [stdout] --> algorithms/src/the_algos/bt_from_list.rs:37:4 [INFO] [stdout] | [INFO] [stdout] 37 | fn recursive_build_tree( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `build_tree` [INFO] [stdout] --> algorithms/src/the_algos/bt_from_preorder_inorder.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn build_tree( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `recursive_build_tree` [INFO] [stdout] --> algorithms/src/the_algos/bt_from_preorder_inorder.rs:37:4 [INFO] [stdout] | [INFO] [stdout] 37 | fn recursive_build_tree( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Yes` [INFO] [stdout] --> algorithms/src/the_algos/sherlock_and_the_valid_string.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | Yes, [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `No` [INFO] [stdout] --> algorithms/src/the_algos/sherlock_and_the_valid_string.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | No, [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `valid_string` [INFO] [stdout] --> algorithms/src/the_algos/sherlock_and_the_valid_string.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn valid_string(input: &str) -> Answer { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `total` [INFO] [stdout] --> algorithms/src/the_algos/sunset.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | total: usize, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `buildings` [INFO] [stdout] --> algorithms/src/the_algos/sunset.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | buildings: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 10 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> algorithms/src/the_algos/lowest_common_ancestor.rs:122:9 [INFO] [stdout] | [INFO] [stdout] 122 | let mut root = Some(Rc::new(RefCell::new(root))); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> data_structures/src/binary_tree/lowest_common_ancestor.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | x: T, [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> data_structures/src/binary_tree/lowest_common_ancestor.rs:16:9 [INFO] [stdout] | [INFO] [stdout] 16 | y: T, [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_y` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> data_structures/src/binary_tree/lowest_common_ancestor.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 17 | root: usize, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `curr` is never read [INFO] [stdout] --> data_structures/src/binary_tree/serialize_deserialize.rs:102:17 [INFO] [stdout] | [INFO] [stdout] 102 | let mut curr: TreeNodeType = None; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:52:18 [INFO] [stdout] | [INFO] [stdout] 52 | Some(head) => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:93:26 [INFO] [stdout] | [INFO] [stdout] 93 | Some(x) => {} [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> data_structures/src/linked_lists/linked_palindrome.rs:11:17 [INFO] [stdout] | [INFO] [stdout] 11 | let mut original_list = Some(Rc::clone(self.head.as_ref().unwrap())); [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recursive_in_order_traversal` [INFO] [stdout] --> data_structures/src/binary_tree/in_order_traversal.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn recursive_in_order_traversal(&self, start: Option) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `breadth_first_search` [INFO] [stdout] --> data_structures/src/binary_tree/level_order_traversal.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn breadth_first_search(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recusrive_post_order_traversal` [INFO] [stdout] --> data_structures/src/binary_tree/post_order_traversal.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn recusrive_post_order_traversal(&self, start: Option) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pre_order_traversal` [INFO] [stdout] --> data_structures/src/binary_tree/pre_order_traversal.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn pre_order_traversal(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pre_order_recursive` [INFO] [stdout] --> data_structures/src/binary_tree/pre_order_traversal.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn pre_order_recursive(&self, start: Option) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `TreeNodeType` [INFO] [stdout] --> data_structures/src/binary_tree/serialize_deserialize.rs:9:1 [INFO] [stdout] | [INFO] [stdout] 9 | type TreeNodeType = Option>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Codec` [INFO] [stdout] --> data_structures/src/binary_tree/serialize_deserialize.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> data_structures/src/binary_tree/serialize_deserialize.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `serialize` [INFO] [stdout] --> data_structures/src/binary_tree/serialize_deserialize.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | fn serialize(&self, root: TreeNodeType) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `deserialize` [INFO] [stdout] --> data_structures/src/binary_tree/serialize_deserialize.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn deserialize(&self, data: String) -> TreeNodeType { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:73:8 [INFO] [stdout] | [INFO] [stdout] 73 | fn add_at_index(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `val` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | val: i32, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `next` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | next: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `head` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:13:5 [INFO] [stdout] | [INFO] [stdout] 13 | head: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_cycle` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | fn has_cycle(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `cycle_position` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | fn cycle_position(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_interception` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | fn get_interception(&self) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_head` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | fn add_at_head(&mut self, value: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_tail` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn add_at_tail(&mut self, value: i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | fn get(&self, index: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | fn add_at_index(&mut self, index: i32, value: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/single_ll.rs:137:8 [INFO] [stdout] | [INFO] [stdout] 137 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `en_queue` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | fn en_queue(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `de_queue` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn de_queue(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `front` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn front(&self) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rear` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn rear(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_full` [INFO] [stdout] --> data_structures/src/queues_stacks/circular_queue.rs:97:8 [INFO] [stdout] | [INFO] [stdout] 97 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Map` that must be used [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:41:21 [INFO] [stdout] | [INFO] [stdout] 41 | / vec_safe.iter().map(|val| { [INFO] [stdout] 42 | | if Rc::as_ptr(curr) == Rc::as_ptr(val) { [INFO] [stdout] 43 | | is_intercept = true; [INFO] [stdout] 44 | | intercept = Some(Rc::clone(curr)); [INFO] [stdout] 45 | | } [INFO] [stdout] 46 | | }); [INFO] [stdout] | |_______________________^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: iterators are lazy and do nothing unless consumed [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 61 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> data_structures/src/binary_tree/lowest_common_ancestor.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | x: T, [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> data_structures/src/binary_tree/lowest_common_ancestor.rs:16:9 [INFO] [stdout] | [INFO] [stdout] 16 | y: T, [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_y` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> data_structures/src/binary_tree/lowest_common_ancestor.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 17 | root: usize, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `curr` is never read [INFO] [stdout] --> data_structures/src/binary_tree/serialize_deserialize.rs:102:17 [INFO] [stdout] | [INFO] [stdout] 102 | let mut curr: TreeNodeType = None; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> data_structures/src/linked_lists/doubly_linked_list.rs:52:18 [INFO] [stdout] | [INFO] [stdout] 52 | Some(head) => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> data_structures/src/linked_lists/linked_rcs.rs:93:26 [INFO] [stdout] | [INFO] [stdout] 93 | Some(x) => {} [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> data_structures/src/linked_lists/linked_palindrome.rs:11:17 [INFO] [stdout] | [INFO] [stdout] 11 | let mut original_list = Some(Rc::clone(self.head.as_ref().unwrap())); [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:73:8 [INFO] [stdout] | [INFO] [stdout] 73 | fn add_at_index(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_at_index` [INFO] [stdout] --> data_structures/src/linked_lists/leet_singly_ll.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | fn delete_at_index(&mut self, index: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `val` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | val: i32, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `next` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | next: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `head` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:13:5 [INFO] [stdout] | [INFO] [stdout] 13 | head: Option>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_cycle` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | fn has_cycle(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `cycle_position` [INFO] [stdout] --> data_structures/src/linked_lists/linked_cycle_pos.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | fn cycle_position(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_interception` [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | fn get_interception(&self) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Map` that must be used [INFO] [stdout] --> data_structures/src/linked_lists/linked_lists_intercept.rs:41:21 [INFO] [stdout] | [INFO] [stdout] 41 | / vec_safe.iter().map(|val| { [INFO] [stdout] 42 | | if Rc::as_ptr(curr) == Rc::as_ptr(val) { [INFO] [stdout] 43 | | is_intercept = true; [INFO] [stdout] 44 | | intercept = Some(Rc::clone(curr)); [INFO] [stdout] 45 | | } [INFO] [stdout] 46 | | }); [INFO] [stdout] | |_______________________^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: iterators are lazy and do nothing unless consumed [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 28 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 3.68s [INFO] running `Command { std: "docker" "inspect" "6d7958363129950c2a6f09a6a2dd714467a3728d04f5a431a065057d87e3e82d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "6d7958363129950c2a6f09a6a2dd714467a3728d04f5a431a065057d87e3e82d", kill_on_drop: false }` [INFO] [stdout] 6d7958363129950c2a6f09a6a2dd714467a3728d04f5a431a065057d87e3e82d