[INFO] cloning repository https://github.com/BielosX/algorithms [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/BielosX/algorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FBielosX%2Falgorithms", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FBielosX%2Falgorithms'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] d14cc2c881645a575349c9591d3ee063f0e40139 [INFO] testing BielosX/algorithms against beta-2022-04-10 for beta-1.61-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FBielosX%2Falgorithms" "/workspace/builds/worker-82/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-82/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/BielosX/algorithms on toolchain beta-2022-04-10 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-04-10" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/BielosX/algorithms [INFO] finished tweaking git repo https://github.com/BielosX/algorithms [INFO] tweaked toml for git repo https://github.com/BielosX/algorithms written to /workspace/builds/worker-82/source/Cargo.toml [INFO] crate git repo https://github.com/BielosX/algorithms already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-04-10" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 5c100cfe526b2f6795fbd9db0a2eb3bcb4ec9007cebd4626f99c38cb387603eb [INFO] running `Command { std: "docker" "start" "-a" "5c100cfe526b2f6795fbd9db0a2eb3bcb4ec9007cebd4626f99c38cb387603eb", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "5c100cfe526b2f6795fbd9db0a2eb3bcb4ec9007cebd4626f99c38cb387603eb", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5c100cfe526b2f6795fbd9db0a2eb3bcb4ec9007cebd4626f99c38cb387603eb", kill_on_drop: false }` [INFO] [stdout] 5c100cfe526b2f6795fbd9db0a2eb3bcb4ec9007cebd4626f99c38cb387603eb [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/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=warn" "-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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] b75e3210563a32321ceafb2fdd285a6edcba2f2c2eaf2dada0a929f5197c8c5e [INFO] running `Command { std: "docker" "start" "-a" "b75e3210563a32321ceafb2fdd285a6edcba2f2c2eaf2dada0a929f5197c8c5e", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Compiling libc v0.2.116 [INFO] [stderr] Compiling ppv-lite86 v0.2.16 [INFO] [stderr] Compiling getrandom v0.2.4 [INFO] [stderr] Compiling rand_core v0.6.3 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand v0.8.4 [INFO] [stderr] Compiling algorithms v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `crate::graph::Distance::Dist` [INFO] [stdout] --> src/graph.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::graph::Distance::Dist; [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] --> src/graph.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `min` [INFO] [stdout] --> src/graph.rs:3:16 [INFO] [stdout] | [INFO] [stdout] 3 | use std::cmp::{min, Ordering}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Deref` [INFO] [stdout] --> src/graph.rs:7:21 [INFO] [stdout] | [INFO] [stdout] 7 | use std::ops::{Add, Deref}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/graph.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `RefCell`, `RefMut`, `Ref` [INFO] [stdout] --> src/heap.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell, RefMut}; [INFO] [stdout] | ^^^ ^^^^^^^ ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/heap.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Rc`, `Weak` [INFO] [stdout] --> src/heap.rs:6:15 [INFO] [stdout] | [INFO] [stdout] 6 | use std::rc::{Rc, Weak}; [INFO] [stdout] | ^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::slice::Iter` [INFO] [stdout] --> src/heap.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use std::slice::Iter; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/list.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Write`, `stdin`, `stdout` [INFO] [stdout] --> src/main.rs:7:15 [INFO] [stdout] | [INFO] [stdout] 7 | use std::io::{stdin, stdout, Write}; [INFO] [stdout] | ^^^^^ ^^^^^^ ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Write` [INFO] [stdout] --> src/graph.rs:5:36 [INFO] [stdout] | [INFO] [stdout] 5 | use std::fmt::{Display, Formatter, Write}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `smallest` is never read [INFO] [stdout] --> src/graph.rs:96:17 [INFO] [stdout] | [INFO] [stdout] 96 | let mut smallest = left; [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: `x` [INFO] [stdout] --> src/graph.rs:545:44 [INFO] [stdout] | [INFO] [stdout] 545 | (Distance::Inf, Distance::Dist(x)) => Ordering::Greater, [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: value assigned to `smallest` is never read [INFO] [stdout] --> src/heap.rs:39:17 [INFO] [stdout] | [INFO] [stdout] 39 | let mut smallest = left; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `result` is never read [INFO] [stdout] --> src/tree.rs:145:17 [INFO] [stdout] | [INFO] [stdout] 145 | let mut result = Option::None; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/heap.rs:167:17 [INFO] [stdout] | [INFO] [stdout] 167 | let mut node = Box::new(FibonacciHeapNode::new(value)); [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: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:367:13 [INFO] [stdout] | [INFO] [stdout] 367 | let mut right = (*node).right; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:379:13 [INFO] [stdout] | [INFO] [stdout] 379 | let mut left = (*node).left; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:429:17 [INFO] [stdout] | [INFO] [stdout] 429 | let mut current = node; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:433:29 [INFO] [stdout] | [INFO] [stdout] 433 | let mut uncle = (*parent_parent).right; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:443:29 [INFO] [stdout] | [INFO] [stdout] 443 | let mut uncle = (*parent_parent).left; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary `unsafe` block [INFO] [stdout] --> src/tree.rs:69:13 [INFO] [stdout] | [INFO] [stdout] 69 | unsafe { [INFO] [stdout] | ^^^^^^ unnecessary `unsafe` block [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_unsafe)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary `unsafe` block [INFO] [stdout] --> src/tree.rs:125:9 [INFO] [stdout] | [INFO] [stdout] 125 | unsafe { [INFO] [stdout] | ^^^^^^ unnecessary `unsafe` block [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:89:5 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn get(&self, index: usize) -> Option<&VertAttributes> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(private_in_public)]` on by default [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:112:5 [INFO] [stdout] | [INFO] [stdout] 112 | pub fn extract_min(&mut self) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:122:5 [INFO] [stdout] | [INFO] [stdout] 122 | pub fn insert(&mut self, value: VertAttributes) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:128:5 [INFO] [stdout] | [INFO] [stdout] 128 | pub fn heap_decrease_key(&mut self, index: usize, value: VertAttributes) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `MapSlice` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:846:5 [INFO] [stdout] | [INFO] [stdout] 846 | pub fn get(&self, x: u32, y: u32) -> Option<&MapSlice> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `MapSlice` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:851:5 [INFO] [stdout] | [INFO] [stdout] 851 | pub fn get_mut(&mut self, x: u32, y: u32) -> Option<&mut MapSlice> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new_inf` [INFO] [stdout] --> src/graph.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | fn new_inf(vert: T) -> VertAttributes { [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: `new_zero` [INFO] [stdout] --> src/graph.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | fn new_zero(vert: T) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new_dist` [INFO] [stdout] --> src/graph.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn new_dist(vert: T, distance: Distance) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `PositionTrackingMinHeap` [INFO] [stdout] --> src/graph.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub struct PositionTrackingMinHeap(Vec>, HashMap); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn new() -> PositionTrackingMinHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> src/graph.rs:76:12 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn get(&self, index: usize) -> Option<&VertAttributes> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_heapify` [INFO] [stdout] --> src/graph.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn min_heapify(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `extract_min` [INFO] [stdout] --> src/graph.rs:112:12 [INFO] [stdout] | [INFO] [stdout] 112 | pub fn extract_min(&mut self) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/graph.rs:122:12 [INFO] [stdout] | [INFO] [stdout] 122 | pub fn insert(&mut self, value: VertAttributes) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `heap_decrease_key` [INFO] [stdout] --> src/graph.rs:128:12 [INFO] [stdout] | [INFO] [stdout] 128 | pub fn heap_decrease_key(&mut self, index: usize, value: VertAttributes) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `vert_index` [INFO] [stdout] --> src/graph.rs:148:12 [INFO] [stdout] | [INFO] [stdout] 148 | pub fn vert_index(&self, vert: T) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new_weighted` [INFO] [stdout] --> src/graph.rs:161:12 [INFO] [stdout] | [INFO] [stdout] 161 | pub fn new_weighted(value: u32, from: u32, to: u32) -> Edge { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:169:12 [INFO] [stdout] | [INFO] [stdout] 169 | pub fn new(from: u32, to: u32) -> Edge { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/graph.rs:177:12 [INFO] [stdout] | [INFO] [stdout] 177 | pub fn reverse(&self) -> Edge { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `compare_values` [INFO] [stdout] --> src/graph.rs:185:12 [INFO] [stdout] | [INFO] [stdout] 185 | pub fn compare_values(&self, other: &Edge) -> Ordering { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `same_ignore_direction` [INFO] [stdout] --> src/graph.rs:189:12 [INFO] [stdout] | [INFO] [stdout] 189 | pub fn same_ignore_direction(&self, other: &Edge) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Empty` [INFO] [stdout] --> src/graph.rs:215:5 [INFO] [stdout] | [INFO] [stdout] 215 | Empty, [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Edges` [INFO] [stdout] --> src/graph.rs:216:5 [INFO] [stdout] | [INFO] [stdout] 216 | Edges(Vec), [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:220:12 [INFO] [stdout] | [INFO] [stdout] 220 | pub fn new() -> Edges { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `from_edge` [INFO] [stdout] --> src/graph.rs:224:12 [INFO] [stdout] | [INFO] [stdout] 224 | pub fn from_edge(edge: Edge) -> Edges { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/graph.rs:230:12 [INFO] [stdout] | [INFO] [stdout] 230 | pub fn reverse(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_edge` [INFO] [stdout] --> src/graph.rs:239:12 [INFO] [stdout] | [INFO] [stdout] 239 | pub fn add_edge(&mut self, edge: Edge) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `len` [INFO] [stdout] --> src/graph.rs:252:12 [INFO] [stdout] | [INFO] [stdout] 252 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `iter` [INFO] [stdout] --> src/graph.rs:259:12 [INFO] [stdout] | [INFO] [stdout] 259 | pub fn iter(&self) -> Iter<'_, Edge> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:293:12 [INFO] [stdout] | [INFO] [stdout] 293 | pub fn new() -> Graph { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_adj` [INFO] [stdout] --> src/graph.rs:299:12 [INFO] [stdout] | [INFO] [stdout] 299 | pub fn add_adj(&mut self, edge: Edge) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_adj_both` [INFO] [stdout] --> src/graph.rs:314:12 [INFO] [stdout] | [INFO] [stdout] 314 | pub fn add_adj_both(&mut self, edge: Edge) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:340:12 [INFO] [stdout] | [INFO] [stdout] 340 | pub fn new() -> Vertices { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/graph.rs:344:12 [INFO] [stdout] | [INFO] [stdout] 344 | pub fn push(&mut self, vert: u32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `visited_map` [INFO] [stdout] --> src/graph.rs:366:4 [INFO] [stdout] | [INFO] [stdout] 366 | fn visited_map(graph: &Graph) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `breadth_first_search` [INFO] [stdout] --> src/graph.rs:374:8 [INFO] [stdout] | [INFO] [stdout] 374 | pub fn breadth_first_search(graph: &Graph, first: u32) -> Vertices { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dfs_visit` [INFO] [stdout] --> src/graph.rs:402:4 [INFO] [stdout] | [INFO] [stdout] 402 | fn dfs_visit(vert: &u32, graph: &Graph, visited: &mut HashMap, result: &mut Vertices) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `depth_first_search` [INFO] [stdout] --> src/graph.rs:421:8 [INFO] [stdout] | [INFO] [stdout] 421 | pub fn depth_first_search(graph: &Graph) -> Vertices { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `depth_first_search_iter` [INFO] [stdout] --> src/graph.rs:434:8 [INFO] [stdout] | [INFO] [stdout] 434 | pub fn depth_first_search_iter(graph: &Graph) -> Vertices { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `edges_sorted_asc` [INFO] [stdout] --> src/graph.rs:470:4 [INFO] [stdout] | [INFO] [stdout] 470 | fn edges_sorted_asc(graph: &Graph) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `union_sets` [INFO] [stdout] --> src/graph.rs:490:4 [INFO] [stdout] | [INFO] [stdout] 490 | fn union_sets(sets: &mut HashMap, first: u32, second: u32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `minimal_spanning_tree_kruskal` [INFO] [stdout] --> src/graph.rs:501:8 [INFO] [stdout] | [INFO] [stdout] 501 | pub fn minimal_spanning_tree_kruskal(graph: &Graph) -> Edges { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Inf` [INFO] [stdout] --> src/graph.rs:519:5 [INFO] [stdout] | [INFO] [stdout] 519 | Inf, [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] note: `Distance` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/graph.rs:517:10 [INFO] [stdout] | [INFO] [stdout] 517 | #[derive(Clone, Copy)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Dist` [INFO] [stdout] --> src/graph.rs:520:5 [INFO] [stdout] | [INFO] [stdout] 520 | Dist(u32), [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Distance` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/graph.rs:517:10 [INFO] [stdout] | [INFO] [stdout] 517 | #[derive(Clone, Copy)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_dist` [INFO] [stdout] --> src/graph.rs:524:12 [INFO] [stdout] | [INFO] [stdout] 524 | pub fn set_dist(&mut self, value: u32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `minimal_spanning_tree_prim` [INFO] [stdout] --> src/graph.rs:575:8 [INFO] [stdout] | [INFO] [stdout] 575 | pub fn minimal_spanning_tree_prim(graph: &Graph, root: u32) -> Edges { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `initialize_single_source_dijkstra` [INFO] [stdout] --> src/graph.rs:620:4 [INFO] [stdout] | [INFO] [stdout] 620 | fn initialize_single_source_dijkstra(graph: &Graph, source: u32) -> PositionTrackingMinHeap { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `initialize_single_source` [INFO] [stdout] --> src/graph.rs:633:4 [INFO] [stdout] | [INFO] [stdout] 633 | fn initialize_single_source(graph: &Graph, source: u32) -> HashMap> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `relax` [INFO] [stdout] --> src/graph.rs:644:4 [INFO] [stdout] | [INFO] [stdout] 644 | fn relax( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `recreate_path` [INFO] [stdout] --> src/graph.rs:663:4 [INFO] [stdout] | [INFO] [stdout] 663 | fn recreate_path(start: u32, end: u32, predecessors: &HashMap) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `attributes_to_predecessors` [INFO] [stdout] --> src/graph.rs:683:4 [INFO] [stdout] | [INFO] [stdout] 683 | fn attributes_to_predecessors(attributes: &HashMap>) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `shortest_path_bellman_ford` [INFO] [stdout] --> src/graph.rs:696:8 [INFO] [stdout] | [INFO] [stdout] 696 | pub fn shortest_path_bellman_ford(graph: &Graph, start: u32, end: u32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `shortest_path_dijkstra` [INFO] [stdout] --> src/graph.rs:710:8 [INFO] [stdout] | [INFO] [stdout] 710 | pub fn shortest_path_dijkstra(graph: &Graph, start: u32, end: u32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Obstacle` [INFO] [stdout] --> src/graph.rs:731:5 [INFO] [stdout] | [INFO] [stdout] 731 | Obstacle, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Visited` [INFO] [stdout] --> src/graph.rs:732:5 [INFO] [stdout] | [INFO] [stdout] 732 | Visited, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Height` [INFO] [stdout] --> src/graph.rs:733:5 [INFO] [stdout] | [INFO] [stdout] 733 | Height(u32), [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_height` [INFO] [stdout] --> src/graph.rs:737:12 [INFO] [stdout] | [INFO] [stdout] 737 | pub fn get_height(&self) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `width` [INFO] [stdout] --> src/graph.rs:758:5 [INFO] [stdout] | [INFO] [stdout] 758 | width: u32, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `height` [INFO] [stdout] --> src/graph.rs:759:5 [INFO] [stdout] | [INFO] [stdout] 759 | height: u32, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:766:12 [INFO] [stdout] | [INFO] [stdout] 766 | pub fn new(x: u32, y: u32) -> Point2d { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:786:12 [INFO] [stdout] | [INFO] [stdout] 786 | pub fn new(width: u32, height: u32) -> TerrainMap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `distance` [INFO] [stdout] --> src/graph.rs:805:12 [INFO] [stdout] | [INFO] [stdout] 805 | pub fn distance(&self, curr: &Point2d, neighbor: &Point2d) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `neighbors` [INFO] [stdout] --> src/graph.rs:819:12 [INFO] [stdout] | [INFO] [stdout] 819 | pub fn neighbors(&self, vert: &Point2d) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph.rs:846:12 [INFO] [stdout] | [INFO] [stdout] 846 | pub fn get(&self, x: u32, y: u32) -> Option<&MapSlice> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_mut` [INFO] [stdout] --> src/graph.rs:851:12 [INFO] [stdout] | [INFO] [stdout] 851 | pub fn get_mut(&mut self, x: u32, y: u32) -> Option<&mut MapSlice> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put_obstacle` [INFO] [stdout] --> src/graph.rs:856:12 [INFO] [stdout] | [INFO] [stdout] 856 | pub fn put_obstacle(&mut self, from: Point2d, to: Point2d) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `a_star_recreate_path` [INFO] [stdout] --> src/graph.rs:893:4 [INFO] [stdout] | [INFO] [stdout] 893 | fn a_star_recreate_path( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `shortest_path_a_star` [INFO] [stdout] --> src/graph.rs:918:8 [INFO] [stdout] | [INFO] [stdout] 918 | pub fn shortest_path_a_star( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `mark_path` [INFO] [stdout] --> src/graph.rs:967:8 [INFO] [stdout] | [INFO] [stdout] 967 | pub fn mark_path(graph: &mut TerrainMap, path: &Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/heap.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(func: F) -> MinHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> src/heap.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_heapify` [INFO] [stdout] --> src/heap.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn min_heapify(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `extract_min` [INFO] [stdout] --> src/heap.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn extract_min(&mut self) -> T { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `heap_decrease_key` [INFO] [stdout] --> src/heap.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 68 | pub fn heap_decrease_key(&mut self, index: usize, value: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/heap.rs:90:12 [INFO] [stdout] | [INFO] [stdout] 90 | pub fn insert(&mut self, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/heap.rs:95:12 [INFO] [stdout] | [INFO] [stdout] 95 | pub fn get(&self, index: usize) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/heap.rs:99:12 [INFO] [stdout] | [INFO] [stdout] 99 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `FibonacciHeapNode` [INFO] [stdout] --> src/heap.rs:124:8 [INFO] [stdout] | [INFO] [stdout] 124 | struct FibonacciHeapNode { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/heap.rs:135:8 [INFO] [stdout] | [INFO] [stdout] 135 | fn new(value: T) -> FibonacciHeapNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `FibonacciHeap` [INFO] [stdout] --> src/heap.rs:148:12 [INFO] [stdout] | [INFO] [stdout] 148 | pub struct FibonacciHeap { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/heap.rs:154:12 [INFO] [stdout] | [INFO] [stdout] 154 | pub fn new() -> FibonacciHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/heap.rs:161:12 [INFO] [stdout] | [INFO] [stdout] 161 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/heap.rs:165:12 [INFO] [stdout] | [INFO] [stdout] 165 | pub fn insert(&mut self, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `root_level_nodes` [INFO] [stdout] --> src/heap.rs:190:12 [INFO] [stdout] | [INFO] [stdout] 190 | pub fn root_level_nodes(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `heap_link` [INFO] [stdout] --> src/heap.rs:208:15 [INFO] [stdout] | [INFO] [stdout] 208 | unsafe fn heap_link( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `consolidate` [INFO] [stdout] --> src/heap.rs:235:8 [INFO] [stdout] | [INFO] [stdout] 235 | fn consolidate(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `extract_min` [INFO] [stdout] --> src/heap.rs:286:12 [INFO] [stdout] | [INFO] [stdout] 286 | pub fn extract_min(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | fn new(value: T) -> LinkedListNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_last` [INFO] [stdout] --> src/list.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | fn is_last(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_is_last` [INFO] [stdout] --> src/list.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | fn next_is_last(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_next` [INFO] [stdout] --> src/list.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | fn add_next(&mut self, next: LinkedListNode) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> src/list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn new() -> LinkedList { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push_back` [INFO] [stdout] --> src/list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn push_back(&mut self, value: T) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop_front` [INFO] [stdout] --> src/list.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn pop_front(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop_back` [INFO] [stdout] --> src/list.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn pop_back(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first` [INFO] [stdout] --> src/list.rs:125:12 [INFO] [stdout] | [INFO] [stdout] 125 | pub fn first(&self) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `last` [INFO] [stdout] --> src/list.rs:129:12 [INFO] [stdout] | [INFO] [stdout] 129 | pub fn last(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `iter` [INFO] [stdout] --> src/list.rs:133:12 [INFO] [stdout] | [INFO] [stdout] 133 | pub fn iter(&self) -> LinkedListIter { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:143:12 [INFO] [stdout] | [INFO] [stdout] 143 | pub fn new(list: &LinkedList) -> LinkedListIter { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `DoublyLinkedListNode` [INFO] [stdout] --> src/list.rs:164:8 [INFO] [stdout] | [INFO] [stdout] 164 | struct DoublyLinkedListNode { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:171:8 [INFO] [stdout] | [INFO] [stdout] 171 | fn new(value: T) -> DoublyLinkedListNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `DoublyLinkedList` [INFO] [stdout] --> src/list.rs:180:12 [INFO] [stdout] | [INFO] [stdout] 180 | pub struct DoublyLinkedList { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:186:12 [INFO] [stdout] | [INFO] [stdout] 186 | pub fn new() -> DoublyLinkedList { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push_back` [INFO] [stdout] --> src/list.rs:193:12 [INFO] [stdout] | [INFO] [stdout] 193 | pub fn push_back(&mut self, value: T) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first` [INFO] [stdout] --> src/list.rs:216:12 [INFO] [stdout] | [INFO] [stdout] 216 | pub fn first(&self) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `last` [INFO] [stdout] --> src/list.rs:220:12 [INFO] [stdout] | [INFO] [stdout] 220 | pub fn last(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/tree.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | fn new(value: T) -> BinaryTreeNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `size` [INFO] [stdout] --> src/tree.rs:38:5 [INFO] [stdout] | [INFO] [stdout] 38 | size: usize, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/tree.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new() -> BinaryTree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains` [INFO] [stdout] --> src/tree.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn contains(&self, value: T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add` [INFO] [stdout] --> src/tree.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn add(&mut self, value: T) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_dfs_iter` [INFO] [stdout] --> src/tree.rs:103:12 [INFO] [stdout] | [INFO] [stdout] 103 | pub fn preorder_dfs_iter(&self) -> BinaryTreeDfsPreorderIterator<'_, T> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/tree.rs:124:12 [INFO] [stdout] | [INFO] [stdout] 124 | pub fn new(tree: &BinaryTree) -> BinaryTreeDfsPreorderIterator { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parent_parent_right` [INFO] [stdout] --> src/tree.rs:279:8 [INFO] [stdout] | [INFO] [stdout] 279 | fn parent_parent_right(&self) -> Option<*mut RedBlackTreeNode> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parent_parent_left` [INFO] [stdout] --> src/tree.rs:283:8 [INFO] [stdout] | [INFO] [stdout] 283 | fn parent_parent_left(&self) -> Option<*mut RedBlackTreeNode> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: bounds on generic parameters are not enforced in type aliases [INFO] [stdout] --> src/graph.rs:11:21 [INFO] [stdout] | [INFO] [stdout] 11 | type Predecessor = Option; [INFO] [stdout] | ^^ ^^^^ ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(type_alias_bounds)]` on by default [INFO] [stdout] help: the bound will not be checked when the type alias is used, and should be removed [INFO] [stdout] | [INFO] [stdout] 11 - type Predecessor = Option; [INFO] [stdout] 11 + type Predecessor = Option; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:351:9 [INFO] [stdout] | [INFO] [stdout] 351 | f.write_str("["); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:356:17 [INFO] [stdout] | [INFO] [stdout] 356 | f.write_str(val.to_string().as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:358:17 [INFO] [stdout] | [INFO] [stdout] 358 | f.write_str(format!(",{}", val).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:361:9 [INFO] [stdout] | [INFO] [stdout] 361 | f.write_str("]"); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/heap.rs:110:9 [INFO] [stdout] | [INFO] [stdout] 110 | f.write_char('['); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/heap.rs:115:17 [INFO] [stdout] | [INFO] [stdout] 115 | f.write_str(format!("{}", elem).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/heap.rs:117:17 [INFO] [stdout] | [INFO] [stdout] 117 | f.write_str(format!(",{}", elem).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:223:9 [INFO] [stdout] | [INFO] [stdout] 223 | f.write_str(format!("{{value: {} ", self.value).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:226:17 [INFO] [stdout] | [INFO] [stdout] 226 | f.write_str(format!("left: {} ", self.left.as_ref().unwrap()).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:229:17 [INFO] [stdout] | [INFO] [stdout] 229 | f.write_str(format!("right: {} ", self.right.as_ref().unwrap()).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:232:9 [INFO] [stdout] | [INFO] [stdout] 232 | f.write_str("}"); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:327:17 [INFO] [stdout] | [INFO] [stdout] 327 | f.write_str(format!("{}", self.root.as_ref().unwrap()).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 156 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 23.87s [INFO] running `Command { std: "docker" "inspect" "b75e3210563a32321ceafb2fdd285a6edcba2f2c2eaf2dada0a929f5197c8c5e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "b75e3210563a32321ceafb2fdd285a6edcba2f2c2eaf2dada0a929f5197c8c5e", kill_on_drop: false }` [INFO] [stdout] b75e3210563a32321ceafb2fdd285a6edcba2f2c2eaf2dada0a929f5197c8c5e [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/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=warn" "-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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] be9d2a0f70ca716424225dce27bde132173a7dee69b94fd824822af899272931 [INFO] running `Command { std: "docker" "start" "-a" "be9d2a0f70ca716424225dce27bde132173a7dee69b94fd824822af899272931", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Compiling algorithms v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `crate::graph::Distance::Dist` [INFO] [stdout] --> src/graph.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::graph::Distance::Dist; [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] --> src/graph.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `min` [INFO] [stdout] --> src/graph.rs:3:16 [INFO] [stdout] | [INFO] [stdout] 3 | use std::cmp::{min, Ordering}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Deref` [INFO] [stdout] --> src/graph.rs:7:21 [INFO] [stdout] | [INFO] [stdout] 7 | use std::ops::{Add, Deref}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/graph.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `RefCell`, `RefMut`, `Ref` [INFO] [stdout] --> src/heap.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell, RefMut}; [INFO] [stdout] | ^^^ ^^^^^^^ ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/heap.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Rc`, `Weak` [INFO] [stdout] --> src/heap.rs:6:15 [INFO] [stdout] | [INFO] [stdout] 6 | use std::rc::{Rc, Weak}; [INFO] [stdout] | ^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::slice::Iter` [INFO] [stdout] --> src/heap.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use std::slice::Iter; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/list.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Write`, `stdin`, `stdout` [INFO] [stdout] --> src/main.rs:7:15 [INFO] [stdout] | [INFO] [stdout] 7 | use std::io::{stdin, stdout, Write}; [INFO] [stdout] | ^^^^^ ^^^^^^ ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Write` [INFO] [stdout] --> src/graph.rs:5:36 [INFO] [stdout] | [INFO] [stdout] 5 | use std::fmt::{Display, Formatter, Write}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `smallest` is never read [INFO] [stdout] --> src/graph.rs:96:17 [INFO] [stdout] | [INFO] [stdout] 96 | let mut smallest = left; [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: `x` [INFO] [stdout] --> src/graph.rs:545:44 [INFO] [stdout] | [INFO] [stdout] 545 | (Distance::Inf, Distance::Dist(x)) => Ordering::Greater, [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: value assigned to `smallest` is never read [INFO] [stdout] --> src/heap.rs:39:17 [INFO] [stdout] | [INFO] [stdout] 39 | let mut smallest = left; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `result` is never read [INFO] [stdout] --> src/tree.rs:145:17 [INFO] [stdout] | [INFO] [stdout] 145 | let mut result = Option::None; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/heap.rs:167:17 [INFO] [stdout] | [INFO] [stdout] 167 | let mut node = Box::new(FibonacciHeapNode::new(value)); [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: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:367:13 [INFO] [stdout] | [INFO] [stdout] 367 | let mut right = (*node).right; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:379:13 [INFO] [stdout] | [INFO] [stdout] 379 | let mut left = (*node).left; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:429:17 [INFO] [stdout] | [INFO] [stdout] 429 | let mut current = node; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:433:29 [INFO] [stdout] | [INFO] [stdout] 433 | let mut uncle = (*parent_parent).right; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/tree.rs:443:29 [INFO] [stdout] | [INFO] [stdout] 443 | let mut uncle = (*parent_parent).left; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary `unsafe` block [INFO] [stdout] --> src/tree.rs:69:13 [INFO] [stdout] | [INFO] [stdout] 69 | unsafe { [INFO] [stdout] | ^^^^^^ unnecessary `unsafe` block [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_unsafe)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary `unsafe` block [INFO] [stdout] --> src/tree.rs:125:9 [INFO] [stdout] | [INFO] [stdout] 125 | unsafe { [INFO] [stdout] | ^^^^^^ unnecessary `unsafe` block [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:89:5 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn get(&self, index: usize) -> Option<&VertAttributes> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(private_in_public)]` on by default [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:112:5 [INFO] [stdout] | [INFO] [stdout] 112 | pub fn extract_min(&mut self) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:122:5 [INFO] [stdout] | [INFO] [stdout] 122 | pub fn insert(&mut self, value: VertAttributes) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:128:5 [INFO] [stdout] | [INFO] [stdout] 128 | pub fn heap_decrease_key(&mut self, index: usize, value: VertAttributes) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `MapSlice` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:846:5 [INFO] [stdout] | [INFO] [stdout] 846 | pub fn get(&self, x: u32, y: u32) -> Option<&MapSlice> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: private type `MapSlice` in public interface (error E0446) [INFO] [stdout] --> src/graph.rs:851:5 [INFO] [stdout] | [INFO] [stdout] 851 | pub fn get_mut(&mut self, x: u32, y: u32) -> Option<&mut MapSlice> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stdout] = note: for more information, see issue #34537 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new_inf` [INFO] [stdout] --> src/graph.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | fn new_inf(vert: T) -> VertAttributes { [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: `new_zero` [INFO] [stdout] --> src/graph.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | fn new_zero(vert: T) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new_dist` [INFO] [stdout] --> src/graph.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn new_dist(vert: T, distance: Distance) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `PositionTrackingMinHeap` [INFO] [stdout] --> src/graph.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub struct PositionTrackingMinHeap(Vec>, HashMap); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn new() -> PositionTrackingMinHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> src/graph.rs:76:12 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn get(&self, index: usize) -> Option<&VertAttributes> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_heapify` [INFO] [stdout] --> src/graph.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn min_heapify(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `extract_min` [INFO] [stdout] --> src/graph.rs:112:12 [INFO] [stdout] | [INFO] [stdout] 112 | pub fn extract_min(&mut self) -> VertAttributes { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/graph.rs:122:12 [INFO] [stdout] | [INFO] [stdout] 122 | pub fn insert(&mut self, value: VertAttributes) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `heap_decrease_key` [INFO] [stdout] --> src/graph.rs:128:12 [INFO] [stdout] | [INFO] [stdout] 128 | pub fn heap_decrease_key(&mut self, index: usize, value: VertAttributes) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `vert_index` [INFO] [stdout] --> src/graph.rs:148:12 [INFO] [stdout] | [INFO] [stdout] 148 | pub fn vert_index(&self, vert: T) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new_weighted` [INFO] [stdout] --> src/graph.rs:161:12 [INFO] [stdout] | [INFO] [stdout] 161 | pub fn new_weighted(value: u32, from: u32, to: u32) -> Edge { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:169:12 [INFO] [stdout] | [INFO] [stdout] 169 | pub fn new(from: u32, to: u32) -> Edge { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/graph.rs:177:12 [INFO] [stdout] | [INFO] [stdout] 177 | pub fn reverse(&self) -> Edge { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `compare_values` [INFO] [stdout] --> src/graph.rs:185:12 [INFO] [stdout] | [INFO] [stdout] 185 | pub fn compare_values(&self, other: &Edge) -> Ordering { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `same_ignore_direction` [INFO] [stdout] --> src/graph.rs:189:12 [INFO] [stdout] | [INFO] [stdout] 189 | pub fn same_ignore_direction(&self, other: &Edge) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Empty` [INFO] [stdout] --> src/graph.rs:215:5 [INFO] [stdout] | [INFO] [stdout] 215 | Empty, [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Edges` [INFO] [stdout] --> src/graph.rs:216:5 [INFO] [stdout] | [INFO] [stdout] 216 | Edges(Vec), [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:220:12 [INFO] [stdout] | [INFO] [stdout] 220 | pub fn new() -> Edges { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `from_edge` [INFO] [stdout] --> src/graph.rs:224:12 [INFO] [stdout] | [INFO] [stdout] 224 | pub fn from_edge(edge: Edge) -> Edges { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/graph.rs:230:12 [INFO] [stdout] | [INFO] [stdout] 230 | pub fn reverse(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_edge` [INFO] [stdout] --> src/graph.rs:239:12 [INFO] [stdout] | [INFO] [stdout] 239 | pub fn add_edge(&mut self, edge: Edge) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `len` [INFO] [stdout] --> src/graph.rs:252:12 [INFO] [stdout] | [INFO] [stdout] 252 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `iter` [INFO] [stdout] --> src/graph.rs:259:12 [INFO] [stdout] | [INFO] [stdout] 259 | pub fn iter(&self) -> Iter<'_, Edge> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:293:12 [INFO] [stdout] | [INFO] [stdout] 293 | pub fn new() -> Graph { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_adj` [INFO] [stdout] --> src/graph.rs:299:12 [INFO] [stdout] | [INFO] [stdout] 299 | pub fn add_adj(&mut self, edge: Edge) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_adj_both` [INFO] [stdout] --> src/graph.rs:314:12 [INFO] [stdout] | [INFO] [stdout] 314 | pub fn add_adj_both(&mut self, edge: Edge) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:340:12 [INFO] [stdout] | [INFO] [stdout] 340 | pub fn new() -> Vertices { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/graph.rs:344:12 [INFO] [stdout] | [INFO] [stdout] 344 | pub fn push(&mut self, vert: u32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `visited_map` [INFO] [stdout] --> src/graph.rs:366:4 [INFO] [stdout] | [INFO] [stdout] 366 | fn visited_map(graph: &Graph) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `breadth_first_search` [INFO] [stdout] --> src/graph.rs:374:8 [INFO] [stdout] | [INFO] [stdout] 374 | pub fn breadth_first_search(graph: &Graph, first: u32) -> Vertices { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dfs_visit` [INFO] [stdout] --> src/graph.rs:402:4 [INFO] [stdout] | [INFO] [stdout] 402 | fn dfs_visit(vert: &u32, graph: &Graph, visited: &mut HashMap, result: &mut Vertices) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `depth_first_search` [INFO] [stdout] --> src/graph.rs:421:8 [INFO] [stdout] | [INFO] [stdout] 421 | pub fn depth_first_search(graph: &Graph) -> Vertices { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `depth_first_search_iter` [INFO] [stdout] --> src/graph.rs:434:8 [INFO] [stdout] | [INFO] [stdout] 434 | pub fn depth_first_search_iter(graph: &Graph) -> Vertices { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `edges_sorted_asc` [INFO] [stdout] --> src/graph.rs:470:4 [INFO] [stdout] | [INFO] [stdout] 470 | fn edges_sorted_asc(graph: &Graph) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `union_sets` [INFO] [stdout] --> src/graph.rs:490:4 [INFO] [stdout] | [INFO] [stdout] 490 | fn union_sets(sets: &mut HashMap, first: u32, second: u32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `minimal_spanning_tree_kruskal` [INFO] [stdout] --> src/graph.rs:501:8 [INFO] [stdout] | [INFO] [stdout] 501 | pub fn minimal_spanning_tree_kruskal(graph: &Graph) -> Edges { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Inf` [INFO] [stdout] --> src/graph.rs:519:5 [INFO] [stdout] | [INFO] [stdout] 519 | Inf, [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] note: `Distance` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/graph.rs:517:10 [INFO] [stdout] | [INFO] [stdout] 517 | #[derive(Clone, Copy)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Dist` [INFO] [stdout] --> src/graph.rs:520:5 [INFO] [stdout] | [INFO] [stdout] 520 | Dist(u32), [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Distance` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/graph.rs:517:10 [INFO] [stdout] | [INFO] [stdout] 517 | #[derive(Clone, Copy)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_dist` [INFO] [stdout] --> src/graph.rs:524:12 [INFO] [stdout] | [INFO] [stdout] 524 | pub fn set_dist(&mut self, value: u32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `minimal_spanning_tree_prim` [INFO] [stdout] --> src/graph.rs:575:8 [INFO] [stdout] | [INFO] [stdout] 575 | pub fn minimal_spanning_tree_prim(graph: &Graph, root: u32) -> Edges { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `initialize_single_source_dijkstra` [INFO] [stdout] --> src/graph.rs:620:4 [INFO] [stdout] | [INFO] [stdout] 620 | fn initialize_single_source_dijkstra(graph: &Graph, source: u32) -> PositionTrackingMinHeap { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `initialize_single_source` [INFO] [stdout] --> src/graph.rs:633:4 [INFO] [stdout] | [INFO] [stdout] 633 | fn initialize_single_source(graph: &Graph, source: u32) -> HashMap> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `relax` [INFO] [stdout] --> src/graph.rs:644:4 [INFO] [stdout] | [INFO] [stdout] 644 | fn relax( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `recreate_path` [INFO] [stdout] --> src/graph.rs:663:4 [INFO] [stdout] | [INFO] [stdout] 663 | fn recreate_path(start: u32, end: u32, predecessors: &HashMap) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `attributes_to_predecessors` [INFO] [stdout] --> src/graph.rs:683:4 [INFO] [stdout] | [INFO] [stdout] 683 | fn attributes_to_predecessors(attributes: &HashMap>) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `shortest_path_bellman_ford` [INFO] [stdout] --> src/graph.rs:696:8 [INFO] [stdout] | [INFO] [stdout] 696 | pub fn shortest_path_bellman_ford(graph: &Graph, start: u32, end: u32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `shortest_path_dijkstra` [INFO] [stdout] --> src/graph.rs:710:8 [INFO] [stdout] | [INFO] [stdout] 710 | pub fn shortest_path_dijkstra(graph: &Graph, start: u32, end: u32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Obstacle` [INFO] [stdout] --> src/graph.rs:731:5 [INFO] [stdout] | [INFO] [stdout] 731 | Obstacle, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Visited` [INFO] [stdout] --> src/graph.rs:732:5 [INFO] [stdout] | [INFO] [stdout] 732 | Visited, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Height` [INFO] [stdout] --> src/graph.rs:733:5 [INFO] [stdout] | [INFO] [stdout] 733 | Height(u32), [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_height` [INFO] [stdout] --> src/graph.rs:737:12 [INFO] [stdout] | [INFO] [stdout] 737 | pub fn get_height(&self) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `width` [INFO] [stdout] --> src/graph.rs:758:5 [INFO] [stdout] | [INFO] [stdout] 758 | width: u32, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `height` [INFO] [stdout] --> src/graph.rs:759:5 [INFO] [stdout] | [INFO] [stdout] 759 | height: u32, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:766:12 [INFO] [stdout] | [INFO] [stdout] 766 | pub fn new(x: u32, y: u32) -> Point2d { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph.rs:786:12 [INFO] [stdout] | [INFO] [stdout] 786 | pub fn new(width: u32, height: u32) -> TerrainMap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `distance` [INFO] [stdout] --> src/graph.rs:805:12 [INFO] [stdout] | [INFO] [stdout] 805 | pub fn distance(&self, curr: &Point2d, neighbor: &Point2d) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `neighbors` [INFO] [stdout] --> src/graph.rs:819:12 [INFO] [stdout] | [INFO] [stdout] 819 | pub fn neighbors(&self, vert: &Point2d) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph.rs:846:12 [INFO] [stdout] | [INFO] [stdout] 846 | pub fn get(&self, x: u32, y: u32) -> Option<&MapSlice> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_mut` [INFO] [stdout] --> src/graph.rs:851:12 [INFO] [stdout] | [INFO] [stdout] 851 | pub fn get_mut(&mut self, x: u32, y: u32) -> Option<&mut MapSlice> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put_obstacle` [INFO] [stdout] --> src/graph.rs:856:12 [INFO] [stdout] | [INFO] [stdout] 856 | pub fn put_obstacle(&mut self, from: Point2d, to: Point2d) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `a_star_recreate_path` [INFO] [stdout] --> src/graph.rs:893:4 [INFO] [stdout] | [INFO] [stdout] 893 | fn a_star_recreate_path( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `shortest_path_a_star` [INFO] [stdout] --> src/graph.rs:918:8 [INFO] [stdout] | [INFO] [stdout] 918 | pub fn shortest_path_a_star( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `mark_path` [INFO] [stdout] --> src/graph.rs:967:8 [INFO] [stdout] | [INFO] [stdout] 967 | pub fn mark_path(graph: &mut TerrainMap, path: &Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/heap.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(func: F) -> MinHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> src/heap.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_heapify` [INFO] [stdout] --> src/heap.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn min_heapify(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `extract_min` [INFO] [stdout] --> src/heap.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn extract_min(&mut self) -> T { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `heap_decrease_key` [INFO] [stdout] --> src/heap.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 68 | pub fn heap_decrease_key(&mut self, index: usize, value: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/heap.rs:90:12 [INFO] [stdout] | [INFO] [stdout] 90 | pub fn insert(&mut self, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/heap.rs:95:12 [INFO] [stdout] | [INFO] [stdout] 95 | pub fn get(&self, index: usize) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/heap.rs:99:12 [INFO] [stdout] | [INFO] [stdout] 99 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `FibonacciHeapNode` [INFO] [stdout] --> src/heap.rs:124:8 [INFO] [stdout] | [INFO] [stdout] 124 | struct FibonacciHeapNode { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/heap.rs:135:8 [INFO] [stdout] | [INFO] [stdout] 135 | fn new(value: T) -> FibonacciHeapNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `FibonacciHeap` [INFO] [stdout] --> src/heap.rs:148:12 [INFO] [stdout] | [INFO] [stdout] 148 | pub struct FibonacciHeap { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/heap.rs:154:12 [INFO] [stdout] | [INFO] [stdout] 154 | pub fn new() -> FibonacciHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/heap.rs:161:12 [INFO] [stdout] | [INFO] [stdout] 161 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/heap.rs:165:12 [INFO] [stdout] | [INFO] [stdout] 165 | pub fn insert(&mut self, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `root_level_nodes` [INFO] [stdout] --> src/heap.rs:190:12 [INFO] [stdout] | [INFO] [stdout] 190 | pub fn root_level_nodes(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `heap_link` [INFO] [stdout] --> src/heap.rs:208:15 [INFO] [stdout] | [INFO] [stdout] 208 | unsafe fn heap_link( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `consolidate` [INFO] [stdout] --> src/heap.rs:235:8 [INFO] [stdout] | [INFO] [stdout] 235 | fn consolidate(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `extract_min` [INFO] [stdout] --> src/heap.rs:286:12 [INFO] [stdout] | [INFO] [stdout] 286 | pub fn extract_min(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | fn new(value: T) -> LinkedListNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_last` [INFO] [stdout] --> src/list.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | fn is_last(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_is_last` [INFO] [stdout] --> src/list.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | fn next_is_last(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_next` [INFO] [stdout] --> src/list.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | fn add_next(&mut self, next: LinkedListNode) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LinkedList` [INFO] [stdout] --> src/list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct LinkedList { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn new() -> LinkedList { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push_back` [INFO] [stdout] --> src/list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn push_back(&mut self, value: T) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop_front` [INFO] [stdout] --> src/list.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn pop_front(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop_back` [INFO] [stdout] --> src/list.rs:93:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub fn pop_back(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first` [INFO] [stdout] --> src/list.rs:125:12 [INFO] [stdout] | [INFO] [stdout] 125 | pub fn first(&self) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `last` [INFO] [stdout] --> src/list.rs:129:12 [INFO] [stdout] | [INFO] [stdout] 129 | pub fn last(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `iter` [INFO] [stdout] --> src/list.rs:133:12 [INFO] [stdout] | [INFO] [stdout] 133 | pub fn iter(&self) -> LinkedListIter { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:143:12 [INFO] [stdout] | [INFO] [stdout] 143 | pub fn new(list: &LinkedList) -> LinkedListIter { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `DoublyLinkedListNode` [INFO] [stdout] --> src/list.rs:164:8 [INFO] [stdout] | [INFO] [stdout] 164 | struct DoublyLinkedListNode { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:171:8 [INFO] [stdout] | [INFO] [stdout] 171 | fn new(value: T) -> DoublyLinkedListNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `DoublyLinkedList` [INFO] [stdout] --> src/list.rs:180:12 [INFO] [stdout] | [INFO] [stdout] 180 | pub struct DoublyLinkedList { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/list.rs:186:12 [INFO] [stdout] | [INFO] [stdout] 186 | pub fn new() -> DoublyLinkedList { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push_back` [INFO] [stdout] --> src/list.rs:193:12 [INFO] [stdout] | [INFO] [stdout] 193 | pub fn push_back(&mut self, value: T) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first` [INFO] [stdout] --> src/list.rs:216:12 [INFO] [stdout] | [INFO] [stdout] 216 | pub fn first(&self) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `last` [INFO] [stdout] --> src/list.rs:220:12 [INFO] [stdout] | [INFO] [stdout] 220 | pub fn last(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/tree.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | fn new(value: T) -> BinaryTreeNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `size` [INFO] [stdout] --> src/tree.rs:38:5 [INFO] [stdout] | [INFO] [stdout] 38 | size: usize, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/tree.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new() -> BinaryTree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains` [INFO] [stdout] --> src/tree.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn contains(&self, value: T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add` [INFO] [stdout] --> src/tree.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn add(&mut self, value: T) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_dfs_iter` [INFO] [stdout] --> src/tree.rs:103:12 [INFO] [stdout] | [INFO] [stdout] 103 | pub fn preorder_dfs_iter(&self) -> BinaryTreeDfsPreorderIterator<'_, T> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/tree.rs:124:12 [INFO] [stdout] | [INFO] [stdout] 124 | pub fn new(tree: &BinaryTree) -> BinaryTreeDfsPreorderIterator { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parent_parent_right` [INFO] [stdout] --> src/tree.rs:279:8 [INFO] [stdout] | [INFO] [stdout] 279 | fn parent_parent_right(&self) -> Option<*mut RedBlackTreeNode> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `parent_parent_left` [INFO] [stdout] --> src/tree.rs:283:8 [INFO] [stdout] | [INFO] [stdout] 283 | fn parent_parent_left(&self) -> Option<*mut RedBlackTreeNode> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: bounds on generic parameters are not enforced in type aliases [INFO] [stdout] --> src/graph.rs:11:21 [INFO] [stdout] | [INFO] [stdout] 11 | type Predecessor = Option; [INFO] [stdout] | ^^ ^^^^ ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(type_alias_bounds)]` on by default [INFO] [stdout] help: the bound will not be checked when the type alias is used, and should be removed [INFO] [stdout] | [INFO] [stdout] 11 - type Predecessor = Option; [INFO] [stdout] 11 + type Predecessor = Option; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:351:9 [INFO] [stdout] | [INFO] [stdout] 351 | f.write_str("["); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:356:17 [INFO] [stdout] | [INFO] [stdout] 356 | f.write_str(val.to_string().as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:358:17 [INFO] [stdout] | [INFO] [stdout] 358 | f.write_str(format!(",{}", val).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:361:9 [INFO] [stdout] | [INFO] [stdout] 361 | f.write_str("]"); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/heap.rs:110:9 [INFO] [stdout] | [INFO] [stdout] 110 | f.write_char('['); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/heap.rs:115:17 [INFO] [stdout] | [INFO] [stdout] 115 | f.write_str(format!("{}", elem).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/heap.rs:117:17 [INFO] [stdout] | [INFO] [stdout] 117 | f.write_str(format!(",{}", elem).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:223:9 [INFO] [stdout] | [INFO] [stdout] 223 | f.write_str(format!("{{value: {} ", self.value).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:226:17 [INFO] [stdout] | [INFO] [stdout] 226 | f.write_str(format!("left: {} ", self.left.as_ref().unwrap()).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:229:17 [INFO] [stdout] | [INFO] [stdout] 229 | f.write_str(format!("right: {} ", self.right.as_ref().unwrap()).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:232:9 [INFO] [stdout] | [INFO] [stdout] 232 | f.write_str("}"); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/tree.rs:327:17 [INFO] [stdout] | [INFO] [stdout] 327 | f.write_str(format!("{}", self.root.as_ref().unwrap()).as_str()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 156 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 4.27s [INFO] [stderr] Executable unittests src/main.rs (/opt/rustwide/target/debug/deps/algorithms-b4385504b60c7753) [INFO] running `Command { std: "docker" "inspect" "be9d2a0f70ca716424225dce27bde132173a7dee69b94fd824822af899272931", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "be9d2a0f70ca716424225dce27bde132173a7dee69b94fd824822af899272931", kill_on_drop: false }` [INFO] [stdout] be9d2a0f70ca716424225dce27bde132173a7dee69b94fd824822af899272931 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-82/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=warn" "-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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-04-10" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 48258add12460e6a0b47fb26f9f6adb8125404e075016bd9e62411d038f5b851 [INFO] running `Command { std: "docker" "start" "-a" "48258add12460e6a0b47fb26f9f6adb8125404e075016bd9e62411d038f5b851", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `crate::graph::Distance::Dist` [INFO] [stderr] --> src/graph.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use crate::graph::Distance::Dist; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::cell::RefCell` [INFO] [stderr] --> src/graph.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use std::cell::RefCell; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `min` [INFO] [stderr] --> src/graph.rs:3:16 [INFO] [stderr] | [INFO] [stderr] 3 | use std::cmp::{min, Ordering}; [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Deref` [INFO] [stderr] --> src/graph.rs:7:21 [INFO] [stderr] | [INFO] [stderr] 7 | use std::ops::{Add, Deref}; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::rc::Rc` [INFO] [stderr] --> src/graph.rs:8:5 [INFO] [stderr] | [INFO] [stderr] 8 | use std::rc::Rc; [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `RefCell`, `RefMut`, `Ref` [INFO] [stderr] --> src/heap.rs:1:17 [INFO] [stderr] | [INFO] [stderr] 1 | use std::cell::{Ref, RefCell, RefMut}; [INFO] [stderr] | ^^^ ^^^^^^^ ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::ops::Deref` [INFO] [stderr] --> src/heap.rs:4:5 [INFO] [stderr] | [INFO] [stderr] 4 | use std::ops::Deref; [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Rc`, `Weak` [INFO] [stderr] --> src/heap.rs:6:15 [INFO] [stderr] | [INFO] [stderr] 6 | use std::rc::{Rc, Weak}; [INFO] [stderr] | ^^ ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::slice::Iter` [INFO] [stderr] --> src/heap.rs:7:5 [INFO] [stderr] | [INFO] [stderr] 7 | use std::slice::Iter; [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Ref` [INFO] [stderr] --> src/list.rs:1:17 [INFO] [stderr] | [INFO] [stderr] 1 | use std::cell::{Ref, RefCell}; [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::ops::Deref` [INFO] [stderr] --> src/list.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use std::ops::Deref; [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Write`, `stdin`, `stdout` [INFO] [stderr] --> src/main.rs:7:15 [INFO] [stderr] | [INFO] [stderr] 7 | use std::io::{stdin, stdout, Write}; [INFO] [stderr] | ^^^^^ ^^^^^^ ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Write` [INFO] [stderr] --> src/graph.rs:5:36 [INFO] [stderr] | [INFO] [stderr] 5 | use std::fmt::{Display, Formatter, Write}; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: value assigned to `smallest` is never read [INFO] [stderr] --> src/graph.rs:96:17 [INFO] [stderr] | [INFO] [stderr] 96 | let mut smallest = left; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: unused variable: `x` [INFO] [stderr] --> src/graph.rs:545:44 [INFO] [stderr] | [INFO] [stderr] 545 | (Distance::Inf, Distance::Dist(x)) => Ordering::Greater, [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: value assigned to `smallest` is never read [INFO] [stderr] --> src/heap.rs:39:17 [INFO] [stderr] | [INFO] [stderr] 39 | let mut smallest = left; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: value assigned to `result` is never read [INFO] [stderr] --> src/tree.rs:145:17 [INFO] [stderr] | [INFO] [stderr] 145 | let mut result = Option::None; [INFO] [stderr] | ^^^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/heap.rs:167:17 [INFO] [stderr] | [INFO] [stderr] 167 | let mut node = Box::new(FibonacciHeapNode::new(value)); [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/tree.rs:367:13 [INFO] [stderr] | [INFO] [stderr] 367 | let mut right = (*node).right; [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/tree.rs:379:13 [INFO] [stderr] | [INFO] [stderr] 379 | let mut left = (*node).left; [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/tree.rs:429:17 [INFO] [stderr] | [INFO] [stderr] 429 | let mut current = node; [INFO] [stderr] | ----^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/tree.rs:433:29 [INFO] [stderr] | [INFO] [stderr] 433 | let mut uncle = (*parent_parent).right; [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/tree.rs:443:29 [INFO] [stderr] | [INFO] [stderr] 443 | let mut uncle = (*parent_parent).left; [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: unnecessary `unsafe` block [INFO] [stderr] --> src/tree.rs:69:13 [INFO] [stderr] | [INFO] [stderr] 69 | unsafe { [INFO] [stderr] | ^^^^^^ unnecessary `unsafe` block [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_unsafe)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unnecessary `unsafe` block [INFO] [stderr] --> src/tree.rs:125:9 [INFO] [stderr] | [INFO] [stderr] 125 | unsafe { [INFO] [stderr] | ^^^^^^ unnecessary `unsafe` block [INFO] [stderr] [INFO] [stderr] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stderr] --> src/graph.rs:89:5 [INFO] [stderr] | [INFO] [stderr] 89 | pub fn get(&self, index: usize) -> Option<&VertAttributes> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(private_in_public)]` on by default [INFO] [stderr] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stderr] = note: for more information, see issue #34537 [INFO] [stderr] [INFO] [stderr] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stderr] --> src/graph.rs:112:5 [INFO] [stderr] | [INFO] [stderr] 112 | pub fn extract_min(&mut self) -> VertAttributes { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stderr] = note: for more information, see issue #34537 [INFO] [stderr] [INFO] [stderr] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stderr] --> src/graph.rs:122:5 [INFO] [stderr] | [INFO] [stderr] 122 | pub fn insert(&mut self, value: VertAttributes) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stderr] = note: for more information, see issue #34537 [INFO] [stderr] [INFO] [stderr] warning: private type `VertAttributes` in public interface (error E0446) [INFO] [stderr] --> src/graph.rs:128:5 [INFO] [stderr] | [INFO] [stderr] 128 | pub fn heap_decrease_key(&mut self, index: usize, value: VertAttributes) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stderr] = note: for more information, see issue #34537 [INFO] [stderr] [INFO] [stderr] warning: private type `MapSlice` in public interface (error E0446) [INFO] [stderr] --> src/graph.rs:846:5 [INFO] [stderr] | [INFO] [stderr] 846 | pub fn get(&self, x: u32, y: u32) -> Option<&MapSlice> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stderr] = note: for more information, see issue #34537 [INFO] [stderr] [INFO] [stderr] warning: private type `MapSlice` in public interface (error E0446) [INFO] [stderr] --> src/graph.rs:851:5 [INFO] [stderr] | [INFO] [stderr] 851 | pub fn get_mut(&mut self, x: u32, y: u32) -> Option<&mut MapSlice> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! [INFO] [stderr] = note: for more information, see issue #34537 [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new_inf` [INFO] [stderr] --> src/graph.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | fn new_inf(vert: T) -> VertAttributes { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new_zero` [INFO] [stderr] --> src/graph.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | fn new_zero(vert: T) -> VertAttributes { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new_dist` [INFO] [stderr] --> src/graph.rs:37:8 [INFO] [stderr] | [INFO] [stderr] 37 | fn new_dist(vert: T, distance: Distance) -> VertAttributes { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `PositionTrackingMinHeap` [INFO] [stderr] --> src/graph.rs:58:12 [INFO] [stderr] | [INFO] [stderr] 58 | pub struct PositionTrackingMinHeap(Vec>, HashMap); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph.rs:61:12 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn new() -> PositionTrackingMinHeap { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_empty` [INFO] [stderr] --> src/graph.rs:76:12 [INFO] [stderr] | [INFO] [stderr] 76 | pub fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/graph.rs:89:12 [INFO] [stderr] | [INFO] [stderr] 89 | pub fn get(&self, index: usize) -> Option<&VertAttributes> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_heapify` [INFO] [stderr] --> src/graph.rs:93:12 [INFO] [stderr] | [INFO] [stderr] 93 | pub fn min_heapify(&mut self, index: usize) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `extract_min` [INFO] [stderr] --> src/graph.rs:112:12 [INFO] [stderr] | [INFO] [stderr] 112 | pub fn extract_min(&mut self) -> VertAttributes { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `insert` [INFO] [stderr] --> src/graph.rs:122:12 [INFO] [stderr] | [INFO] [stderr] 122 | pub fn insert(&mut self, value: VertAttributes) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `heap_decrease_key` [INFO] [stderr] --> src/graph.rs:128:12 [INFO] [stderr] | [INFO] [stderr] 128 | pub fn heap_decrease_key(&mut self, index: usize, value: VertAttributes) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `vert_index` [INFO] [stderr] --> src/graph.rs:148:12 [INFO] [stderr] | [INFO] [stderr] 148 | pub fn vert_index(&self, vert: T) -> Option { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new_weighted` [INFO] [stderr] --> src/graph.rs:161:12 [INFO] [stderr] | [INFO] [stderr] 161 | pub fn new_weighted(value: u32, from: u32, to: u32) -> Edge { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph.rs:169:12 [INFO] [stderr] | [INFO] [stderr] 169 | pub fn new(from: u32, to: u32) -> Edge { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse` [INFO] [stderr] --> src/graph.rs:177:12 [INFO] [stderr] | [INFO] [stderr] 177 | pub fn reverse(&self) -> Edge { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `compare_values` [INFO] [stderr] --> src/graph.rs:185:12 [INFO] [stderr] | [INFO] [stderr] 185 | pub fn compare_values(&self, other: &Edge) -> Ordering { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `same_ignore_direction` [INFO] [stderr] --> src/graph.rs:189:12 [INFO] [stderr] | [INFO] [stderr] 189 | pub fn same_ignore_direction(&self, other: &Edge) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Empty` [INFO] [stderr] --> src/graph.rs:215:5 [INFO] [stderr] | [INFO] [stderr] 215 | Empty, [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Edges` [INFO] [stderr] --> src/graph.rs:216:5 [INFO] [stderr] | [INFO] [stderr] 216 | Edges(Vec), [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph.rs:220:12 [INFO] [stderr] | [INFO] [stderr] 220 | pub fn new() -> Edges { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `from_edge` [INFO] [stderr] --> src/graph.rs:224:12 [INFO] [stderr] | [INFO] [stderr] 224 | pub fn from_edge(edge: Edge) -> Edges { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `reverse` [INFO] [stderr] --> src/graph.rs:230:12 [INFO] [stderr] | [INFO] [stderr] 230 | pub fn reverse(&mut self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_edge` [INFO] [stderr] --> src/graph.rs:239:12 [INFO] [stderr] | [INFO] [stderr] 239 | pub fn add_edge(&mut self, edge: Edge) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `len` [INFO] [stderr] --> src/graph.rs:252:12 [INFO] [stderr] | [INFO] [stderr] 252 | pub fn len(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `iter` [INFO] [stderr] --> src/graph.rs:259:12 [INFO] [stderr] | [INFO] [stderr] 259 | pub fn iter(&self) -> Iter<'_, Edge> { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph.rs:293:12 [INFO] [stderr] | [INFO] [stderr] 293 | pub fn new() -> Graph { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_adj` [INFO] [stderr] --> src/graph.rs:299:12 [INFO] [stderr] | [INFO] [stderr] 299 | pub fn add_adj(&mut self, edge: Edge) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_adj_both` [INFO] [stderr] --> src/graph.rs:314:12 [INFO] [stderr] | [INFO] [stderr] 314 | pub fn add_adj_both(&mut self, edge: Edge) { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph.rs:340:12 [INFO] [stderr] | [INFO] [stderr] 340 | pub fn new() -> Vertices { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `push` [INFO] [stderr] --> src/graph.rs:344:12 [INFO] [stderr] | [INFO] [stderr] 344 | pub fn push(&mut self, vert: u32) { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `visited_map` [INFO] [stderr] --> src/graph.rs:366:4 [INFO] [stderr] | [INFO] [stderr] 366 | fn visited_map(graph: &Graph) -> HashMap { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `breadth_first_search` [INFO] [stderr] --> src/graph.rs:374:8 [INFO] [stderr] | [INFO] [stderr] 374 | pub fn breadth_first_search(graph: &Graph, first: u32) -> Vertices { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `dfs_visit` [INFO] [stderr] --> src/graph.rs:402:4 [INFO] [stderr] | [INFO] [stderr] 402 | fn dfs_visit(vert: &u32, graph: &Graph, visited: &mut HashMap, result: &mut Vertices) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `depth_first_search` [INFO] [stderr] --> src/graph.rs:421:8 [INFO] [stderr] | [INFO] [stderr] 421 | pub fn depth_first_search(graph: &Graph) -> Vertices { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `depth_first_search_iter` [INFO] [stderr] --> src/graph.rs:434:8 [INFO] [stderr] | [INFO] [stderr] 434 | pub fn depth_first_search_iter(graph: &Graph) -> Vertices { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `edges_sorted_asc` [INFO] [stderr] --> src/graph.rs:470:4 [INFO] [stderr] | [INFO] [stderr] 470 | fn edges_sorted_asc(graph: &Graph) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `union_sets` [INFO] [stderr] --> src/graph.rs:490:4 [INFO] [stderr] | [INFO] [stderr] 490 | fn union_sets(sets: &mut HashMap, first: u32, second: u32) { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `minimal_spanning_tree_kruskal` [INFO] [stderr] --> src/graph.rs:501:8 [INFO] [stderr] | [INFO] [stderr] 501 | pub fn minimal_spanning_tree_kruskal(graph: &Graph) -> Edges { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Inf` [INFO] [stderr] --> src/graph.rs:519:5 [INFO] [stderr] | [INFO] [stderr] 519 | Inf, [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] note: `Distance` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stderr] --> src/graph.rs:517:10 [INFO] [stderr] | [INFO] [stderr] 517 | #[derive(Clone, Copy)] [INFO] [stderr] | ^^^^^ [INFO] [stderr] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Dist` [INFO] [stderr] --> src/graph.rs:520:5 [INFO] [stderr] | [INFO] [stderr] 520 | Dist(u32), [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] note: `Distance` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stderr] --> src/graph.rs:517:10 [INFO] [stderr] | [INFO] [stderr] 517 | #[derive(Clone, Copy)] [INFO] [stderr] | ^^^^^ [INFO] [stderr] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `set_dist` [INFO] [stderr] --> src/graph.rs:524:12 [INFO] [stderr] | [INFO] [stderr] 524 | pub fn set_dist(&mut self, value: u32) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `minimal_spanning_tree_prim` [INFO] [stderr] --> src/graph.rs:575:8 [INFO] [stderr] | [INFO] [stderr] 575 | pub fn minimal_spanning_tree_prim(graph: &Graph, root: u32) -> Edges { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `initialize_single_source_dijkstra` [INFO] [stderr] --> src/graph.rs:620:4 [INFO] [stderr] | [INFO] [stderr] 620 | fn initialize_single_source_dijkstra(graph: &Graph, source: u32) -> PositionTrackingMinHeap { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `initialize_single_source` [INFO] [stderr] --> src/graph.rs:633:4 [INFO] [stderr] | [INFO] [stderr] 633 | fn initialize_single_source(graph: &Graph, source: u32) -> HashMap> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `relax` [INFO] [stderr] --> src/graph.rs:644:4 [INFO] [stderr] | [INFO] [stderr] 644 | fn relax( [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `recreate_path` [INFO] [stderr] --> src/graph.rs:663:4 [INFO] [stderr] | [INFO] [stderr] 663 | fn recreate_path(start: u32, end: u32, predecessors: &HashMap) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `attributes_to_predecessors` [INFO] [stderr] --> src/graph.rs:683:4 [INFO] [stderr] | [INFO] [stderr] 683 | fn attributes_to_predecessors(attributes: &HashMap>) -> HashMap { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `shortest_path_bellman_ford` [INFO] [stderr] --> src/graph.rs:696:8 [INFO] [stderr] | [INFO] [stderr] 696 | pub fn shortest_path_bellman_ford(graph: &Graph, start: u32, end: u32) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `shortest_path_dijkstra` [INFO] [stderr] --> src/graph.rs:710:8 [INFO] [stderr] | [INFO] [stderr] 710 | pub fn shortest_path_dijkstra(graph: &Graph, start: u32, end: u32) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Obstacle` [INFO] [stderr] --> src/graph.rs:731:5 [INFO] [stderr] | [INFO] [stderr] 731 | Obstacle, [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Visited` [INFO] [stderr] --> src/graph.rs:732:5 [INFO] [stderr] | [INFO] [stderr] 732 | Visited, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Height` [INFO] [stderr] --> src/graph.rs:733:5 [INFO] [stderr] | [INFO] [stderr] 733 | Height(u32), [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get_height` [INFO] [stderr] --> src/graph.rs:737:12 [INFO] [stderr] | [INFO] [stderr] 737 | pub fn get_height(&self) -> Option { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `width` [INFO] [stderr] --> src/graph.rs:758:5 [INFO] [stderr] | [INFO] [stderr] 758 | width: u32, [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `height` [INFO] [stderr] --> src/graph.rs:759:5 [INFO] [stderr] | [INFO] [stderr] 759 | height: u32, [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph.rs:766:12 [INFO] [stderr] | [INFO] [stderr] 766 | pub fn new(x: u32, y: u32) -> Point2d { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph.rs:786:12 [INFO] [stderr] | [INFO] [stderr] 786 | pub fn new(width: u32, height: u32) -> TerrainMap { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `distance` [INFO] [stderr] --> src/graph.rs:805:12 [INFO] [stderr] | [INFO] [stderr] 805 | pub fn distance(&self, curr: &Point2d, neighbor: &Point2d) -> Option { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `neighbors` [INFO] [stderr] --> src/graph.rs:819:12 [INFO] [stderr] | [INFO] [stderr] 819 | pub fn neighbors(&self, vert: &Point2d) -> Vec { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/graph.rs:846:12 [INFO] [stderr] | [INFO] [stderr] 846 | pub fn get(&self, x: u32, y: u32) -> Option<&MapSlice> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get_mut` [INFO] [stderr] --> src/graph.rs:851:12 [INFO] [stderr] | [INFO] [stderr] 851 | pub fn get_mut(&mut self, x: u32, y: u32) -> Option<&mut MapSlice> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `put_obstacle` [INFO] [stderr] --> src/graph.rs:856:12 [INFO] [stderr] | [INFO] [stderr] 856 | pub fn put_obstacle(&mut self, from: Point2d, to: Point2d) { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `a_star_recreate_path` [INFO] [stderr] --> src/graph.rs:893:4 [INFO] [stderr] | [INFO] [stderr] 893 | fn a_star_recreate_path( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `shortest_path_a_star` [INFO] [stderr] --> src/graph.rs:918:8 [INFO] [stderr] | [INFO] [stderr] 918 | pub fn shortest_path_a_star( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `mark_path` [INFO] [stderr] --> src/graph.rs:967:8 [INFO] [stderr] | [INFO] [stderr] 967 | pub fn mark_path(graph: &mut TerrainMap, path: &Vec) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/heap.rs:17:12 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn new(func: F) -> MinHeap { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_empty` [INFO] [stderr] --> src/heap.rs:32:12 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min_heapify` [INFO] [stderr] --> src/heap.rs:36:12 [INFO] [stderr] | [INFO] [stderr] 36 | pub fn min_heapify(&mut self, index: usize) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `extract_min` [INFO] [stderr] --> src/heap.rs:62:12 [INFO] [stderr] | [INFO] [stderr] 62 | pub fn extract_min(&mut self) -> T { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `heap_decrease_key` [INFO] [stderr] --> src/heap.rs:68:12 [INFO] [stderr] | [INFO] [stderr] 68 | pub fn heap_decrease_key(&mut self, index: usize, value: T) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `insert` [INFO] [stderr] --> src/heap.rs:90:12 [INFO] [stderr] | [INFO] [stderr] 90 | pub fn insert(&mut self, value: T) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/heap.rs:95:12 [INFO] [stderr] | [INFO] [stderr] 95 | pub fn get(&self, index: usize) -> Option<&T> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `size` [INFO] [stderr] --> src/heap.rs:99:12 [INFO] [stderr] | [INFO] [stderr] 99 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `FibonacciHeapNode` [INFO] [stderr] --> src/heap.rs:124:8 [INFO] [stderr] | [INFO] [stderr] 124 | struct FibonacciHeapNode { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/heap.rs:135:8 [INFO] [stderr] | [INFO] [stderr] 135 | fn new(value: T) -> FibonacciHeapNode { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `FibonacciHeap` [INFO] [stderr] --> src/heap.rs:148:12 [INFO] [stderr] | [INFO] [stderr] 148 | pub struct FibonacciHeap { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/heap.rs:154:12 [INFO] [stderr] | [INFO] [stderr] 154 | pub fn new() -> FibonacciHeap { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `size` [INFO] [stderr] --> src/heap.rs:161:12 [INFO] [stderr] | [INFO] [stderr] 161 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `insert` [INFO] [stderr] --> src/heap.rs:165:12 [INFO] [stderr] | [INFO] [stderr] 165 | pub fn insert(&mut self, value: T) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `root_level_nodes` [INFO] [stderr] --> src/heap.rs:190:12 [INFO] [stderr] | [INFO] [stderr] 190 | pub fn root_level_nodes(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `heap_link` [INFO] [stderr] --> src/heap.rs:208:15 [INFO] [stderr] | [INFO] [stderr] 208 | unsafe fn heap_link( [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `consolidate` [INFO] [stderr] --> src/heap.rs:235:8 [INFO] [stderr] | [INFO] [stderr] 235 | fn consolidate(&mut self) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `extract_min` [INFO] [stderr] --> src/heap.rs:286:12 [INFO] [stderr] | [INFO] [stderr] 286 | pub fn extract_min(&mut self) -> Option { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/list.rs:11:8 [INFO] [stderr] | [INFO] [stderr] 11 | fn new(value: T) -> LinkedListNode { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_last` [INFO] [stderr] --> src/list.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | fn is_last(&self) -> bool { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `next_is_last` [INFO] [stderr] --> src/list.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | fn next_is_last(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_next` [INFO] [stderr] --> src/list.rs:29:8 [INFO] [stderr] | [INFO] [stderr] 29 | fn add_next(&mut self, next: LinkedListNode) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `LinkedList` [INFO] [stderr] --> src/list.rs:41:12 [INFO] [stderr] | [INFO] [stderr] 41 | pub struct LinkedList { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/list.rs:48:12 [INFO] [stderr] | [INFO] [stderr] 48 | pub fn new() -> LinkedList { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `push_back` [INFO] [stderr] --> src/list.rs:56:12 [INFO] [stderr] | [INFO] [stderr] 56 | pub fn push_back(&mut self, value: T) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `pop_front` [INFO] [stderr] --> src/list.rs:71:12 [INFO] [stderr] | [INFO] [stderr] 71 | pub fn pop_front(&mut self) -> Option { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `pop_back` [INFO] [stderr] --> src/list.rs:93:12 [INFO] [stderr] | [INFO] [stderr] 93 | pub fn pop_back(&mut self) -> Option { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `first` [INFO] [stderr] --> src/list.rs:125:12 [INFO] [stderr] | [INFO] [stderr] 125 | pub fn first(&self) -> Option { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `last` [INFO] [stderr] --> src/list.rs:129:12 [INFO] [stderr] | [INFO] [stderr] 129 | pub fn last(&self) -> Option { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `iter` [INFO] [stderr] --> src/list.rs:133:12 [INFO] [stderr] | [INFO] [stderr] 133 | pub fn iter(&self) -> LinkedListIter { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/list.rs:143:12 [INFO] [stderr] | [INFO] [stderr] 143 | pub fn new(list: &LinkedList) -> LinkedListIter { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DoublyLinkedListNode` [INFO] [stderr] --> src/list.rs:164:8 [INFO] [stderr] | [INFO] [stderr] 164 | struct DoublyLinkedListNode { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/list.rs:171:8 [INFO] [stderr] | [INFO] [stderr] 171 | fn new(value: T) -> DoublyLinkedListNode { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DoublyLinkedList` [INFO] [stderr] --> src/list.rs:180:12 [INFO] [stderr] | [INFO] [stderr] 180 | pub struct DoublyLinkedList { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/list.rs:186:12 [INFO] [stderr] | [INFO] [stderr] 186 | pub fn new() -> DoublyLinkedList { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `push_back` [INFO] [stderr] --> src/list.rs:193:12 [INFO] [stderr] | [INFO] [stderr] 193 | pub fn push_back(&mut self, value: T) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `first` [INFO] [stderr] --> src/list.rs:216:12 [INFO] [stderr] | [INFO] [stderr] 216 | pub fn first(&self) -> Option { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `last` [INFO] [stderr] --> src/list.rs:220:12 [INFO] [stderr] | [INFO] [stderr] 220 | pub fn last(&self) -> Option { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/tree.rs:26:8 [INFO] [stderr] | [INFO] [stderr] 26 | fn new(value: T) -> BinaryTreeNode { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `size` [INFO] [stderr] --> src/tree.rs:38:5 [INFO] [stderr] | [INFO] [stderr] 38 | size: usize, [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/tree.rs:42:12 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn new() -> BinaryTree { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `contains` [INFO] [stderr] --> src/tree.rs:49:12 [INFO] [stderr] | [INFO] [stderr] 49 | pub fn contains(&self, value: T) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add` [INFO] [stderr] --> src/tree.rs:66:12 [INFO] [stderr] | [INFO] [stderr] 66 | pub fn add(&mut self, value: T) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `preorder_dfs_iter` [INFO] [stderr] --> src/tree.rs:103:12 [INFO] [stderr] | [INFO] [stderr] 103 | pub fn preorder_dfs_iter(&self) -> BinaryTreeDfsPreorderIterator<'_, T> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/tree.rs:124:12 [INFO] [stderr] | [INFO] [stderr] 124 | pub fn new(tree: &BinaryTree) -> BinaryTreeDfsPreorderIterator { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `parent_parent_right` [INFO] [stderr] --> src/tree.rs:279:8 [INFO] [stderr] | [INFO] [stderr] 279 | fn parent_parent_right(&self) -> Option<*mut RedBlackTreeNode> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `parent_parent_left` [INFO] [stderr] --> src/tree.rs:283:8 [INFO] [stderr] | [INFO] [stderr] 283 | fn parent_parent_left(&self) -> Option<*mut RedBlackTreeNode> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: bounds on generic parameters are not enforced in type aliases [INFO] [stderr] --> src/graph.rs:11:21 [INFO] [stderr] | [INFO] [stderr] 11 | type Predecessor = Option; [INFO] [stderr] | ^^ ^^^^ ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(type_alias_bounds)]` on by default [INFO] [stderr] help: the bound will not be checked when the type alias is used, and should be removed [INFO] [stderr] | [INFO] [stderr] 11 - type Predecessor = Option; [INFO] [stderr] 11 + type Predecessor = Option; [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/graph.rs:351:9 [INFO] [stderr] | [INFO] [stderr] 351 | f.write_str("["); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_must_use)]` on by default [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/graph.rs:356:17 [INFO] [stderr] | [INFO] [stderr] 356 | f.write_str(val.to_string().as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/graph.rs:358:17 [INFO] [stderr] | [INFO] [stderr] 358 | f.write_str(format!(",{}", val).as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/graph.rs:361:9 [INFO] [stderr] | [INFO] [stderr] 361 | f.write_str("]"); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/heap.rs:110:9 [INFO] [stderr] | [INFO] [stderr] 110 | f.write_char('['); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/heap.rs:115:17 [INFO] [stderr] | [INFO] [stderr] 115 | f.write_str(format!("{}", elem).as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/heap.rs:117:17 [INFO] [stderr] | [INFO] [stderr] 117 | f.write_str(format!(",{}", elem).as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/tree.rs:223:9 [INFO] [stderr] | [INFO] [stderr] 223 | f.write_str(format!("{{value: {} ", self.value).as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/tree.rs:226:17 [INFO] [stderr] | [INFO] [stderr] 226 | f.write_str(format!("left: {} ", self.left.as_ref().unwrap()).as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/tree.rs:229:17 [INFO] [stderr] | [INFO] [stderr] 229 | f.write_str(format!("right: {} ", self.right.as_ref().unwrap()).as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/tree.rs:232:9 [INFO] [stderr] | [INFO] [stderr] 232 | f.write_str("}"); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/tree.rs:327:17 [INFO] [stderr] | [INFO] [stderr] 327 | f.write_str(format!("{}", self.root.as_ref().unwrap()).as_str()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] [INFO] [stderr] warning: `algorithms` (bin "algorithms" test) generated 156 warnings [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.06s [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/debug/deps/algorithms-b4385504b60c7753) [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "48258add12460e6a0b47fb26f9f6adb8125404e075016bd9e62411d038f5b851", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "48258add12460e6a0b47fb26f9f6adb8125404e075016bd9e62411d038f5b851", kill_on_drop: false }` [INFO] [stdout] 48258add12460e6a0b47fb26f9f6adb8125404e075016bd9e62411d038f5b851