[INFO] cloning repository https://github.com/iLeepop/data_structures_algorithms [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/iLeepop/data_structures_algorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FiLeepop%2Fdata_structures_algorithms", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FiLeepop%2Fdata_structures_algorithms'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] a2c2e56a0397741f6ff7d1d95752e64db38de608 [INFO] testing iLeepop/data_structures_algorithms against master#caccb4d0368bd918ef6668af8e13834d07040417 for pr-146098-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FiLeepop%2Fdata_structures_algorithms" "/workspace/builds/worker-4-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc1/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/iLeepop/data_structures_algorithms [INFO] finished tweaking git repo https://github.com/iLeepop/data_structures_algorithms [INFO] tweaked toml for git repo https://github.com/iLeepop/data_structures_algorithms written to /workspace/builds/worker-4-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/iLeepop/data_structures_algorithms on toolchain caccb4d0368bd918ef6668af8e13834d07040417 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/iLeepop/data_structures_algorithms 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" "+caccb4d0368bd918ef6668af8e13834d07040417" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded proc-macro2 v1.0.87 [INFO] [stderr] Downloaded syn v2.0.79 [INFO] [stderr] Downloaded libc v0.2.159 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 8b149dbc5f5cc6e6dc2bdaa9bdecc3e97cbed3d1677845057c5b0c394a957615 [INFO] running `Command { std: "docker" "start" "-a" "8b149dbc5f5cc6e6dc2bdaa9bdecc3e97cbed3d1677845057c5b0c394a957615", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "8b149dbc5f5cc6e6dc2bdaa9bdecc3e97cbed3d1677845057c5b0c394a957615", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8b149dbc5f5cc6e6dc2bdaa9bdecc3e97cbed3d1677845057c5b0c394a957615", kill_on_drop: false }` [INFO] [stdout] 8b149dbc5f5cc6e6dc2bdaa9bdecc3e97cbed3d1677845057c5b0c394a957615 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] c5fa9bd0474828b036322dde4f1da3d61f8b41a0e1d1f752ceff3b34948f089d [INFO] running `Command { std: "docker" "start" "-a" "c5fa9bd0474828b036322dde4f1da3d61f8b41a0e1d1f752ceff3b34948f089d", kill_on_drop: false }` [INFO] [stderr] Compiling proc-macro2 v1.0.87 [INFO] [stderr] Compiling unicode-ident v1.0.13 [INFO] [stderr] Compiling libc v0.2.159 [INFO] [stderr] Compiling byteorder v1.5.0 [INFO] [stderr] Compiling quote v1.0.37 [INFO] [stderr] Compiling syn v2.0.79 [INFO] [stderr] Compiling getrandom v0.2.15 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling zerocopy-derive v0.7.35 [INFO] [stderr] Compiling zerocopy v0.7.35 [INFO] [stderr] Compiling ppv-lite86 v0.2.20 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling data_structures_algorithms v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `linked_list::*` [INFO] [stdout] --> src/data/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use linked_list::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `list_stack::Stack as ListStack` [INFO] [stdout] --> src/data/mod.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | pub use list_stack::Stack as ListStack; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `lvec::*` [INFO] [stdout] --> src/data/mod.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | pub use lvec::*; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `divide_by_two::*` [INFO] [stdout] --> src/utils/mod.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | pub use divide_by_two::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `hot_potato::*` [INFO] [stdout] --> src/utils/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use hot_potato::*; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `infix_to_postfix::*` [INFO] [stdout] --> src/utils/mod.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | pub use infix_to_postfix::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `pal_checker::*` [INFO] [stdout] --> src/utils/mod.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | pub use pal_checker::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `random_vec::*` [INFO] [stdout] --> src/utils/mod.rs:13:9 [INFO] [stdout] | [INFO] [stdout] 13 | pub use random_vec::*; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/way/quick_sort.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `binary_search::*` [INFO] [stdout] --> src/way/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use binary_search::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::seq::index` [INFO] [stdout] --> src/sort/radix_sort.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use rand::seq::index; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `f32::MIN` [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | use std::{f32::MIN, isize}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `bubble_sort::*` [INFO] [stdout] --> src/sort/mod.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 17 | pub use bubble_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `quick_sort::*` [INFO] [stdout] --> src/sort/mod.rs:18:9 [INFO] [stdout] | [INFO] [stdout] 18 | pub use quick_sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Display` [INFO] [stdout] --> src/tree/binary_tree.rs:2:23 [INFO] [stdout] | [INFO] [stdout] 2 | use std::fmt::{Debug, Display}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/tree/binary_search_tree.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `graph_adjlist::*` [INFO] [stdout] --> src/graph/mod.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | pub use graph_adjlist::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `way::*` [INFO] [stdout] --> src/main.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | use way::*; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `sort::*` [INFO] [stdout] --> src/main.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | use sort::*; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `has_circle` is never read [INFO] [stdout] --> src/graph/topological_sort.rs:115:17 [INFO] [stdout] | [INFO] [stdout] 115 | has_circle = true; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Deque` is never constructed [INFO] [stdout] --> src/data/deque.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Deque { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data/deque.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Deque { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 11 | pub fn new(cap: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn add_front(&mut self, val: T) -> Result<(), String> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn add_rear(&mut self, val: T) -> Result<(), String> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn remove_front(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn remove_rear(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/data/linked_list.rs:4:10 [INFO] [stdout] | [INFO] [stdout] 4 | pub type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `List` is never constructed [INFO] [stdout] --> src/data/linked_list.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct List { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data/linked_list.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data/linked_list.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl List { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 18 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn push(&mut self, elem: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn peek(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn peek_mut(&mut self) -> Option<&mut T> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | pub fn into_iter(self) -> IntoIter { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | pub fn iter(&self) -> Iter { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | pub fn iter_mut(&mut self) -> IterMut { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `IntoIter` is never constructed [INFO] [stdout] --> src/data/linked_list.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub struct IntoIter(List); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Iter` is never constructed [INFO] [stdout] --> src/data/linked_list.rs:86:12 [INFO] [stdout] | [INFO] [stdout] 86 | pub struct Iter<'a, T: 'a> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `IterMut` is never constructed [INFO] [stdout] --> src/data/linked_list.rs:99:12 [INFO] [stdout] | [INFO] [stdout] 99 | pub struct IterMut<'a, T: 'a> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data/list_stack.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/data/list_stack.rs:10:10 [INFO] [stdout] | [INFO] [stdout] 10 | pub type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/data/list_stack.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Node { [INFO] [stdout] | --------------- associated function in this implementation [INFO] [stdout] 13 | pub fn new(data: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Stack` is never constructed [INFO] [stdout] --> src/data/list_stack.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Stack { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, `is_empty`, and `size` are never used [INFO] [stdout] --> src/data/list_stack.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Stack { [INFO] [stdout] | ----------------------- associated items in this implementation [INFO] [stdout] 28 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn push(&mut self, val: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn peek(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data/lvec.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/data/lvec.rs:12:10 [INFO] [stdout] | [INFO] [stdout] 12 | pub type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/data/lvec.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Node { [INFO] [stdout] | --------------- associated function in this implementation [INFO] [stdout] 15 | pub fn new(elem: T) -> Node { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LVec` is never constructed [INFO] [stdout] --> src/data/lvec.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct LVec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data/lvec.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl LVec { [INFO] [stdout] | ----------------------------- associated items in this implementation [INFO] [stdout] 27 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn clear(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | pub fn push(&mut self, elem: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn append(&mut self, other: &mut Self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | pub fn insert(&mut self, mut index: usize, elem: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | pub fn remove(&mut self, index: usize) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | pub fn print_lvec(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Queue` is never constructed [INFO] [stdout] --> src/data/queue.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Queue { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `size` are never used [INFO] [stdout] --> src/data/queue.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Queue { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 11 | pub fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn enqueue(&mut self, val: T) -> Result<(), String> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn dequeue(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Stack` is never constructed [INFO] [stdout] --> src/data/stack.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Stack { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, `is_empty`, and `size` are never used [INFO] [stdout] --> src/data/stack.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Stack { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 11 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn push(&mut self, val: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | pub fn peek(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `divide_by_two` is never used [INFO] [stdout] --> src/utils/divide_by_two.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn divide_by_two(mut dec_num: u32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `base_convert` is never used [INFO] [stdout] --> src/utils/divide_by_two.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn base_convert(mut dec_num: u32, base: u32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hot_potato` is never used [INFO] [stdout] --> src/utils/hot_potato.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn hot_potato(names: Vec<&str>, num: usize) -> &str { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `infix_to_postfix` is never used [INFO] [stdout] --> src/utils/infix_to_postfix.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn infix_to_postfix(infix: &str) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postfix_eval` is never used [INFO] [stdout] --> src/utils/infix_to_postfix.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn postfix_eval(postfix: &str) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `pal_checker` is never used [INFO] [stdout] --> src/utils/pal_checker.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn pal_checker(pal: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `par_match` is never used [INFO] [stdout] --> src/utils/par_checker.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn par_match(open: char, close: char) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `par_checker` is never used [INFO] [stdout] --> src/utils/par_checker.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | pub fn par_checker(par: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `random_vec` is never used [INFO] [stdout] --> src/utils/random_vec.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn random_vec(len: usize, max: i32, min: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search1` is never used [INFO] [stdout] --> src/way/binary_search.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn binary_search1(nums: &[i32], num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search2` is never used [INFO] [stdout] --> src/way/binary_search.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn binary_search2(nums: &[i32], num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exponential_search` is never used [INFO] [stdout] --> src/way/exponential_search.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn exponential_search(nums: &[i32], target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hash1` is never used [INFO] [stdout] --> src/way/hash.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn hash1(astr: &str, size: usize) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HashMap` is never constructed [INFO] [stdout] --> src/way/hash.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct HashMap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/way/hash.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl HashMap { [INFO] [stdout] | ----------------------------------------------- associated items in this implementation [INFO] [stdout] 17 | fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn hash(&self, key: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn rehash(&self, pos: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn insert(&mut self, key: usize, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn remove(&mut self, key: usize) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn get(&self, key: usize) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 123 | fn contains(&self, key: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 130 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `interpolation_search` is never used [INFO] [stdout] --> src/way/interpolation_search.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn interpolation_search(nums: &[i32], target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/way/quick_sort.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn quick_sort(a: &mut [i32], low: usize, high: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort_rec` is never used [INFO] [stdout] --> src/way/quick_sort.rs:13:4 [INFO] [stdout] | [INFO] [stdout] 13 | fn quick_sort_rec(nums: &mut [i32], low: usize, high: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `maopao` is never used [INFO] [stdout] --> src/way/quick_sort.rs:37:4 [INFO] [stdout] | [INFO] [stdout] 37 | fn maopao(a: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `nums_sum1` is never used [INFO] [stdout] --> src/way/recursion.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn nums_sum1(nums: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `nums_sum2` is never used [INFO] [stdout] --> src/way/recursion.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn nums_sum2(nums: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `nums_sum1_t` is never used [INFO] [stdout] --> src/way/recursion.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn nums_sum1_t(num: i32, nums: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `BASESTR` is never used [INFO] [stdout] --> src/way/recursion.rs:35:7 [INFO] [stdout] | [INFO] [stdout] 35 | const BASESTR: [&str; 16] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num2str_rec` is never used [INFO] [stdout] --> src/way/recursion.rs:39:4 [INFO] [stdout] | [INFO] [stdout] 39 | fn num2str_rec(num: i32, base: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hanoi` is never used [INFO] [stdout] --> src/way/recursion.rs:48:4 [INFO] [stdout] | [INFO] [stdout] 48 | fn hanoi(height: usize, from: &str, to: &str, other: &str) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rec_mc1` is never used [INFO] [stdout] --> src/way/recursion.rs:57:4 [INFO] [stdout] | [INFO] [stdout] 57 | fn rec_mc1(cashes: &[u32], amount: u32) -> u32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rec_mc2` is never used [INFO] [stdout] --> src/way/recursion.rs:78:4 [INFO] [stdout] | [INFO] [stdout] 78 | fn rec_mc2(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dp_rec_mc` is never used [INFO] [stdout] --> src/way/recursion.rs:103:4 [INFO] [stdout] | [INFO] [stdout] 103 | fn dp_rec_mc(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dp_rec_mc_show` is never used [INFO] [stdout] --> src/way/recursion.rs:118:4 [INFO] [stdout] | [INFO] [stdout] 118 | fn dp_rec_mc_show( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_cashes` is never used [INFO] [stdout] --> src/way/recursion.rs:141:4 [INFO] [stdout] | [INFO] [stdout] 141 | fn print_cashes(cashes_used: &[u32], mut amount: u32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `fibnacci_rec` is never used [INFO] [stdout] --> src/way/recursion.rs:149:4 [INFO] [stdout] | [INFO] [stdout] 149 | fn fibnacci_rec(n: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `fibnacci_dp` is never used [INFO] [stdout] --> src/way/recursion.rs:157:4 [INFO] [stdout] | [INFO] [stdout] 157 | fn fibnacci_dp(n: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sequential_search` is never used [INFO] [stdout] --> src/way/sequential_search.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn sequential_search(nums: &[i32], num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sequetial_search_pos` is never used [INFO] [stdout] --> src/way/sequential_search.rs:18:4 [INFO] [stdout] | [INFO] [stdout] 18 | fn sequetial_search_pos(nums: &[i32], num: i32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `ordered_sequential_search` is never used [INFO] [stdout] --> src/way/sequential_search.rs:35:4 [INFO] [stdout] | [INFO] [stdout] 35 | fn ordered_sequential_search(nums: &[i32], num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort1` is never used [INFO] [stdout] --> src/sort/bubble_sort.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn bubble_sort1(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort2` is never used [INFO] [stdout] --> src/sort/bubble_sort.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn bubble_sort2(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort3` is never used [INFO] [stdout] --> src/sort/bubble_sort.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn bubble_sort3(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cocktail_sort` is never used [INFO] [stdout] --> src/sort/cocktail_sort.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn cocktail_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `comb_sort` is never used [INFO] [stdout] --> src/sort/comb_sort.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn comb_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cbic_sort` is never used [INFO] [stdout] --> src/sort/cantbelieveitcan_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn cbic_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cbic_sort2` is never used [INFO] [stdout] --> src/sort/cantbelieveitcan_sort.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn cbic_sort2(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/sort/quick_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn quick_sort(nums: &mut [i32], low: usize, high: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/sort/quick_sort.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn partition(nums: &mut [i32], low: usize, high: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/sort/insertion_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn insertion_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bin_insertion_sort` is never used [INFO] [stdout] --> src/sort/bin_insertion_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn bin_insertion_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shell_sort` is never used [INFO] [stdout] --> src/sort/shell_sort.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn shell_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/sort/merge_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn merge_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/sort/merge_sort.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | pub fn merge(nums: &mut [i32], mid: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/sort/selection_sort.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn selection_sort(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `heap_sort` is never used [INFO] [stdout] --> src/sort/heap_sort.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | fn heap_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `move_down` is never used [INFO] [stdout] --> src/sort/heap_sort.rs:36:4 [INFO] [stdout] | [INFO] [stdout] 36 | fn move_down(nums: &mut [i32], mut parent: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Bucket` is never constructed [INFO] [stdout] --> src/sort/bucket_sort.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Bucket { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/sort/bucket_sort.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl Bucket { [INFO] [stdout] | ----------------------- associated function in this implementation [INFO] [stdout] 11 | fn new(hasher: H, value: T) -> Bucket { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bucket_sort` is never used [INFO] [stdout] --> src/sort/bucket_sort.rs:19:4 [INFO] [stdout] | [INFO] [stdout] 19 | fn bucket_sort(nums: &mut [T], hasher: F) [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `counting_sort` is never used [INFO] [stdout] --> src/sort/counting_sort.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn counting_sort(nums: &mut [usize]) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `radix_sort` is never used [INFO] [stdout] --> src/sort/radix_sort.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn radix_sort(nums: &mut [usize]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MIN_MAERGE` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:7:7 [INFO] [stdout] | [INFO] [stdout] 7 | const MIN_MAERGE: usize = 64; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SortState` is never constructed [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct SortState<'a> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Run` is never constructed [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Run { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MergeLo` is never constructed [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct MergeLo<'a> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MergeHi` is never constructed [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct MergeHi<'a> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `calc_minrun` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:40:4 [INFO] [stdout] | [INFO] [stdout] 40 | fn calc_minrun(len: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_run` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:51:4 [INFO] [stdout] | [INFO] [stdout] 51 | fn count_run(list: &mut [i32]) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_run` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:60:4 [INFO] [stdout] | [INFO] [stdout] 60 | fn find_run(list: &[i32]) -> (bool, usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `sort`, `merge_collapse`, and `merge_force_collapse` are never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 81 | impl<'a> SortState<'a> { [INFO] [stdout] | ---------------------- associated items in this implementation [INFO] [stdout] 82 | fn new(list: &'a mut [i32]) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn sort(&mut self) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn merge_collapse(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 159 | fn merge_force_collapse(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:188:4 [INFO] [stdout] | [INFO] [stdout] 188 | fn merge_sort( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_lo` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:202:4 [INFO] [stdout] | [INFO] [stdout] 202 | fn merge_lo( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `merge` are never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:213:15 [INFO] [stdout] | [INFO] [stdout] 212 | impl <'a> MergeLo<'a> { [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 213 | unsafe fn new(list: &'a mut [i32], first_len: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 235 | fn merge(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_hi` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:266:4 [INFO] [stdout] | [INFO] [stdout] 266 | fn merge_hi( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `merge` are never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:278:15 [INFO] [stdout] | [INFO] [stdout] 277 | impl<'a> MergeHi<'a> { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 278 | unsafe fn new( [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 299 | fn merge(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `tim_sort` is never used [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:333:8 [INFO] [stdout] | [INFO] [stdout] 333 | pub fn tim_sort(list: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:4:6 [INFO] [stdout] | [INFO] [stdout] 4 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTree` is never constructed [INFO] [stdout] --> src/tree/binary_tree.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/binary_tree.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl BinaryTree { [INFO] [stdout] | ---------------------------- associated items in this implementation [INFO] [stdout] 14 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn insert_left_tree(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn insert_right_tree(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn get_key(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn set_key(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:62:4 [INFO] [stdout] | [INFO] [stdout] 62 | fn preorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:71:4 [INFO] [stdout] | [INFO] [stdout] 71 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:80:4 [INFO] [stdout] | [INFO] [stdout] 80 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `preorder`, `postorder`, and `inorder` are never used [INFO] [stdout] --> src/tree/binary_tree.rs:90:8 [INFO] [stdout] | [INFO] [stdout] 88 | impl BinaryTree { [INFO] [stdout] | ------------------------------------ methods in this implementation [INFO] [stdout] 89 | // 前序遍历 [INFO] [stdout] 90 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 101 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 112 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/tree/binary_heap.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct BinaryHeap { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/binary_heap.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl BinaryHeap { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 28 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn move_up(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn move_down(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn min_child(&self, i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | fn build_new(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 126 | fn build_add(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/tree/binary_search_tree.rs:7:6 [INFO] [stdout] | [INFO] [stdout] 7 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BST` is never constructed [INFO] [stdout] --> src/tree/binary_search_tree.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct BST { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/binary_search_tree.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 16 | / impl BST [INFO] [stdout] 17 | | where T: Clone + Ord + std::fmt::Debug, [INFO] [stdout] 18 | | U: Clone + std::fmt::Debug { [INFO] [stdout] | |__________________________- associated items in this implementation [INFO] [stdout] 19 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn calc_len(&self, mut i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn insert(&mut self, key: T, val: U) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | fn search(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | fn min(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 155 | fn max(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 165 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `AvlTree` is never used [INFO] [stdout] --> src/tree/avl.rs:9:6 [INFO] [stdout] | [INFO] [stdout] 9 | enum AvlTree { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AvlNode` is never constructed [INFO] [stdout] --> src/tree/avl.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct AvlNode { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/avl.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 22 | / impl AvlTree [INFO] [stdout] 23 | | where T: Ord [INFO] [stdout] | |____________- associated items in this implementation [INFO] [stdout] 24 | { [INFO] [stdout] 25 | fn new() -> AvlTree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn insert(&mut self, val: T) -> (bool, bool) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn rebalance(&mut self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 143 | fn node(&mut self) -> &mut AvlNode { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn left_subtree(&mut self) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 157 | fn right_subtree(&mut self) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 164 | fn rotate_left(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 173 | fn rotate_right(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `len`, `depth`, `is_empty`, and `search` are never used [INFO] [stdout] --> src/tree/avl.rs:187:8 [INFO] [stdout] | [INFO] [stdout] 184 | / impl AvlTree [INFO] [stdout] 185 | | where T: Ord [INFO] [stdout] | |____________- methods in this implementation [INFO] [stdout] 186 | { [INFO] [stdout] 187 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 201 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 208 | fn search(&self, val: &T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/graph_matrix.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Vertex<'a> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/graph/graph_matrix.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Vertex<'_> { [INFO] [stdout] | --------------- associated function in this implementation [INFO] [stdout] 13 | fn new(id: usize, name: &'static str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Edge` is never constructed [INFO] [stdout] --> src/graph/graph_matrix.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Edge { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new` and `set_edge` are never used [INFO] [stdout] --> src/graph/graph_matrix.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 23 | impl Edge { [INFO] [stdout] | --------- associated functions in this implementation [INFO] [stdout] 24 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn set_edge() -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/graph_matrix.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `len`, `is_empty`, and `add_edge` are never used [INFO] [stdout] --> src/graph/graph_matrix.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 39 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 40 | fn new(nodes: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn add_edge(&mut self, n1: &Vertex, n2: &Vertex) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/graph_adjlist.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub struct Vertex { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `adjacent_key`, `add_neighbor`, `get_connects`, and `get_nbr_weight` are never used [INFO] [stdout] --> src/graph/graph_adjlist.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Vertex { [INFO] [stdout] | ------------------------------------ associated items in this implementation [INFO] [stdout] 15 | pub fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn adjacent_key(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn add_neighbor(&mut self, nbr: T, wt: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn get_connects(&self) -> Vec<&T> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn get_nbr_weight(&self, key: &T) -> &i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/graph_adjlist.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/graph/graph_adjlist.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 61 | impl Graph { [INFO] [stdout] | ----------------------------------------------- associated items in this implementation [INFO] [stdout] 62 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | pub fn vertex_num(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | pub fn edge_num(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | pub fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | pub fn add_vertex(&mut self, key: &T) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | pub fn get_vertex(&self, key: &T) -> Option<&Vertex> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | pub fn vertex_keys(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 115 | pub fn remove_vertex(&mut self, key: &T) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 135 | pub fn add_edge(&mut self, from: &T, to: &T, wt: i32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | pub fn adjacent(&self, from: &T, to: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Color` is never used [INFO] [stdout] --> src/graph/word_lader.rs:12:6 [INFO] [stdout] | [INFO] [stdout] 12 | enum Color { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/word_lader.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Vertex { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_neighbor`, and `get_neighbors` are never used [INFO] [stdout] --> src/graph/word_lader.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl Vertex { [INFO] [stdout] | ------------------------------------ associated items in this implementation [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add_neighbor(&mut self, nbr: T, wt: u32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn get_neighbors(&self) -> Vec<&T> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/word_lader.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `contains`, `add_vertex`, and `add_edge` are never used [INFO] [stdout] --> src/graph/word_lader.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl Graph { [INFO] [stdout] | ----------------------------------------------- associated items in this implementation [INFO] [stdout] 59 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn add_vertex(&mut self, key: &T) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn add_edge(&mut self, from: &T, to: &T, wt: u32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_word_graph` is never used [INFO] [stdout] --> src/graph/word_lader.rs:100:4 [INFO] [stdout] | [INFO] [stdout] 100 | fn build_word_graph(words: Vec<&str>) -> Graph { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `word_ladder` is never used [INFO] [stdout] --> src/graph/word_lader.rs:130:4 [INFO] [stdout] | [INFO] [stdout] 130 | fn word_ladder(g: &mut Graph, start: Vertex, end: Vertex, len: usize) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/graph/bfs.rs:6:6 [INFO] [stdout] | [INFO] [stdout] 6 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/graph/bfs.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/graph/bfs.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 14 | fn new(data: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/bfs.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `is_empty`, `get_first`, `print_node`, and `insert` are never used [INFO] [stdout] --> src/graph/bfs.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 28 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn get_first(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn print_node(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn insert(&mut self, data: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_graph` is never used [INFO] [stdout] --> src/graph/bfs.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn build_graph(data: [[usize;2];20]) -> Vec<(Graph, usize)> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bfs` is never used [INFO] [stdout] --> src/graph/bfs.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn bfs(graph: Vec<(Graph, usize)>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `BDSIZE` is never used [INFO] [stdout] --> src/graph/knight_tour.rs:8:7 [INFO] [stdout] | [INFO] [stdout] 8 | const BDSIZE: u32 = 8; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Color` is never used [INFO] [stdout] --> src/graph/knight_tour.rs:12:6 [INFO] [stdout] | [INFO] [stdout] 12 | enum Color { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/knight_tour.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Vertex { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_neighbors`, and `get_neighbors` are never used [INFO] [stdout] --> src/graph/knight_tour.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 24 | impl Vertex { [INFO] [stdout] | ------------------------------------ associated items in this implementation [INFO] [stdout] 25 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn add_neighbors(&mut self, nbr: T) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn get_neighbors(&self) -> Vec<&T> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/knight_tour.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_vertex`, and `add_edge` are never used [INFO] [stdout] --> src/graph/knight_tour.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl Graph { [INFO] [stdout] | ----------------------------------------------- associated items in this implementation [INFO] [stdout] 54 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn add_vertex(&mut self, key: &T) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn add_edge(&mut self, src: &T, des: &T) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `legal_moves` is never used [INFO] [stdout] --> src/graph/knight_tour.rs:83:4 [INFO] [stdout] | [INFO] [stdout] 83 | fn legal_moves(x: u32, y: u32, bdsize: u32) -> Vec<(u32, u32)> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_knight_graph` is never used [INFO] [stdout] --> src/graph/knight_tour.rs:107:4 [INFO] [stdout] | [INFO] [stdout] 107 | fn build_knight_graph(bdsize: u32) -> Graph { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `knight_tour` is never used [INFO] [stdout] --> src/graph/knight_tour.rs:127:4 [INFO] [stdout] | [INFO] [stdout] 127 | fn knight_tour(kg: &mut Graph, curr: Vertex, path: &mut Vec, depth: u32) -> bool [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/graph/dfs.rs:6:6 [INFO] [stdout] | [INFO] [stdout] 6 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/graph/dfs.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/graph/dfs.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 14 | fn new(data: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/dfs.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `is_empty`, `get_first`, `print_node`, and `insert` are never used [INFO] [stdout] --> src/graph/dfs.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 28 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn get_first(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn print_node(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | fn insert(&mut self, data: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_graph` is never used [INFO] [stdout] --> src/graph/dfs.rs:64:4 [INFO] [stdout] | [INFO] [stdout] 64 | fn build_graph(data: [[usize;2];20]) -> Vec<(Graph, usize)> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/graph/dfs.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn dfs(graph: Vec<(Graph, usize)>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Color` is never used [INFO] [stdout] --> src/graph/topological_sort.rs:8:6 [INFO] [stdout] | [INFO] [stdout] 8 | enum Color { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/topological_sort.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Vertex { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `add_neighbor` are never used [INFO] [stdout] --> src/graph/topological_sort.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 21 | impl Vertex { [INFO] [stdout] | ------------------------------------ associated items in this implementation [INFO] [stdout] 22 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn add_neighbor(&mut self, nbr: T) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/topological_sort.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_vertex`, and `add_edge` are never used [INFO] [stdout] --> src/graph/topological_sort.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 43 | impl Graph { [INFO] [stdout] | ----------------------------------------------- associated items in this implementation [INFO] [stdout] 44 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn add_vertex(&mut self, key: &T) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn add_edge(&mut self, src: &T, des: &T) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_graph` is never used [INFO] [stdout] --> src/graph/topological_sort.rs:83:4 [INFO] [stdout] | [INFO] [stdout] 83 | fn build_graph(pre_requisites: Vec>) -> Graph [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `scheduling` is never used [INFO] [stdout] --> src/graph/topological_sort.rs:94:4 [INFO] [stdout] | [INFO] [stdout] 94 | fn scheduling( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_topological_order` is never used [INFO] [stdout] --> src/graph/topological_sort.rs:128:4 [INFO] [stdout] | [INFO] [stdout] 128 | fn find_topological_order( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Color` is never used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:9:6 [INFO] [stdout] | [INFO] [stdout] 9 | enum Color { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Vertex { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_neighbor`, and `get_neighbors` are never used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 21 | impl Vertex { [INFO] [stdout] | ------------------------------------ associated items in this implementation [INFO] [stdout] 22 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn add_neighbor(&mut self, nbr: T) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn get_neighbors(&self) -> Vec<&T> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_vertex`, and `add_edge` are never used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl Graph { [INFO] [stdout] | ----------------------------------------------- associated items in this implementation [INFO] [stdout] 53 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn add_vertex(&mut self, key: &T) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn add_edge(&mut self, src: &T, des: &T) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_city_graph` is never used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:93:4 [INFO] [stdout] | [INFO] [stdout] 93 | fn build_city_graph(connected: Vec>) -> Graph [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_province_num_bfs` is never used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:106:4 [INFO] [stdout] | [INFO] [stdout] 106 | fn find_province_num_bfs(connected: Vec>) -> u32 [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/dijkstra.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Vertex<'a> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/graph/dijkstra.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl<'a> Vertex<'a> { [INFO] [stdout] | ------------------- associated function in this implementation [INFO] [stdout] 12 | fn new(name: &'a str) -> Vertex<'a> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Visited` is never constructed [INFO] [stdout] --> src/graph/dijkstra.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Visited { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dijkstra` is never used [INFO] [stdout] --> src/graph/dijkstra.rs:43:4 [INFO] [stdout] | [INFO] [stdout] 43 | fn dijkstra<'a>( [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/data/linked_list.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn iter(&self) -> Iter { [INFO] [stdout] | ^^^^^ ^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 64 | pub fn iter(&self) -> Iter<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/data/linked_list.rs:71:21 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter_mut(&mut self) -> IterMut { [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter_mut(&mut self) -> IterMut<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:123:25 [INFO] [stdout] | [INFO] [stdout] 123 | q.enqueue(city); [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)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 123 | let _ = q.enqueue(city); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:139:37 [INFO] [stdout] | [INFO] [stdout] 139 | ... q.enqueue(nbrc); [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] 139 | let _ = q.enqueue(nbrc); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 8.26s [INFO] running `Command { std: "docker" "inspect" "c5fa9bd0474828b036322dde4f1da3d61f8b41a0e1d1f752ceff3b34948f089d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "c5fa9bd0474828b036322dde4f1da3d61f8b41a0e1d1f752ceff3b34948f089d", kill_on_drop: false }` [INFO] [stdout] c5fa9bd0474828b036322dde4f1da3d61f8b41a0e1d1f752ceff3b34948f089d [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] e31995b9ae19a87bef48e23fda57755ebd9ddbdc72dd4a9d898a68605cb53dad [INFO] running `Command { std: "docker" "start" "-a" "e31995b9ae19a87bef48e23fda57755ebd9ddbdc72dd4a9d898a68605cb53dad", kill_on_drop: false }` [INFO] [stderr] Compiling data_structures_algorithms v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `linked_list::*` [INFO] [stdout] --> src/data/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use linked_list::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `list_stack::Stack as ListStack` [INFO] [stdout] --> src/data/mod.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | pub use list_stack::Stack as ListStack; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `lvec::*` [INFO] [stdout] --> src/data/mod.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | pub use lvec::*; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `divide_by_two::*` [INFO] [stdout] --> src/utils/mod.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | pub use divide_by_two::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `hot_potato::*` [INFO] [stdout] --> src/utils/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use hot_potato::*; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `infix_to_postfix::*` [INFO] [stdout] --> src/utils/mod.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | pub use infix_to_postfix::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `pal_checker::*` [INFO] [stdout] --> src/utils/mod.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | pub use pal_checker::*; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/way/quick_sort.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `test1` should have an upper camel case name [INFO] [stdout] --> src/way/quick_sort.rs:151:12 [INFO] [stdout] | [INFO] [stdout] 151 | struct test1; [INFO] [stdout] | ^^^^^ help: convert the identifier to upper camel case: `Test1` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_camel_case_types)]` (part of `#[warn(nonstandard_style)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/way/recursion.rs:171:9 [INFO] [stdout] | [INFO] [stdout] 171 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `binary_search::*` [INFO] [stdout] --> src/way/mod.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | pub use binary_search::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::random_vec` [INFO] [stdout] --> src/sort/counting_sort.rs:26:9 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::random_vec; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `rand::seq::index` [INFO] [stdout] --> src/sort/radix_sort.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use rand::seq::index; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `f32::MIN` [INFO] [stdout] --> src/sort/tim_sort_without_gallop.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | use std::{f32::MIN, isize}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Display` [INFO] [stdout] --> src/tree/binary_tree.rs:2:23 [INFO] [stdout] | [INFO] [stdout] 2 | use std::fmt::{Debug, Display}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/tree/binary_search_tree.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `graph_adjlist::*` [INFO] [stdout] --> src/graph/mod.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | pub use graph_adjlist::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `way::*` [INFO] [stdout] --> src/main.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | use way::*; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/way/quick_sort.rs:135:17 [INFO] [stdout] | [INFO] [stdout] 135 | let mut arr = vec![2, 4, 3]; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `has_circle` is never read [INFO] [stdout] --> src/graph/topological_sort.rs:115:17 [INFO] [stdout] | [INFO] [stdout] 115 | has_circle = true; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `is_empty` and `size` are never used [INFO] [stdout] --> src/data/linked_list.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl List { [INFO] [stdout] | --------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `size` is never used [INFO] [stdout] --> src/data/stack.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Stack { [INFO] [stdout] | ---------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lw1` is never used [INFO] [stdout] --> src/way/quick_sort.rs:111:12 [INFO] [stdout] | [INFO] [stdout] 111 | fn lw1() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `lw2` is never used [INFO] [stdout] --> src/way/quick_sort.rs:125:12 [INFO] [stdout] | [INFO] [stdout] 125 | fn lw2() { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `test1` is never constructed [INFO] [stdout] --> src/way/quick_sort.rs:151:12 [INFO] [stdout] | [INFO] [stdout] 151 | struct test1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `test` and `hi` are never used [INFO] [stdout] --> src/way/quick_sort.rs:154:12 [INFO] [stdout] | [INFO] [stdout] 153 | impl test1 { [INFO] [stdout] | ---------- associated functions in this implementation [INFO] [stdout] 154 | fn test() { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn hi() { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort1` is never used [INFO] [stdout] --> src/sort/bubble_sort.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn bubble_sort1(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort2` is never used [INFO] [stdout] --> src/sort/bubble_sort.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn bubble_sort2(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cocktail_sort` is never used [INFO] [stdout] --> src/sort/cocktail_sort.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn cocktail_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cbic_sort` is never used [INFO] [stdout] --> src/sort/cantbelieveitcan_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn cbic_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `cbic_sort2` is never used [INFO] [stdout] --> src/sort/cantbelieveitcan_sort.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn cbic_sort2(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insertion_sort` is never used [INFO] [stdout] --> src/sort/insertion_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn insertion_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `set_key` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl BinaryTree { [INFO] [stdout] | ---------------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 56 | fn set_key(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:62:4 [INFO] [stdout] | [INFO] [stdout] 62 | fn preorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:71:4 [INFO] [stdout] | [INFO] [stdout] 71 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:80:4 [INFO] [stdout] | [INFO] [stdout] 80 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `preorder`, `postorder`, and `inorder` are never used [INFO] [stdout] --> src/tree/binary_tree.rs:90:8 [INFO] [stdout] | [INFO] [stdout] 88 | impl BinaryTree { [INFO] [stdout] | ------------------------------------ methods in this implementation [INFO] [stdout] 89 | // 前序遍历 [INFO] [stdout] 90 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 101 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 112 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/tree/binary_heap.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct BinaryHeap { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/binary_heap.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl BinaryHeap { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 28 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn move_up(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn move_down(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn min_child(&self, i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | fn build_new(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 126 | fn build_add(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/tree/binary_search_tree.rs:7:6 [INFO] [stdout] | [INFO] [stdout] 7 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BST` is never constructed [INFO] [stdout] --> src/tree/binary_search_tree.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct BST { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/binary_search_tree.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 16 | / impl BST [INFO] [stdout] 17 | | where T: Clone + Ord + std::fmt::Debug, [INFO] [stdout] 18 | | U: Clone + std::fmt::Debug { [INFO] [stdout] | |__________________________- associated items in this implementation [INFO] [stdout] 19 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn calc_len(&self, mut i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn insert(&mut self, key: T, val: U) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | fn search(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | fn min(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 155 | fn max(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 165 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `AvlTree` is never used [INFO] [stdout] --> src/tree/avl.rs:9:6 [INFO] [stdout] | [INFO] [stdout] 9 | enum AvlTree { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AvlNode` is never constructed [INFO] [stdout] --> src/tree/avl.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct AvlNode { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/avl.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 22 | / impl AvlTree [INFO] [stdout] 23 | | where T: Ord [INFO] [stdout] | |____________- associated items in this implementation [INFO] [stdout] 24 | { [INFO] [stdout] 25 | fn new() -> AvlTree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn insert(&mut self, val: T) -> (bool, bool) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn rebalance(&mut self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 143 | fn node(&mut self) -> &mut AvlNode { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn left_subtree(&mut self) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 157 | fn right_subtree(&mut self) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 164 | fn rotate_left(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 173 | fn rotate_right(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `len`, `depth`, `is_empty`, and `search` are never used [INFO] [stdout] --> src/tree/avl.rs:187:8 [INFO] [stdout] | [INFO] [stdout] 184 | / impl AvlTree [INFO] [stdout] 185 | | where T: Ord [INFO] [stdout] | |____________- methods in this implementation [INFO] [stdout] 186 | { [INFO] [stdout] 187 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 201 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 208 | fn search(&self, val: &T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Vertex` is never constructed [INFO] [stdout] --> src/graph/graph_matrix.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Vertex<'a> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/graph/graph_matrix.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Vertex<'_> { [INFO] [stdout] | --------------- associated function in this implementation [INFO] [stdout] 13 | fn new(id: usize, name: &'static str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Edge` is never constructed [INFO] [stdout] --> src/graph/graph_matrix.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | struct Edge { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new` and `set_edge` are never used [INFO] [stdout] --> src/graph/graph_matrix.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 23 | impl Edge { [INFO] [stdout] | --------- associated functions in this implementation [INFO] [stdout] 24 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn set_edge() -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/graph_matrix.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `len`, `is_empty`, and `add_edge` are never used [INFO] [stdout] --> src/graph/graph_matrix.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 39 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 40 | fn new(nodes: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn add_edge(&mut self, n1: &Vertex, n2: &Vertex) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `Black` is never constructed [INFO] [stdout] --> src/graph/word_lader.rs:15:5 [INFO] [stdout] | [INFO] [stdout] 12 | enum Color { [INFO] [stdout] | ----- variant in this enum [INFO] [stdout] ... [INFO] [stdout] 15 | Black, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Color` has derived impls for the traits `Debug` and `Clone`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `key` is never read [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:16:5 [INFO] [stdout] | [INFO] [stdout] 15 | struct Vertex { [INFO] [stdout] | ------ field in this struct [INFO] [stdout] 16 | key: T, [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Vertex` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/data/linked_list.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn iter(&self) -> Iter { [INFO] [stdout] | ^^^^^ ^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 64 | pub fn iter(&self) -> Iter<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/data/linked_list.rs:71:21 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter_mut(&mut self) -> IterMut { [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter_mut(&mut self) -> IterMut<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:123:25 [INFO] [stdout] | [INFO] [stdout] 123 | q.enqueue(city); [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)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 123 | let _ = q.enqueue(city); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph/find_province_num_bfs.rs:139:37 [INFO] [stdout] | [INFO] [stdout] 139 | ... q.enqueue(nbrc); [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] 139 | let _ = q.enqueue(nbrc); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 1.97s [INFO] running `Command { std: "docker" "inspect" "e31995b9ae19a87bef48e23fda57755ebd9ddbdc72dd4a9d898a68605cb53dad", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "e31995b9ae19a87bef48e23fda57755ebd9ddbdc72dd4a9d898a68605cb53dad", kill_on_drop: false }` [INFO] [stdout] e31995b9ae19a87bef48e23fda57755ebd9ddbdc72dd4a9d898a68605cb53dad [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 98114993b5a7ae463e3b3f13a43b2e53675bda3d31c808905c32450eb83ec87f [INFO] running `Command { std: "docker" "start" "-a" "98114993b5a7ae463e3b3f13a43b2e53675bda3d31c808905c32450eb83ec87f", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `linked_list::*` [INFO] [stdout] [INFO] [stderr] --> src/data/mod.rs:9:9 [INFO] [stdout] running 57 tests [INFO] [stderr] | [INFO] [stdout] test data::linked_list::tests::test_list ... ok [INFO] [stderr] 9 | pub use linked_list::*; [INFO] [stdout] test data::deque::tests::test_deque ... ok [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stdout] test data::list_stack::tests::test_list_stack ... ok [INFO] [stderr] | [INFO] [stdout] test graph::bfs::tests::test_bfs ... ok [INFO] [stderr] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] test graph::dijkstra::tests::test_dijkstar ... ok [INFO] [stderr] [INFO] [stdout] test graph::dfs::tests::tset_dfs ... ok [INFO] [stderr] warning: unused import: `list_stack::Stack as ListStack` [INFO] [stdout] test graph::find_province_num_bfs::tests::test_find_province ... ok [INFO] [stderr] --> src/data/mod.rs:10:9 [INFO] [stdout] test graph::graph_adjlist::test::test_graph ... ok [INFO] [stderr] | [INFO] [stdout] test graph::topological_sort::tests::test_operation ... ok [INFO] [stderr] 10 | pub use list_stack::Stack as ListStack; [INFO] [stdout] test sort::bucket_sort::tests::test_bucket_sort ... ok [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] test sort::comb_sort::tests::test_comb_sort ... ok [INFO] [stderr] [INFO] [stdout] test sort::comb_sort::tests::test_comb_sort2 ... ok [INFO] [stderr] warning: unused import: `lvec::*` [INFO] [stdout] test graph::word_lader::test::test_word_ladder ... ok [INFO] [stderr] --> src/data/mod.rs:11:9 [INFO] [stdout] test sort::counting_sort::tests::test_counting_sort ... ok [INFO] [stderr] | [INFO] [stdout] test sort::heap_sort::test::test_heap_sort ... ok [INFO] [stderr] 11 | pub use lvec::*; [INFO] [stdout] test sort::merge_sort::test::merge_test ... ok [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `divide_by_two::*` [INFO] [stderr] --> src/utils/mod.rs:8:9 [INFO] [stderr] | [INFO] [stderr] 8 | pub use divide_by_two::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `hot_potato::*` [INFO] [stderr] --> src/utils/mod.rs:9:9 [INFO] [stderr] | [INFO] [stderr] 9 | pub use hot_potato::*; [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `infix_to_postfix::*` [INFO] [stderr] --> src/utils/mod.rs:10:9 [INFO] [stderr] | [INFO] [stderr] 10 | pub use infix_to_postfix::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `pal_checker::*` [INFO] [stderr] --> src/utils/mod.rs:11:9 [INFO] [stderr] | [INFO] [stderr] 11 | pub use pal_checker::*; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `core::num` [INFO] [stderr] --> src/way/quick_sort.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use core::num; [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type `test1` should have an upper camel case name [INFO] [stderr] --> src/way/quick_sort.rs:151:12 [INFO] [stderr] | [INFO] [stderr] 151 | struct test1; [INFO] [stderr] | ^^^^^ help: convert the identifier to upper camel case: `Test1` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_camel_case_types)]` (part of `#[warn(nonstandard_style)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `core::num` [INFO] [stderr] --> src/way/recursion.rs:171:9 [INFO] [stderr] | [INFO] [stderr] 171 | use core::num; [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `binary_search::*` [INFO] [stderr] --> src/way/mod.rs:9:9 [INFO] [stderr] | [INFO] [stderr] 9 | pub use binary_search::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `crate::random_vec` [INFO] [stderr] --> src/sort/counting_sort.rs:26:9 [INFO] [stderr] | [INFO] [stderr] 26 | use crate::random_vec; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rand::seq::index` [INFO] [stderr] --> src/sort/radix_sort.rs:3:5 [INFO] [stderr] | [INFO] [stderr] 3 | use rand::seq::index; [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `f32::MIN` [INFO] [stderr] --> src/sort/tim_sort_without_gallop.rs:3:11 [INFO] [stderr] | [INFO] [stderr] 3 | use std::{f32::MIN, isize}; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Display` [INFO] [stderr] --> src/tree/binary_tree.rs:2:23 [INFO] [stderr] | [INFO] [stderr] 2 | use std::fmt::{Debug, Display}; [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::ops::Deref` [INFO] [stderr] --> src/tree/binary_search_tree.rs:5:5 [INFO] [stderr] | [INFO] [stderr] 5 | use std::ops::Deref; [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `graph_adjlist::*` [INFO] [stderr] --> src/graph/mod.rs:11:9 [INFO] [stderr] | [INFO] [stderr] 11 | pub use graph_adjlist::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `way::*` [INFO] [stderr] --> src/main.rs:10:5 [INFO] [stderr] | [INFO] [stderr] 10 | use way::*; [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/way/quick_sort.rs:135:17 [INFO] [stderr] | [INFO] [stderr] 135 | let mut arr = vec![2, 4, 3]; [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: value assigned to `has_circle` is never read [INFO] [stderr] --> src/graph/topological_sort.rs:115:17 [INFO] [stderr] | [INFO] [stderr] 115 | has_circle = true; [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: methods `is_empty` and `size` are never used [INFO] [stderr] --> src/data/linked_list.rs:25:12 [INFO] [stderr] | [INFO] [stderr] 17 | impl List { [INFO] [stderr] | --------------- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 25 | pub fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 29 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: method `size` is never used [INFO] [stderr] --> src/data/stack.rs:42:12 [INFO] [stderr] | [INFO] [stderr] 10 | impl Stack { [INFO] [stderr] | ---------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 42 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `lw1` is never used [INFO] [stderr] --> src/way/quick_sort.rs:111:12 [INFO] [stderr] | [INFO] [stderr] 111 | fn lw1() { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function `lw2` is never used [INFO] [stderr] --> src/way/quick_sort.rs:125:12 [INFO] [stderr] | [INFO] [stderr] 125 | fn lw2() { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `test1` is never constructed [INFO] [stderr] --> src/way/quick_sort.rs:151:12 [INFO] [stderr] | [INFO] [stderr] 151 | struct test1; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated functions `test` and `hi` are never used [INFO] [stderr] --> src/way/quick_sort.rs:154:12 [INFO] [stderr] | [INFO] [stderr] 153 | impl test1 { [INFO] [stderr] | ---------- associated functions in this implementation [INFO] [stderr] 154 | fn test() { [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 158 | fn hi() { [INFO] [stderr] | ^^ [INFO] [stderr] [INFO] [stderr] warning: function `bubble_sort1` is never used [INFO] [stderr] --> src/sort/bubble_sort.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | pub fn bubble_sort1(nums: &mut [i32]) { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `bubble_sort2` is never used [INFO] [stderr] --> src/sort/bubble_sort.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn bubble_sort2(nums: &mut [i32]) { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `cocktail_sort` is never used [INFO] [stderr] --> src/sort/cocktail_sort.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | pub fn cocktail_sort(nums: &mut [i32]) { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `cbic_sort` is never used [INFO] [stderr] --> src/sort/cantbelieveitcan_sort.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn cbic_sort(nums: &mut [i32]) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `cbic_sort2` is never used [INFO] [stderr] --> src/sort/cantbelieveitcan_sort.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn cbic_sort2(nums: &mut [i32]) { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `insertion_sort` is never used [INFO] [stderr] --> src/sort/insertion_sort.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn insertion_sort(nums: &mut [i32]) { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `set_key` is never used [INFO] [stderr] --> src/tree/binary_tree.rs:56:8 [INFO] [stderr] | [INFO] [stderr] 13 | impl BinaryTree { [INFO] [stderr] | ---------------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 56 | fn set_key(&mut self, key: T) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `preorder` is never used [INFO] [stderr] --> src/tree/binary_tree.rs:62:4 [INFO] [stderr] | [INFO] [stderr] 62 | fn preorder(bt: Link) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `postorder` is never used [INFO] [stderr] --> src/tree/binary_tree.rs:71:4 [INFO] [stderr] | [INFO] [stderr] 71 | fn postorder(bt: Link) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `inorder` is never used [INFO] [stderr] --> src/tree/binary_tree.rs:80:4 [INFO] [stderr] | [INFO] [stderr] 80 | fn inorder(bt: Link) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `preorder`, `postorder`, and `inorder` are never used [INFO] [stderr] --> src/tree/binary_tree.rs:90:8 [INFO] [stderr] | [INFO] [stderr] 88 | impl BinaryTree { [INFO] [stderr] | ------------------------------------ methods in this implementation [INFO] [stderr] 89 | // 前序遍历 [INFO] [stderr] 90 | fn preorder(&self) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 101 | fn postorder(&self) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 112 | fn inorder(&self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `BinaryHeap` is never constructed [INFO] [stderr] --> src/tree/binary_heap.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | struct BinaryHeap { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/tree/binary_heap.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 27 | impl BinaryHeap { [INFO] [stderr] | --------------- associated items in this implementation [INFO] [stderr] 28 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 35 | fn len(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 39 | fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 43 | fn min(&self) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 51 | fn push(&mut self, val: i32) { [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 57 | fn move_up(&mut self, mut c: usize) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 69 | fn pop(&mut self) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 84 | fn move_down(&mut self, mut c: usize) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 97 | fn min_child(&self, i: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 108 | fn build_new(&mut self, arr: &[i32]) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 126 | fn build_add(&mut self, arr: &[i32]) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `Link` is never used [INFO] [stderr] --> src/tree/binary_search_tree.rs:7:6 [INFO] [stderr] | [INFO] [stderr] 7 | type Link = Option>>; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `BST` is never constructed [INFO] [stderr] --> src/tree/binary_search_tree.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | struct BST { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/tree/binary_search_tree.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 16 | / impl BST [INFO] [stderr] 17 | | where T: Clone + Ord + std::fmt::Debug, [INFO] [stderr] 18 | | U: Clone + std::fmt::Debug { [INFO] [stderr] | |__________________________- associated items in this implementation [INFO] [stderr] 19 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 28 | fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 32 | fn len(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 36 | fn calc_len(&self, mut i: usize) -> usize { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 54 | fn preorder(&self) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 66 | fn inorder(&self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 78 | fn postorder(&self) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 90 | fn insert(&mut self, key: T, val: U) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 122 | fn search(&self, key: &T) -> bool { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 145 | fn min(&self) -> (Option<&T>, Option<&U>) { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 155 | fn max(&self) -> (Option<&T>, Option<&U>) { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 165 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: enum `AvlTree` is never used [INFO] [stderr] --> src/tree/avl.rs:9:6 [INFO] [stderr] | [INFO] [stderr] 9 | enum AvlTree { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `AvlNode` is never constructed [INFO] [stderr] --> src/tree/avl.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | struct AvlNode { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/tree/avl.rs:25:8 [INFO] [stderr] | [INFO] [stderr] 22 | / impl AvlTree [INFO] [stderr] 23 | | where T: Ord [INFO] [stderr] | |____________- associated items in this implementation [INFO] [stderr] 24 | { [INFO] [stderr] 25 | fn new() -> AvlTree { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 29 | fn insert(&mut self, val: T) -> (bool, bool) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 79 | fn rebalance(&mut self) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 143 | fn node(&mut self) -> &mut AvlNode { [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 150 | fn left_subtree(&mut self) -> &mut Self { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 157 | fn right_subtree(&mut self) -> &mut Self { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 164 | fn rotate_left(&mut self) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 173 | fn rotate_right(&mut self) { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `len`, `depth`, `is_empty`, and `search` are never used [INFO] [stderr] --> src/tree/avl.rs:187:8 [INFO] [stderr] | [INFO] [stderr] 184 | / impl AvlTree [INFO] [stderr] 185 | | where T: Ord [INFO] [stderr] | |____________- methods in this implementation [INFO] [stderr] 186 | { [INFO] [stderr] 187 | fn len(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 194 | fn depth(&self) -> usize { [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 201 | fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 208 | fn search(&self, val: &T) -> bool { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Vertex` is never constructed [INFO] [stderr] --> src/graph/graph_matrix.rs:7:8 [INFO] [stderr] | [INFO] [stderr] 7 | struct Vertex<'a> { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> src/graph/graph_matrix.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 12 | impl Vertex<'_> { [INFO] [stderr] | --------------- associated function in this implementation [INFO] [stderr] 13 | fn new(id: usize, name: &'static str) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Edge` is never constructed [INFO] [stderr] --> src/graph/graph_matrix.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | struct Edge { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated functions `new` and `set_edge` are never used [INFO] [stderr] --> src/graph/graph_matrix.rs:24:8 [INFO] [stderr] | [INFO] [stderr] 23 | impl Edge { [INFO] [stderr] | --------- associated functions in this implementation [INFO] [stderr] 24 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 28 | fn set_edge() -> Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Graph` is never constructed [INFO] [stderr] --> src/graph/graph_matrix.rs:34:8 [INFO] [stderr] | [INFO] [stderr] 34 | struct Graph { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `len`, `is_empty`, and `add_edge` are never used [INFO] [stderr] --> src/graph/graph_matrix.rs:40:8 [INFO] [stderr] | [INFO] [stderr] 39 | impl Graph { [INFO] [stderr] | ---------- associated items in this implementation [INFO] [stderr] 40 | fn new(nodes: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 47 | fn len(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 51 | fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 55 | fn add_edge(&mut self, n1: &Vertex, n2: &Vertex) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant `Black` is never constructed [INFO] [stderr] --> src/graph/word_lader.rs:15:5 [INFO] [stderr] | [INFO] [stderr] 12 | enum Color { [INFO] [stderr] | ----- variant in this enum [INFO] [stderr] ... [INFO] [stderr] 15 | Black, [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `Color` has derived impls for the traits `Debug` and `Clone`, but these are intentionally ignored during dead code analysis [INFO] [stderr] [INFO] [stderr] warning: field `key` is never read [INFO] [stderr] --> src/graph/find_province_num_bfs.rs:16:5 [INFO] [stderr] | [INFO] [stderr] 15 | struct Vertex { [INFO] [stderr] | ------ field in this struct [INFO] [stderr] 16 | key: T, [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = note: `Vertex` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/data/linked_list.rs:64:17 [INFO] [stderr] | [INFO] [stderr] 64 | pub fn iter(&self) -> Iter { [INFO] [stderr] | ^^^^^ ^^^^^^^ the same lifetime is hidden here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is elided here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 64 | pub fn iter(&self) -> Iter<'_, T> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/data/linked_list.rs:71:21 [INFO] [stderr] | [INFO] [stderr] 71 | pub fn iter_mut(&mut self) -> IterMut { [INFO] [stderr] | ^^^^^^^^^ ^^^^^^^^^^ the same lifetime is hidden here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is elided here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 71 | pub fn iter_mut(&mut self) -> IterMut<'_, T> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/graph/find_province_num_bfs.rs:123:25 [INFO] [stderr] | [INFO] [stderr] 123 | q.enqueue(city); [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)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 123 | let _ = q.enqueue(city); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/graph/find_province_num_bfs.rs:139:37 [INFO] [stderr] | [INFO] [stderr] 139 | ... q.enqueue(nbrc); [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] 139 | let _ = q.enqueue(nbrc); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: `data_structures_algorithms` (bin "data_structures_algorithms" test) generated 58 warnings (run `cargo fix --bin "data_structures_algorithms" --tests` to apply 20 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.07s [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/debug/deps/data_structures_algorithms-5d15c436e2ecc1bd) [INFO] [stdout] test sort::radix_sort::tests::test_radix_sort ... ok [INFO] [stdout] test sort::quick_sort::test::test_quick_sort ... ok [INFO] [stdout] test data::queue::tests::test_queue ... ok [INFO] [stdout] test graph::find_province_num_bfs::tests::test_shuixianhua ... ok [INFO] [stdout] test graph::topological_sort::tests::test_course ... ok [INFO] [stdout] test sort::selection_sort::test::selection_sort_test ... ok [INFO] [stdout] test sort::shell_sort::test::test1 ... ok [INFO] [stdout] test utils::divide_by_two::tests::test_base_convert ... ok [INFO] [stdout] test utils::divide_by_two::tests::test_divide_by_two ... ok [INFO] [stdout] test tree::binary_tree::test::test_binary_tree ... ok [INFO] [stdout] test utils::infix_to_postfix::tests::test_complex_postfix_eval ... ok [INFO] [stdout] test utils::infix_to_postfix::tests::test_postfix_eval ... ok [INFO] [stdout] test utils::infix_to_postfix::tests::test_infix_to_postfix ... ok [INFO] [stdout] test way::binary_search::tests::test_binary_search1 ... ok [INFO] [stdout] test utils::par_checker::tests::test_par_checker ... ok [INFO] [stdout] test utils::pal_checker::tests::test_pal_checker ... ok [INFO] [stdout] test data::lvec::tests::test_lvec ... FAILED [INFO] [stdout] test sort::tim_sort_without_gallop::tests::test_tim_sort ... FAILED [INFO] [stdout] test utils::hot_potato::tests::test_hot_potato ... ok [INFO] [stdout] test way::exponential_search::tests::test_exponential_search ... ok [INFO] [stdout] test way::hash::test::test_hashmap ... ok [INFO] [stdout] test way::interpolation_search::tests::test_interpolation_search ... ok [INFO] [stdout] test way::quick_sort::test::test_loop ... ok [INFO] [stdout] test way::hash::test::test_hash1 ... ok [INFO] [stdout] test way::recursion::tests::test_dp_rec_mc2 ... ok [INFO] [stdout] test way::quick_sort::test::test_quick_sort_rec ... ok [INFO] [stdout] test way::recursion::tests::test_dp_rec_mc_show ... ok [INFO] [stdout] test way::recursion::tests::test_fibnacci ... ok [INFO] [stdout] test way::recursion::tests::test_hanoi ... ok [INFO] [stdout] test way::recursion::tests::test_num2str_rec ... ok [INFO] [stdout] test way::recursion::tests::test_rec_mc2 ... ok [INFO] [stdout] test way::recursion::tests::test_rec_mc1 ... ok [INFO] [stdout] test way::sequential_search::tests::test_sequential_search ... ok [INFO] [stdout] test graph::find_province_num_bfs::tests::test_jitutonglong ... ok [INFO] [stdout] test way::recursion::tests::test_sums ... ok [INFO] [stdout] test way::quick_sort::test::test_maopao ... ok [INFO] [stdout] test way::sequential_search::tests::test_ordered_sequential_search ... ok [INFO] [stdout] test way::sequential_search::tests::test_sequential_search_pos ... ok [INFO] [stdout] test way::binary_search::tests::test_binary_search2 ... ok [INFO] [stdout] test way::quick_sort::test::test_quick_sort ... ok [INFO] [stdout] test graph::knight_tour::test::tset_knight_tour ... ok [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] [INFO] [stdout] ---- data::lvec::tests::test_lvec stdout ---- [INFO] [stdout] lvec2 len: 6 [INFO] [stdout] lvec val: 8 [INFO] [stdout] lvec val: 9 [INFO] [stdout] lvec val: 10 [INFO] [stdout] lvec val: 11 [INFO] [stdout] lvec val: 12 [INFO] [stdout] lvec val: 13 [INFO] [stdout] [INFO] [stdout] thread 'data::lvec::tests::test_lvec' (20) panicked at src/data/lvec.rs:96:21: [INFO] [stdout] attempt to subtract with overflow [INFO] [stdout] stack backtrace: [INFO] [stdout] 0: 0x5be41d918b82 - std::backtrace_rs::backtrace::libunwind::trace::h76861be37b31432e [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/../../backtrace/src/backtrace/libunwind.rs:117:9 [INFO] [stdout] 1: 0x5be41d918b82 - std::backtrace_rs::backtrace::trace_unsynchronized::h58d4003082192c17 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/../../backtrace/src/backtrace/mod.rs:66:14 [INFO] [stdout] 2: 0x5be41d918b82 - std::sys::backtrace::_print_fmt::hfe5857a399620d2a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:66:9 [INFO] [stdout] 3: 0x5be41d918b82 - ::fmt::h52160e9da139e442 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:39:26 [INFO] [stdout] 4: 0x5be41d92977f - core::fmt::rt::Argument::fmt::h66fe6fef9ecca14a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/fmt/rt.rs:173:76 [INFO] [stdout] 5: 0x5be41d92977f - core::fmt::write::hf09a056a304e021a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/fmt/mod.rs:1468:25 [INFO] [stdout] 6: 0x5be41d8e5c21 - std::io::default_write_fmt::hf1a3645468226e09 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/io/mod.rs:639:11 [INFO] [stdout] 7: 0x5be41d8e5c21 - std::io::Write::write_fmt::ha5ada6d6a18bde33 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/io/mod.rs:1954:13 [INFO] [stdout] 8: 0x5be41d8f1cf2 - std::sys::backtrace::BacktraceLock::print::h15104dbcf0fd1f14 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:42:9 [INFO] [stdout] 9: 0x5be41d8f683f - std::panicking::default_hook::{{closure}}::h0fa6cd8dbe0dd76b [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:301:27 [INFO] [stdout] 10: 0x5be41d8f66d1 - std::panicking::default_hook::h8d20506cf72e4831 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:325:9 [INFO] [stdout] 11: 0x5be41d87e57e - as core::ops::function::Fn>::call::h3d020961abd83a77 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/alloc/src/boxed.rs:1987:9 [INFO] [stdout] 12: 0x5be41d87e57e - test::test_main_with_exit_callback::{{closure}}::h720dd2fdb2ddcdca [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:145:21 [INFO] [stdout] 13: 0x5be41d8f6eff - as core::ops::function::Fn>::call::h75334a5fed245bca [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/alloc/src/boxed.rs:1987:9 [INFO] [stdout] 14: 0x5be41d8f6eff - std::panicking::panic_with_hook::h746880a052e02c85 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:842:13 [INFO] [stdout] 15: 0x5be41d8f6d26 - std::panicking::panic_handler::{{closure}}::h14b95830f89d14b3 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:700:13 [INFO] [stdout] 16: 0x5be41d8f1e29 - std::sys::backtrace::__rust_end_short_backtrace::h7ddaac0e9609a83d [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:174:18 [INFO] [stdout] 17: 0x5be41d8da11d - __rustc[76f7e7187978e2f8]::rust_begin_unwind [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:698:5 [INFO] [stdout] 18: 0x5be41d931400 - core::panicking::panic_fmt::heb245a301f4395db [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panicking.rs:78:14 [INFO] [stdout] 19: 0x5be41d930fb7 - core::panicking::panic_const::panic_const_sub_overflow::h2b6557f557cdb854 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panicking.rs:178:17 [INFO] [stdout] 20: 0x5be41d853cb2 - data_structures_algorithms::data::lvec::LVec::pop::h36acb95705d57efe [INFO] [stdout] at /opt/rustwide/workdir/src/data/lvec.rs:96:21 [INFO] [stdout] 21: 0x5be41d83a77e - data_structures_algorithms::data::lvec::tests::test_lvec::ha831341cc88166ee [INFO] [stdout] at /opt/rustwide/workdir/src/data/lvec.rs:149:22 [INFO] [stdout] 22: 0x5be41d83aa47 - data_structures_algorithms::data::lvec::tests::test_lvec::{{closure}}::h1a0e0960b95ea1c8 [INFO] [stdout] at /opt/rustwide/workdir/src/data/lvec.rs:135:19 [INFO] [stdout] 23: 0x5be41d83e1a6 - core::ops::function::FnOnce::call_once::h487381f051a38e0d [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 24: 0x5be41d87e3ab - core::ops::function::FnOnce::call_once::h933a5d67211adff2 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 25: 0x5be41d87e3ab - test::__rust_begin_short_backtrace::h2157af19b0990ffb [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:663:18 [INFO] [stdout] 26: 0x5be41d893f85 - test::run_test_in_process::{{closure}}::hc3b17e0f313c900a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:686:74 [INFO] [stdout] 27: 0x5be41d893f85 - as core::ops::function::FnOnce<()>>::call_once::ha23e4b490259273c [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panic/unwind_safe.rs:274:9 [INFO] [stdout] 28: 0x5be41d893f85 - std::panicking::catch_unwind::do_call::h8dc9d5da83792f7a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:590:40 [INFO] [stdout] 29: 0x5be41d893f85 - std::panicking::catch_unwind::h0d8461330de4a18b [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:553:19 [INFO] [stdout] 30: 0x5be41d893f85 - std::panic::catch_unwind::h0321b51397bf9811 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panic.rs:359:14 [INFO] [stdout] 31: 0x5be41d893f85 - test::run_test_in_process::hcaaa440fdbe4a513 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:686:27 [INFO] [stdout] 32: 0x5be41d893f85 - test::run_test::{{closure}}::h6345da602b85d6c3 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:607:43 [INFO] [stdout] 33: 0x5be41d86a794 - test::run_test::{{closure}}::h90a3b75194d37b5d [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:637:41 [INFO] [stdout] 34: 0x5be41d86a794 - std::sys::backtrace::__rust_begin_short_backtrace::hae41a17001f53ede [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:158:18 [INFO] [stdout] 35: 0x5be41d86e05a - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::h6ea895368381e0b1 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/thread/mod.rs:559:17 [INFO] [stdout] 36: 0x5be41d86e05a - as core::ops::function::FnOnce<()>>::call_once::h9c39013633bb9237 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panic/unwind_safe.rs:274:9 [INFO] [stdout] 37: 0x5be41d86e05a - std::panicking::catch_unwind::do_call::hac7dba9ee4d99108 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:590:40 [INFO] [stdout] 38: 0x5be41d86e05a - std::panicking::catch_unwind::h73015d00e4866ebc [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:553:19 [INFO] [stdout] 39: 0x5be41d86e05a - std::panic::catch_unwind::h6f7b38e188aa4f62 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panic.rs:359:14 [INFO] [stdout] 40: 0x5be41d86e05a - std::thread::Builder::spawn_unchecked_::{{closure}}::h969a6a2dc1856df7 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/thread/mod.rs:557:30 [INFO] [stdout] 41: 0x5be41d86e05a - core::ops::function::FnOnce::call_once{{vtable.shim}}::h269ad1ff23e72122 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 42: 0x5be41d8ecf6f - as core::ops::function::FnOnce>::call_once::hdd09a470c130e806 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/alloc/src/boxed.rs:1973:9 [INFO] [stdout] 43: 0x5be41d8ecf6f - std::sys::thread::unix::Thread::new::thread_start::h14ea1ba6e320367c [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/thread/unix.rs:126:17 [INFO] [stdout] 44: 0x7e3b35cb5aa4 - [INFO] [stdout] 45: 0x7e3b35d42a34 - clone [INFO] [stdout] 46: 0x0 - [INFO] [stdout] [INFO] [stdout] ---- sort::tim_sort_without_gallop::tests::test_tim_sort stdout ---- [INFO] [stdout] [INFO] [stdout] thread 'sort::tim_sort_without_gallop::tests::test_tim_sort' (43) panicked at src/sort/tim_sort_without_gallop.rs:325:21: [INFO] [stdout] index out of bounds: the len is 152 but the index is 18446744073709551615 [INFO] [stdout] stack backtrace: [INFO] [stdout] 0: 0x5be41d918b82 - std::backtrace_rs::backtrace::libunwind::trace::h76861be37b31432e [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/../../backtrace/src/backtrace/libunwind.rs:117:9 [INFO] [stdout] 1: 0x5be41d918b82 - std::backtrace_rs::backtrace::trace_unsynchronized::h58d4003082192c17 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/../../backtrace/src/backtrace/mod.rs:66:14 [INFO] [stdout] 2: 0x5be41d918b82 - std::sys::backtrace::_print_fmt::hfe5857a399620d2a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:66:9 [INFO] [stdout] 3: 0x5be41d918b82 - ::fmt::h52160e9da139e442 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:39:26 [INFO] [stdout] 4: 0x5be41d92977f - core::fmt::rt::Argument::fmt::h66fe6fef9ecca14a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/fmt/rt.rs:173:76 [INFO] [stdout] 5: 0x5be41d92977f - core::fmt::write::hf09a056a304e021a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/fmt/mod.rs:1468:25 [INFO] [stdout] 6: 0x5be41d8e5c21 - std::io::default_write_fmt::hf1a3645468226e09 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/io/mod.rs:639:11 [INFO] [stdout] 7: 0x5be41d8e5c21 - std::io::Write::write_fmt::ha5ada6d6a18bde33 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/io/mod.rs:1954:13 [INFO] [stdout] 8: 0x5be41d8f1cf2 - std::sys::backtrace::BacktraceLock::print::h15104dbcf0fd1f14 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:42:9 [INFO] [stdout] 9: 0x5be41d8f683f - std::panicking::default_hook::{{closure}}::h0fa6cd8dbe0dd76b [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:301:27 [INFO] [stdout] 10: 0x5be41d8f66d1 - std::panicking::default_hook::h8d20506cf72e4831 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:325:9 [INFO] [stdout] 11: 0x5be41d87e57e - as core::ops::function::Fn>::call::h3d020961abd83a77 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/alloc/src/boxed.rs:1987:9 [INFO] [stdout] 12: 0x5be41d87e57e - test::test_main_with_exit_callback::{{closure}}::h720dd2fdb2ddcdca [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:145:21 [INFO] [stdout] 13: 0x5be41d8f6eff - as core::ops::function::Fn>::call::h75334a5fed245bca [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/alloc/src/boxed.rs:1987:9 [INFO] [stdout] 14: 0x5be41d8f6eff - std::panicking::panic_with_hook::h746880a052e02c85 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:842:13 [INFO] [stdout] 15: 0x5be41d8f6d5a - std::panicking::panic_handler::{{closure}}::h14b95830f89d14b3 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:707:13 [INFO] [stdout] 16: 0x5be41d8f1e29 - std::sys::backtrace::__rust_end_short_backtrace::h7ddaac0e9609a83d [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:174:18 [INFO] [stdout] 17: 0x5be41d8da11d - __rustc[76f7e7187978e2f8]::rust_begin_unwind [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:698:5 [INFO] [stdout] 18: 0x5be41d931400 - core::panicking::panic_fmt::heb245a301f4395db [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panicking.rs:78:14 [INFO] [stdout] 19: 0x5be41d931102 - core::panicking::panic_bounds_check::h1e2a9d9d10ec5f30 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panicking.rs:274:5 [INFO] [stdout] 20: 0x5be41d84272b - ::drop::ha520db49353374b9 [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:325:21 [INFO] [stdout] 21: 0x5be41d8412e3 - core::ptr::drop_in_place::h8611e901d9335810 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/ptr/mod.rs:804:1 [INFO] [stdout] 22: 0x5be41d8449a3 - data_structures_algorithms::sort::tim_sort_without_gallop::merge_hi::h557055bb1405c2d3 [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:274:5 [INFO] [stdout] 23: 0x5be41d8439e0 - data_structures_algorithms::sort::tim_sort_without_gallop::merge_sort::hcb95a60a7e8e104b [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:196:9 [INFO] [stdout] 24: 0x5be41d845157 - data_structures_algorithms::sort::tim_sort_without_gallop::SortState::merge_collapse::h66dd0332f4a24ec3 [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:152:17 [INFO] [stdout] 25: 0x5be41d845820 - data_structures_algorithms::sort::tim_sort_without_gallop::SortState::sort::h51f9e525d07d18a0 [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:121:18 [INFO] [stdout] 26: 0x5be41d844a7f - data_structures_algorithms::sort::tim_sort_without_gallop::tim_sort::h2e44cbe942a669e0 [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:338:20 [INFO] [stdout] 27: 0x5be41d8354ba - data_structures_algorithms::sort::tim_sort_without_gallop::tests::test_tim_sort::h050bf792fa8167df [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:352:9 [INFO] [stdout] 28: 0x5be41d835547 - data_structures_algorithms::sort::tim_sort_without_gallop::tests::test_tim_sort::{{closure}}::h249ea7206821df17 [INFO] [stdout] at /opt/rustwide/workdir/src/sort/tim_sort_without_gallop.rs:349:23 [INFO] [stdout] 29: 0x5be41d83ed26 - core::ops::function::FnOnce::call_once::hb5a88223bb9f78af [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 30: 0x5be41d87e3ab - core::ops::function::FnOnce::call_once::h933a5d67211adff2 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 31: 0x5be41d87e3ab - test::__rust_begin_short_backtrace::h2157af19b0990ffb [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:663:18 [INFO] [stdout] 32: 0x5be41d893f85 - test::run_test_in_process::{{closure}}::hc3b17e0f313c900a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:686:74 [INFO] [stdout] 33: 0x5be41d893f85 - as core::ops::function::FnOnce<()>>::call_once::ha23e4b490259273c [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panic/unwind_safe.rs:274:9 [INFO] [stdout] 34: 0x5be41d893f85 - std::panicking::catch_unwind::do_call::h8dc9d5da83792f7a [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:590:40 [INFO] [stdout] 35: 0x5be41d893f85 - std::panicking::catch_unwind::h0d8461330de4a18b [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:553:19 [INFO] [stdout] 36: 0x5be41d893f85 - std::panic::catch_unwind::h0321b51397bf9811 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panic.rs:359:14 [INFO] [stdout] 37: 0x5be41d893f85 - test::run_test_in_process::hcaaa440fdbe4a513 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:686:27 [INFO] [stdout] 38: 0x5be41d893f85 - test::run_test::{{closure}}::h6345da602b85d6c3 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:607:43 [INFO] [stdout] 39: 0x5be41d86a794 - test::run_test::{{closure}}::h90a3b75194d37b5d [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/test/src/lib.rs:637:41 [INFO] [stdout] 40: 0x5be41d86a794 - std::sys::backtrace::__rust_begin_short_backtrace::hae41a17001f53ede [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/backtrace.rs:158:18 [INFO] [stdout] 41: 0x5be41d86e05a - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::h6ea895368381e0b1 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/thread/mod.rs:559:17 [INFO] [stdout] 42: 0x5be41d86e05a - as core::ops::function::FnOnce<()>>::call_once::h9c39013633bb9237 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/panic/unwind_safe.rs:274:9 [INFO] [stdout] 43: 0x5be41d86e05a - std::panicking::catch_unwind::do_call::hac7dba9ee4d99108 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:590:40 [INFO] [stdout] 44: 0x5be41d86e05a - std::panicking::catch_unwind::h73015d00e4866ebc [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panicking.rs:553:19 [INFO] [stdout] 45: 0x5be41d86e05a - std::panic::catch_unwind::h6f7b38e188aa4f62 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/panic.rs:359:14 [INFO] [stdout] 46: 0x5be41d86e05a - std::thread::Builder::spawn_unchecked_::{{closure}}::h969a6a2dc1856df7 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/thread/mod.rs:557:30 [INFO] [stdout] 47: 0x5be41d86e05a - core::ops::function::FnOnce::call_once{{vtable.shim}}::h269ad1ff23e72122 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 48: 0x5be41d8ecf6f - as core::ops::function::FnOnce>::call_once::hdd09a470c130e806 [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/alloc/src/boxed.rs:1973:9 [INFO] [stdout] 49: 0x5be41d8ecf6f - std::sys::thread::unix::Thread::new::thread_start::h14ea1ba6e320367c [INFO] [stdout] at /rustc/caccb4d0368bd918ef6668af8e13834d07040417/library/std/src/sys/thread/unix.rs:126:17 [INFO] [stdout] 50: 0x7e3b35cb5aa4 - [INFO] [stdout] 51: 0x7e3b35d42a34 - clone [INFO] [stdout] 52: 0x0 - [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] data::lvec::tests::test_lvec [INFO] [stdout] sort::tim_sort_without_gallop::tests::test_tim_sort [INFO] [stdout] [INFO] [stdout] test result: FAILED. 55 passed; 2 failed; 0 ignored; 0 measured; 0 filtered out; finished in 12.40s [INFO] [stdout] [INFO] [stderr] error: test failed, to rerun pass `--bin data_structures_algorithms` [INFO] running `Command { std: "docker" "inspect" "98114993b5a7ae463e3b3f13a43b2e53675bda3d31c808905c32450eb83ec87f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "98114993b5a7ae463e3b3f13a43b2e53675bda3d31c808905c32450eb83ec87f", kill_on_drop: false }` [INFO] [stdout] 98114993b5a7ae463e3b3f13a43b2e53675bda3d31c808905c32450eb83ec87f