[INFO] cloning repository https://github.com/rayniel95/rust-little-projects [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/rayniel95/rust-little-projects" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frayniel95%2Frust-little-projects", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frayniel95%2Frust-little-projects'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 493399f7480e34717d1db07e486cba226a9727a1 [INFO] testing rayniel95/rust-little-projects against try#8de4c7234dd9b97c9d76b58671343fdbbc9a433e+target=x86_64-unknown-linux-musl for musl_upgrade_1_2_5_with_libc_patch_0 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frayniel95%2Frust-little-projects" "/workspace/builds/worker-5-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc1/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/rayniel95/rust-little-projects [INFO] finished tweaking git repo https://github.com/rayniel95/rust-little-projects [INFO] tweaked toml for git repo https://github.com/rayniel95/rust-little-projects written to /workspace/builds/worker-5-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/rayniel95/rust-little-projects on toolchain 8de4c7234dd9b97c9d76b58671343fdbbc9a433e [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/rayniel95/rust-little-projects already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded contracts v0.6.2 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 42a2d26392a2c834ea0943d572c2afdb44a88d4e059798650985c847da3a2b2a [INFO] running `Command { std: "docker" "start" "-a" "42a2d26392a2c834ea0943d572c2afdb44a88d4e059798650985c847da3a2b2a", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "42a2d26392a2c834ea0943d572c2afdb44a88d4e059798650985c847da3a2b2a", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "42a2d26392a2c834ea0943d572c2afdb44a88d4e059798650985c847da3a2b2a", kill_on_drop: false }` [INFO] [stdout] 42a2d26392a2c834ea0943d572c2afdb44a88d4e059798650985c847da3a2b2a [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "build" "--frozen" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 0400a0b51c1c24fd436cb5a613c0ec25b2a4444a09b9310917cb3b964717cda9 [INFO] running `Command { std: "docker" "start" "-a" "0400a0b51c1c24fd436cb5a613c0ec25b2a4444a09b9310917cb3b964717cda9", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.112 [INFO] [stderr] Compiling proc-macro2 v1.0.34 [INFO] [stderr] Compiling unicode-xid v0.2.2 [INFO] [stderr] Compiling syn v1.0.84 [INFO] [stderr] Compiling ppv-lite86 v0.2.15 [INFO] [stderr] Compiling getrandom v0.2.3 [INFO] [stderr] Compiling quote v1.0.10 [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 contracts v0.6.2 [INFO] [stderr] Compiling rust-little-projects v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `super::linked_list::LinkedList` [INFO] [stdout] --> src/dsandalgo/linked_list/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::linked_list::LinkedList; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::linked_list::LinkedListError` [INFO] [stdout] --> src/dsandalgo/linked_list/test.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use super::linked_list::LinkedListError; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ptr::NonNull` [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:1:42 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::heap::HeapTree` [INFO] [stdout] --> src/dsandalgo/heap/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::heap::HeapTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::Rng` [INFO] [stdout] --> src/dsandalgo/heap/test.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use rand::Rng; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::Inspect` [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::iter::Inspect; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::isAdmissibleOverpayment::solution` [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::isAdmissibleOverpayment::solution; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::linked_list_disjoint_set::DisjointSet` [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::linked_list_disjoint_set::DisjointSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::distributions::uniform::SampleBorrow` [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use rand::distributions::uniform::SampleBorrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:77:13 [INFO] [stdout] | [INFO] [stdout] 77 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:87:13 [INFO] [stdout] | [INFO] [stdout] 87 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:183:29 [INFO] [stdout] | [INFO] [stdout] 183 | let mut min: HeapPointer; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `LinkToNode` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type LinkToNode = Rc>>; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `newLinkToNode` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn newLinkToNode(value: T) -> LinkToNode{ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LinkedNode` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct LinkedNode{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl LinkedNode{ [INFO] [stdout] | --------------------- associated function in this implementation [INFO] [stdout] 18 | fn new(value: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `LinkedListError` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:26:10 [INFO] [stdout] | [INFO] [stdout] 26 | pub enum LinkedListError{ [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LinkedList` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct LinkedList{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl LinkedList{ [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 37 | pub fn new() -> Self{ [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn count(&self) -> u32{ [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn add_last(& mut self, value: T){ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn pop_first(& mut self) -> Result{ [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | pub fn add_first(& mut self, value: T){ [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | pub fn pop_last(& mut self) -> Result{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `HeapPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:7:6 [INFO] [stdout] | [INFO] [stdout] 7 | type HeapPointer = Rc>>; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `LinkedNodePointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:8:6 [INFO] [stdout] | [INFO] [stdout] 8 | type LinkedNodePointer = Rc>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `HeapWeakPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:9:6 [INFO] [stdout] | [INFO] [stdout] 9 | type HeapWeakPointer = Weak>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `LinkedNodeWeakPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:10:6 [INFO] [stdout] | [INFO] [stdout] 10 | type LinkedNodeWeakPointer = Weak>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `OptionalLinkedNodePointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:11:6 [INFO] [stdout] | [INFO] [stdout] 11 | type OptionalLinkedNodePointer = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `OptionalHeapPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:12:6 [INFO] [stdout] | [INFO] [stdout] 12 | type OptionalHeapPointer = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Heapable` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:14:7 [INFO] [stdout] | [INFO] [stdout] 14 | trait Heapable where Self: Sized { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Cell` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:98:8 [INFO] [stdout] | [INFO] [stdout] 98 | struct Cell{ [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LinkedNode` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | struct LinkedNode{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HeapTree` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:109:12 [INFO] [stdout] | [INFO] [stdout] 109 | pub struct HeapTree{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Heap` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:116:19 [INFO] [stdout] | [INFO] [stdout] 116 | pub(crate) struct Heap{ [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:202:8 [INFO] [stdout] | [INFO] [stdout] 201 | impl LinkedNode { [INFO] [stdout] | --------------------- associated function in this implementation [INFO] [stdout] 202 | fn new(heap: HeapPointer)->LinkedNode{ [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `LinkedNodable` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:211:7 [INFO] [stdout] | [INFO] [stdout] 211 | trait LinkedNodable where Self: Sized{ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_heap_structure_and_reachability` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:446:19 [INFO] [stdout] | [INFO] [stdout] 446 | pub(super) fn test_heap_structure_and_reachability(heap: &HeapPointer) -> i32{ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_heap_partial_ordering` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:476:19 [INFO] [stdout] | [INFO] [stdout] 476 | pub(super) fn test_heap_partial_ordering(heap: &HeapPointer) -> bool{ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solution` is never used [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solution(prices: Vec, notes: Vec, x: f64) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `DisjointSetable` is never used [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7 [INFO] [stdout] | [INFO] [stdout] 6 | trait DisjointSetable { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `parent`, `rank`, and `index` are never read [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:39:5 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Set{ [INFO] [stdout] | --- fields in this struct [INFO] [stdout] 39 | parent: Option, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 40 | rank: u32, [INFO] [stdout] | ^^^^ [INFO] [stdout] 41 | index: u32, [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DisjointSet` is never constructed [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub struct DisjointSet{ [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find_set`, and `merge` are never used [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl DisjointSet{ [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 65 | pub fn new(size: u32)->Self{ [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn find_set(& mut self, index: usize)->u32{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | pub fn merge(&self, index1: usize, index2: usize){ [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `SetLink` is never used [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type SetLink = Rc>; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NodeSet` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct NodeSet { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl NodeSet { [INFO] [stdout] | ------------ associated function in this implementation [INFO] [stdout] 13 | fn new(index: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DisjointSet` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct DisjointSet { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find_set`, `merge`, and `insert` are never used [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl DisjointSet { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 28 | pub fn new(lenght: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn find_set(&self, index: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn merge(&self, index1: usize, index2: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn insert(&self, one: usize, two: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stdout] --> src/dsandalgo/mod.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | mod isAdmissibleOverpayment; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `newLinkToNode` should have a snake case name [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn newLinkToNode(value: T) -> LinkToNode{ [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:132:23 [INFO] [stdout] | [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:140:22 [INFO] [stdout] | [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: structure field `parentOfLast` should have a snake case name [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:112:5 [INFO] [stdout] | [INFO] [stdout] 112 | parentOfLast: Option>, [INFO] [stdout] | ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | mod isAdmissibleOverpayment; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 10.64s [INFO] running `Command { std: "docker" "inspect" "0400a0b51c1c24fd436cb5a613c0ec25b2a4444a09b9310917cb3b964717cda9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "0400a0b51c1c24fd436cb5a613c0ec25b2a4444a09b9310917cb3b964717cda9", kill_on_drop: false }` [INFO] [stdout] 0400a0b51c1c24fd436cb5a613c0ec25b2a4444a09b9310917cb3b964717cda9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--no-run" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 9d520d352964a4567f2ea3851653bddf98428046629036d95e8308b455cc9982 [INFO] running `Command { std: "docker" "start" "-a" "9d520d352964a4567f2ea3851653bddf98428046629036d95e8308b455cc9982", kill_on_drop: false }` [INFO] [stdout] warning: unused import: `super::linked_list::LinkedList` [INFO] [stdout] --> src/dsandalgo/linked_list/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::linked_list::LinkedList; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::linked_list::LinkedListError` [INFO] [stdout] --> src/dsandalgo/linked_list/test.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use super::linked_list::LinkedListError; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ptr::NonNull` [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:1:42 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::heap::HeapTree` [INFO] [stdout] --> src/dsandalgo/heap/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::heap::HeapTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::Rng` [INFO] [stdout] --> src/dsandalgo/heap/test.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use rand::Rng; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::Inspect` [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::iter::Inspect; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::isAdmissibleOverpayment::solution` [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::isAdmissibleOverpayment::solution; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::linked_list_disjoint_set::DisjointSet` [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/test.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use super::linked_list_disjoint_set::DisjointSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::distributions::uniform::SampleBorrow` [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use rand::distributions::uniform::SampleBorrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:77:13 [INFO] [stdout] | [INFO] [stdout] 77 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:87:13 [INFO] [stdout] | [INFO] [stdout] 87 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:183:29 [INFO] [stdout] | [INFO] [stdout] 183 | let mut min: HeapPointer; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `LinkToNode` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type LinkToNode = Rc>>; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `newLinkToNode` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn newLinkToNode(value: T) -> LinkToNode{ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LinkedNode` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct LinkedNode{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl LinkedNode{ [INFO] [stdout] | --------------------- associated function in this implementation [INFO] [stdout] 18 | fn new(value: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `LinkedListError` is never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:26:10 [INFO] [stdout] | [INFO] [stdout] 26 | pub enum LinkedListError{ [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LinkedList` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct LinkedList{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl LinkedList{ [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 37 | pub fn new() -> Self{ [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn count(&self) -> u32{ [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn add_last(& mut self, value: T){ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn pop_first(& mut self) -> Result{ [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | pub fn add_first(& mut self, value: T){ [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | pub fn pop_last(& mut self) -> Result{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `HeapPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:7:6 [INFO] [stdout] | [INFO] [stdout] 7 | type HeapPointer = Rc>>; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `LinkedNodePointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:8:6 [INFO] [stdout] | [INFO] [stdout] 8 | type LinkedNodePointer = Rc>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `HeapWeakPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:9:6 [INFO] [stdout] | [INFO] [stdout] 9 | type HeapWeakPointer = Weak>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `LinkedNodeWeakPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:10:6 [INFO] [stdout] | [INFO] [stdout] 10 | type LinkedNodeWeakPointer = Weak>>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `OptionalLinkedNodePointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:11:6 [INFO] [stdout] | [INFO] [stdout] 11 | type OptionalLinkedNodePointer = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `OptionalHeapPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:12:6 [INFO] [stdout] | [INFO] [stdout] 12 | type OptionalHeapPointer = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Heapable` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:14:7 [INFO] [stdout] | [INFO] [stdout] 14 | trait Heapable where Self: Sized { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Cell` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:98:8 [INFO] [stdout] | [INFO] [stdout] 98 | struct Cell{ [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LinkedNode` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | struct LinkedNode{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HeapTree` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:109:12 [INFO] [stdout] | [INFO] [stdout] 109 | pub struct HeapTree{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Heap` is never constructed [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:116:19 [INFO] [stdout] | [INFO] [stdout] 116 | pub(crate) struct Heap{ [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:202:8 [INFO] [stdout] | [INFO] [stdout] 201 | impl LinkedNode { [INFO] [stdout] | --------------------- associated function in this implementation [INFO] [stdout] 202 | fn new(heap: HeapPointer)->LinkedNode{ [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `LinkedNodable` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:211:7 [INFO] [stdout] | [INFO] [stdout] 211 | trait LinkedNodable where Self: Sized{ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_heap_structure_and_reachability` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:446:19 [INFO] [stdout] | [INFO] [stdout] 446 | pub(super) fn test_heap_structure_and_reachability(heap: &HeapPointer) -> i32{ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_heap_partial_ordering` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:476:19 [INFO] [stdout] | [INFO] [stdout] 476 | pub(super) fn test_heap_partial_ordering(heap: &HeapPointer) -> bool{ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solution` is never used [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn solution(prices: Vec, notes: Vec, x: f64) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `DisjointSetable` is never used [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7 [INFO] [stdout] | [INFO] [stdout] 6 | trait DisjointSetable { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `parent`, `rank`, and `index` are never read [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:39:5 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Set{ [INFO] [stdout] | --- fields in this struct [INFO] [stdout] 39 | parent: Option, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 40 | rank: u32, [INFO] [stdout] | ^^^^ [INFO] [stdout] 41 | index: u32, [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DisjointSet` is never constructed [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub struct DisjointSet{ [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling rust-little-projects v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: associated items `new`, `find_set`, and `merge` are never used [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl DisjointSet{ [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 65 | pub fn new(size: u32)->Self{ [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn find_set(& mut self, index: usize)->u32{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | pub fn merge(&self, index1: usize, index2: usize){ [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `SetLink` is never used [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type SetLink = Rc>; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NodeSet` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct NodeSet { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl NodeSet { [INFO] [stdout] | ------------ associated function in this implementation [INFO] [stdout] 13 | fn new(index: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DisjointSet` is never constructed [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct DisjointSet { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find_set`, `merge`, and `insert` are never used [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl DisjointSet { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 28 | pub fn new(lenght: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn find_set(&self, index: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn merge(&self, index1: usize, index2: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn insert(&self, one: usize, two: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stdout] --> src/dsandalgo/mod.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | mod isAdmissibleOverpayment; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `newLinkToNode` should have a snake case name [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn newLinkToNode(value: T) -> LinkToNode{ [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:132:23 [INFO] [stdout] | [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:140:22 [INFO] [stdout] | [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: structure field `parentOfLast` should have a snake case name [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:112:5 [INFO] [stdout] | [INFO] [stdout] 112 | parentOfLast: Option>, [INFO] [stdout] | ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | mod isAdmissibleOverpayment; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::linked_list::LinkedListError` [INFO] [stdout] --> src/dsandalgo/linked_list/test.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use super::linked_list::LinkedListError; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ptr::NonNull` [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:1:42 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/dsandalgo/heap/test.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `cmp::Ordering` and `vec` [INFO] [stdout] --> src/dsandalgo/heap/test.rs:7:15 [INFO] [stdout] | [INFO] [stdout] 7 | use std::{cmp::Ordering, vec}; [INFO] [stdout] | ^^^^^^^^^^^^^ ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::Inspect` [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::iter::Inspect; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `cmp::Ordering` and `convert::TryInto` [INFO] [stdout] --> src/dsandalgo/linked_list_disjoint_set/test.rs:5:15 [INFO] [stdout] | [INFO] [stdout] 5 | use std::{cmp::Ordering, convert::TryInto, vec}; [INFO] [stdout] | ^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::distributions::uniform::SampleBorrow` [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use rand::distributions::uniform::SampleBorrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:77:13 [INFO] [stdout] | [INFO] [stdout] 77 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:87:13 [INFO] [stdout] | [INFO] [stdout] 87 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:183:29 [INFO] [stdout] | [INFO] [stdout] 183 | let mut min: HeapPointer; [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/dsandalgo/heap/test.rs:23:17 [INFO] [stdout] | [INFO] [stdout] 23 | let mut new_min = my_heap.pop().unwrap(); [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `OptionalLinkedNodePointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:11:6 [INFO] [stdout] | [INFO] [stdout] 11 | type OptionalLinkedNodePointer = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `OptionalHeapPointer` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:12:6 [INFO] [stdout] | [INFO] [stdout] 12 | type OptionalHeapPointer = Option>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `has_left_child` and `is_right_child` are never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | trait Heapable where Self: Sized { [INFO] [stdout] | -------- methods in this trait [INFO] [stdout] 15 | fn has_left_child(&self)->bool; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_right_child(&self, other: &Self)->bool; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_heap_structure_and_reachability` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:446:19 [INFO] [stdout] | [INFO] [stdout] 446 | pub(super) fn test_heap_structure_and_reachability(heap: &HeapPointer) -> i32{ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_heap_partial_ordering` is never used [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:476:19 [INFO] [stdout] | [INFO] [stdout] 476 | pub(super) fn test_heap_partial_ordering(heap: &HeapPointer) -> bool{ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `DisjointSetable` is never used [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7 [INFO] [stdout] | [INFO] [stdout] 6 | trait DisjointSetable { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `parent`, `rank`, and `index` are never read [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:39:5 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Set{ [INFO] [stdout] | --- fields in this struct [INFO] [stdout] 39 | parent: Option, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 40 | rank: u32, [INFO] [stdout] | ^^^^ [INFO] [stdout] 41 | index: u32, [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DisjointSet` is never constructed [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub struct DisjointSet{ [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find_set`, and `merge` are never used [INFO] [stdout] --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl DisjointSet{ [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 65 | pub fn new(size: u32)->Self{ [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn find_set(& mut self, index: usize)->u32{ [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | pub fn merge(&self, index1: usize, index2: usize){ [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stdout] --> src/dsandalgo/mod.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | mod isAdmissibleOverpayment; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `newLinkToNode` should have a snake case name [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn newLinkToNode(value: T) -> LinkToNode{ [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:132:23 [INFO] [stdout] | [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/dsandalgo/linked_list/linked_list.rs:140:22 [INFO] [stdout] | [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/dsandalgo/linked_list/test.rs:60:13 [INFO] [stdout] | [INFO] [stdout] 60 | list.pop_first(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 60 | let _ = list.pop_first(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/dsandalgo/linked_list/test.rs:113:13 [INFO] [stdout] | [INFO] [stdout] 113 | list.pop_last(); [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 113 | let _ = list.pop_last(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: structure field `parentOfLast` should have a snake case name [INFO] [stdout] --> src/dsandalgo/heap/heap.rs:112:5 [INFO] [stdout] | [INFO] [stdout] 112 | parentOfLast: Option>, [INFO] [stdout] | ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stdout] --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | mod isAdmissibleOverpayment; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.90s [INFO] running `Command { std: "docker" "inspect" "9d520d352964a4567f2ea3851653bddf98428046629036d95e8308b455cc9982", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "9d520d352964a4567f2ea3851653bddf98428046629036d95e8308b455cc9982", kill_on_drop: false }` [INFO] [stdout] 9d520d352964a4567f2ea3851653bddf98428046629036d95e8308b455cc9982 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 8c7376b934e3d3d4498ed34f1be0fc5d7cfa53495d23673c5727fd71e4562029 [INFO] running `Command { std: "docker" "start" "-a" "8c7376b934e3d3d4498ed34f1be0fc5d7cfa53495d23673c5727fd71e4562029", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `super::linked_list::LinkedList` [INFO] [stderr] --> src/dsandalgo/linked_list/test.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use super::linked_list::LinkedList; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::linked_list::LinkedListError` [INFO] [stderr] --> src/dsandalgo/linked_list/test.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use super::linked_list::LinkedListError; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `ptr::NonNull` [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:1:42 [INFO] [stderr] | [INFO] [stderr] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull}; [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::heap::HeapTree` [INFO] [stderr] --> src/dsandalgo/heap/test.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use super::heap::HeapTree; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rand::Rng` [INFO] [stderr] --> src/dsandalgo/heap/test.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use rand::Rng; [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::iter::Inspect` [INFO] [stderr] --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::iter::Inspect; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::isAdmissibleOverpayment::solution` [INFO] [stderr] --> src/dsandalgo/isAdmissibleOverpayment/test.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use super::isAdmissibleOverpayment::solution; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `super::linked_list_disjoint_set::DisjointSet` [INFO] [stderr] --> src/dsandalgo/linked_list_disjoint_set/test.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use super::linked_list_disjoint_set::DisjointSet; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rand::distributions::uniform::SampleBorrow` [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:5:5 [INFO] [stderr] | [INFO] [stderr] 5 | use rand::distributions::uniform::SampleBorrow; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:77:13 [INFO] [stderr] | [INFO] [stderr] 77 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:87:13 [INFO] [stderr] | [INFO] [stderr] 87 | let mut pointer = Rc::clone(self); [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/dsandalgo/heap/heap.rs:183:29 [INFO] [stderr] | [INFO] [stderr] 183 | let mut min: HeapPointer; [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: type alias `LinkToNode` is never used [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:5:6 [INFO] [stderr] | [INFO] [stderr] 5 | type LinkToNode = Rc>>; [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `newLinkToNode` is never used [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:7:4 [INFO] [stderr] | [INFO] [stderr] 7 | fn newLinkToNode(value: T) -> LinkToNode{ [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `LinkedNode` is never constructed [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:12:8 [INFO] [stderr] | [INFO] [stderr] 12 | struct LinkedNode{ [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 17 | impl LinkedNode{ [INFO] [stderr] | --------------------- associated function in this implementation [INFO] [stderr] 18 | fn new(value: T) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: enum `LinkedListError` is never used [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:26:10 [INFO] [stderr] | [INFO] [stderr] 26 | pub enum LinkedListError{ [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `LinkedList` is never constructed [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:30:12 [INFO] [stderr] | [INFO] [stderr] 30 | pub struct LinkedList{ [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:37:12 [INFO] [stderr] | [INFO] [stderr] 36 | impl LinkedList{ [INFO] [stderr] | --------------------- associated items in this implementation [INFO] [stderr] 37 | pub fn new() -> Self{ [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 45 | pub fn count(&self) -> u32{ [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 49 | pub fn add_last(& mut self, value: T){ [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 65 | pub fn pop_first(& mut self) -> Result{ [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 85 | pub fn add_first(& mut self, value: T){ [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 99 | pub fn pop_last(& mut self) -> Result{ [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `HeapPointer` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:7:6 [INFO] [stderr] | [INFO] [stderr] 7 | type HeapPointer = Rc>>; [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `LinkedNodePointer` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:8:6 [INFO] [stderr] | [INFO] [stderr] 8 | type LinkedNodePointer = Rc>>; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `HeapWeakPointer` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:9:6 [INFO] [stderr] | [INFO] [stderr] 9 | type HeapWeakPointer = Weak>>; [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `LinkedNodeWeakPointer` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:10:6 [INFO] [stderr] | [INFO] [stderr] 10 | type LinkedNodeWeakPointer = Weak>>; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `OptionalLinkedNodePointer` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:11:6 [INFO] [stderr] | [INFO] [stderr] 11 | type OptionalLinkedNodePointer = Option>; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `OptionalHeapPointer` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:12:6 [INFO] [stderr] | [INFO] [stderr] 12 | type OptionalHeapPointer = Option>; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: trait `Heapable` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:14:7 [INFO] [stderr] | [INFO] [stderr] 14 | trait Heapable where Self: Sized { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Cell` is never constructed [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:98:8 [INFO] [stderr] | [INFO] [stderr] 98 | struct Cell{ [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `LinkedNode` is never constructed [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:103:8 [INFO] [stderr] | [INFO] [stderr] 103 | struct LinkedNode{ [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `HeapTree` is never constructed [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:109:12 [INFO] [stderr] | [INFO] [stderr] 109 | pub struct HeapTree{ [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Heap` is never constructed [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:116:19 [INFO] [stderr] | [INFO] [stderr] 116 | pub(crate) struct Heap{ [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:202:8 [INFO] [stderr] | [INFO] [stderr] 201 | impl LinkedNode { [INFO] [stderr] | --------------------- associated function in this implementation [INFO] [stderr] 202 | fn new(heap: HeapPointer)->LinkedNode{ [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: trait `LinkedNodable` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:211:7 [INFO] [stderr] | [INFO] [stderr] 211 | trait LinkedNodable where Self: Sized{ [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `test_heap_structure_and_reachability` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:446:19 [INFO] [stderr] | [INFO] [stderr] 446 | pub(super) fn test_heap_structure_and_reachability(heap: &HeapPointer) -> i32{ [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `test_heap_partial_ordering` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:476:19 [INFO] [stderr] | [INFO] [stderr] 476 | pub(super) fn test_heap_partial_ordering(heap: &HeapPointer) -> bool{ [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `solution` is never used [INFO] [stderr] --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn solution(prices: Vec, notes: Vec, x: f64) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: trait `DisjointSetable` is never used [INFO] [stderr] --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7 [INFO] [stderr] | [INFO] [stderr] 6 | trait DisjointSetable { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: fields `parent`, `rank`, and `index` are never read [INFO] [stderr] --> src/dsandalgo/disjoint_set/disjoint_set.rs:39:5 [INFO] [stderr] | [INFO] [stderr] 38 | pub struct Set{ [INFO] [stderr] | --- fields in this struct [INFO] [stderr] 39 | parent: Option, [INFO] [stderr] | ^^^^^^ [INFO] [stderr] 40 | rank: u32, [INFO] [stderr] | ^^^^ [INFO] [stderr] 41 | index: u32, [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `DisjointSet` is never constructed [INFO] [stderr] --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12 [INFO] [stderr] | [INFO] [stderr] 60 | pub struct DisjointSet{ [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `find_set`, and `merge` are never used [INFO] [stderr] --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12 [INFO] [stderr] | [INFO] [stderr] 64 | impl DisjointSet{ [INFO] [stderr] | ----------------- associated items in this implementation [INFO] [stderr] 65 | pub fn new(size: u32)->Self{ [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 72 | pub fn find_set(& mut self, index: usize)->u32{ [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 75 | pub fn merge(&self, index1: usize, index2: usize){ [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `SetLink` is never used [INFO] [stderr] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:3:6 [INFO] [stderr] | [INFO] [stderr] 3 | type SetLink = Rc>; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `NodeSet` is never constructed [INFO] [stderr] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | struct NodeSet { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 12 | impl NodeSet { [INFO] [stderr] | ------------ associated function in this implementation [INFO] [stderr] 13 | fn new(index: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `DisjointSet` is never constructed [INFO] [stderr] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:23:12 [INFO] [stderr] | [INFO] [stderr] 23 | pub struct DisjointSet { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `find_set`, `merge`, and `insert` are never used [INFO] [stderr] --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:28:12 [INFO] [stderr] | [INFO] [stderr] 27 | impl DisjointSet { [INFO] [stderr] | ---------------- associated items in this implementation [INFO] [stderr] 28 | pub fn new(lenght: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 36 | pub fn find_set(&self, index: usize) -> usize { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 45 | pub fn merge(&self, index1: usize, index2: usize) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 64 | fn insert(&self, one: usize, two: usize) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stderr] --> src/dsandalgo/mod.rs:3:5 [INFO] [stderr] | [INFO] [stderr] 3 | mod isAdmissibleOverpayment; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_snake_case)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `newLinkToNode` should have a snake case name [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:7:4 [INFO] [stderr] | [INFO] [stderr] 7 | fn newLinkToNode(value: T) -> LinkToNode{ [INFO] [stderr] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node` [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:132:23 [INFO] [stderr] | [INFO] [stderr] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stderr] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stderr] | | [INFO] [stderr] | this lifetime flows to the output [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stderr] | [INFO] [stderr] 132 | pub fn peek_first(&self)->Option>{ [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/dsandalgo/linked_list/linked_list.rs:140:22 [INFO] [stderr] | [INFO] [stderr] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stderr] | ^^^^^ ------ the lifetime gets resolved as `'_` [INFO] [stderr] | | [INFO] [stderr] | this lifetime flows to the output [INFO] [stderr] | [INFO] [stderr] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stderr] | [INFO] [stderr] 140 | pub fn peek_last(&self)->Option>{ [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: structure field `parentOfLast` should have a snake case name [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:112:5 [INFO] [stderr] | [INFO] [stderr] 112 | parentOfLast: Option>, [INFO] [stderr] | ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last` [INFO] [stderr] [INFO] [stderr] warning: module `isAdmissibleOverpayment` should have a snake case name [INFO] [stderr] --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | mod isAdmissibleOverpayment; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment` [INFO] [stderr] [INFO] [stderr] warning: `rust-little-projects` (lib) generated 50 warnings (run `cargo fix --lib -p rust-little-projects` to apply 13 suggestions) [INFO] [stderr] warning: unused import: `super::linked_list::LinkedListError` [INFO] [stderr] --> src/dsandalgo/linked_list/test.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use super::linked_list::LinkedListError; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `core::num` [INFO] [stderr] --> src/dsandalgo/heap/test.rs:6:9 [INFO] [stderr] | [INFO] [stderr] 6 | use core::num; [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `cmp::Ordering` and `vec` [INFO] [stderr] --> src/dsandalgo/heap/test.rs:7:15 [INFO] [stderr] | [INFO] [stderr] 7 | use std::{cmp::Ordering, vec}; [INFO] [stderr] | ^^^^^^^^^^^^^ ^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `cmp::Ordering` and `convert::TryInto` [INFO] [stderr] --> src/dsandalgo/linked_list_disjoint_set/test.rs:5:15 [INFO] [stderr] | [INFO] [stderr] 5 | use std::{cmp::Ordering, convert::TryInto, vec}; [INFO] [stderr] | ^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/dsandalgo/heap/test.rs:23:17 [INFO] [stderr] | [INFO] [stderr] 23 | let mut new_min = my_heap.pop().unwrap(); [INFO] [stderr] | ----^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: type alias `OptionalLinkedNodePointer` is never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:11:6 [INFO] [stderr] | [INFO] [stderr] 11 | type OptionalLinkedNodePointer = Option>; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: methods `has_left_child` and `is_right_child` are never used [INFO] [stderr] --> src/dsandalgo/heap/heap.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 14 | trait Heapable where Self: Sized { [INFO] [stderr] | -------- methods in this trait [INFO] [stderr] 15 | fn has_left_child(&self)->bool; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 21 | fn is_right_child(&self, other: &Self)->bool; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/dsandalgo/linked_list/test.rs:60:13 [INFO] [stderr] | [INFO] [stderr] 60 | list.pop_first(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] = note: `#[warn(unused_must_use)]` on by default [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 60 | let _ = list.pop_first(); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/dsandalgo/linked_list/test.rs:113:13 [INFO] [stderr] | [INFO] [stderr] 113 | list.pop_last(); [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 113 | let _ = list.pop_last(); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: `rust-little-projects` (lib test) generated 28 warnings (19 duplicates) (run `cargo fix --lib -p rust-little-projects --tests` to apply 5 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.07s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/rust_little_projects-f19fa9b6785e7ee1) [INFO] [stdout] [INFO] [stdout] running 20 tests [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test10 ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test1 ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test2 ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test4 ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test5 ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test6 ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test7 ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::add_first_test ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test8 ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test9 ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::add_last_and_count_test ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::iterator_test ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::extend_test ... ok [INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test3 ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::pop_last_test ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::peek_first_test ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::peek_last_test ... ok [INFO] [stdout] test dsandalgo::linked_list::test::test::pop_first_test ... ok [INFO] [stdout] test dsandalgo::linked_list_disjoint_set::test::test::fuzzy_test ... ok [INFO] [stdout] test dsandalgo::heap::test::test::fuzzy_test has been running for over 60 seconds [INFO] [stdout] test dsandalgo::heap::test::test::fuzzy_test ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 20 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 108.32s [INFO] [stdout] [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/rust_little_projects-50397992501aa6fa) [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" "8c7376b934e3d3d4498ed34f1be0fc5d7cfa53495d23673c5727fd71e4562029", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8c7376b934e3d3d4498ed34f1be0fc5d7cfa53495d23673c5727fd71e4562029", kill_on_drop: false }` [INFO] [stdout] 8c7376b934e3d3d4498ed34f1be0fc5d7cfa53495d23673c5727fd71e4562029