[INFO] cloning repository https://github.com/u-kai/data-structures [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/u-kai/data-structures" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fu-kai%2Fdata-structures", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fu-kai%2Fdata-structures'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 9abdb4761e9237e1b7d3b16ce127f4d7933ca6ed [INFO] testing u-kai/data-structures against try#8de4c7234dd9b97c9d76b58671343fdbbc9a433e+target=x86_64-unknown-linux-musl for musl_upgrade_1_2_5_with_libc_patch_0 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fu-kai%2Fdata-structures" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/u-kai/data-structures [INFO] finished tweaking git repo https://github.com/u-kai/data-structures [INFO] tweaked toml for git repo https://github.com/u-kai/data-structures written to /workspace/builds/worker-7-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/u-kai/data-structures on toolchain 8de4c7234dd9b97c9d76b58671343fdbbc9a433e [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/u-kai/data-structures already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] a5138b2218f40b0c3441c85c79b012f2c7e8c6da77529007a71b2f3f24e6dd8e [INFO] running `Command { std: "docker" "start" "-a" "a5138b2218f40b0c3441c85c79b012f2c7e8c6da77529007a71b2f3f24e6dd8e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "a5138b2218f40b0c3441c85c79b012f2c7e8c6da77529007a71b2f3f24e6dd8e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a5138b2218f40b0c3441c85c79b012f2c7e8c6da77529007a71b2f3f24e6dd8e", kill_on_drop: false }` [INFO] [stdout] a5138b2218f40b0c3441c85c79b012f2c7e8c6da77529007a71b2f3f24e6dd8e [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "build" "--frozen" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 39552f69dc9b14ed4cd5d4247b85bca2a8f2ee9b001af203fa6035fa34aeed96 [INFO] running `Command { std: "docker" "start" "-a" "39552f69dc9b14ed4cd5d4247b85bca2a8f2ee9b001af203fa6035fa34aeed96", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.126 [INFO] [stderr] Compiling ppv-lite86 v0.2.16 [INFO] [stderr] Compiling getrandom v0.2.7 [INFO] [stderr] Compiling rand_core v0.6.3 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling data-structures v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused imports: `BufReader`, `Read`, `Write`, `fs::File`, `os::unix::thread`, and `stdin` [INFO] [stdout] --> src/main.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | fs::File, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] 3 | io::{stdin, BufRead, BufReader, Read, Write}, [INFO] [stdout] | ^^^^^ ^^^^^^^^^ ^^^^ ^^^^^ [INFO] [stdout] 4 | os::unix::thread, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Fill`, `Rng`, and `thread_rng` [INFO] [stdout] --> src/main.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | use rand::{thread_rng, Fill, Rng}; [INFO] [stdout] | ^^^^^^^^^^ ^^^^ ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BinaryTrie`, `binary_tree::binary_easy::BinarySearchTree`, and `x_fast_trie::XFastTrie` [INFO] [stdout] --> src/main.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | binary_tree::binary_easy::BinarySearchTree, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | binary_trie::{BinaryTrie, ToUsize}, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] 13 | x_fast_trie::XFastTrie, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused macro definition: `json` [INFO] [stdout] --> src/macros/json.rs:23:14 [INFO] [stdout] | [INFO] [stdout] 23 | macro_rules! json { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_macros)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `DerefMut`, `Deref`, and `rc::Rc` [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | ops::{Deref, DerefMut}, [INFO] [stdout] | ^^^^^ ^^^^^^^^ [INFO] [stdout] 4 | rc::Rc, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around index expression [INFO] [stdout] --> src/structs/external_memory/btree.rs:286:31 [INFO] [stdout] | [INFO] [stdout] 286 | parent_block.children[(*left_index + 1)] = None; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 286 - parent_block.children[(*left_index + 1)] = None; [INFO] [stdout] 286 + parent_block.children[*left_index + 1] = None; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fmt::Debug` [INFO] [stdout] --> src/structs/linked_lists/se_list.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fmt::Debug; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/structs/tries/x_fast_trie_parts/binary_label.rs:29:9 [INFO] [stdout] | [INFO] [stdout] 29 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is a test module, consider adding a `#[cfg(test)]` to the containing module [INFO] [stdout] --> src/structs/tries/x_fast_trie_parts/binary_label.rs:28:1 [INFO] [stdout] | [INFO] [stdout] 28 | mod binary_label_test { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/main.rs:3:17 [INFO] [stdout] | [INFO] [stdout] 3 | io::{stdin, BufRead, BufReader, Read, Write}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `next` is never read [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:418:17 [INFO] [stdout] | [INFO] [stdout] 418 | let mut next = None; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `next` is never read [INFO] [stdout] --> src/structs/binary_tree/random_binary_search_tree.rs:312:17 [INFO] [stdout] | [INFO] [stdout] 312 | let mut next = None; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let mut node = RedBlackNode::new(RedBlackNodeValue { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `d` [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:42:17 [INFO] [stdout] | [INFO] [stdout] 42 | let mut d = 1; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_d` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:42:13 [INFO] [stdout] | [INFO] [stdout] 42 | let mut d = 1; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s1` [INFO] [stdout] --> src/main.rs:50:9 [INFO] [stdout] | [INFO] [stdout] 50 | let s1 = " 0 \n 1 \n".to_string(); [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2` [INFO] [stdout] --> src/main.rs:51:9 [INFO] [stdout] | [INFO] [stdout] 51 | let s2 = " 1 \n 3 \n".to_string(); [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `string_conect` is never used [INFO] [stdout] --> src/main.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn string_conect(s1: String, s2: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `indent` is never used [INFO] [stdout] --> src/main.rs:57:4 [INFO] [stdout] | [INFO] [stdout] 57 | fn indent(mut s1: String, mut s2: String) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Graph` is never used [INFO] [stdout] --> src/interfaces/graph.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | pub trait Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `List` is never used [INFO] [stdout] --> src/interfaces/list.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait List { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Queue` is never used [INFO] [stdout] --> src/interfaces/queue.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait Queue { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `SSet` is never used [INFO] [stdout] --> src/interfaces/sset.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait SSet { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `pop` is never used [INFO] [stdout] --> src/interfaces/stack.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait Stack { [INFO] [stdout] | ----- method in this trait [INFO] [stdout] 4 | fn push(&mut self, x: T) -> (); [INFO] [stdout] 5 | fn pop(&mut self) -> Option; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `USet` is never used [INFO] [stdout] --> src/interfaces/uset.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait USet { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Null`, `Array`, and `Object` are never constructed [INFO] [stdout] --> src/macros/json.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 4 | pub enum Json { [INFO] [stdout] | ---- variants in this enum [INFO] [stdout] 5 | Null, [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 9 | Array(Vec), [INFO] [stdout] | ^^^^^ [INFO] [stdout] 10 | Object(Box>), [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Json` 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: multiple associated items are never used [INFO] [stdout] --> src/structs/arrays/array_stack.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 18 | impl ArrayStack { [INFO] [stdout] | ---------------------------------------------- associated items in this implementation [INFO] [stdout] 19 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn new_with_len(len: usize) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn new_with_default(len: usize) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn set(&mut self, i: usize, x: T) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn get(&self, i: usize) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn add(&mut self, i: usize, x: T) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DualArrayDeque` is never constructed [INFO] [stdout] --> src/structs/arrays/dual_array_deque.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct DualArrayDeque { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `size` is never used [INFO] [stdout] --> src/structs/arrays/dual_array_deque.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl DualArrayDeque { [INFO] [stdout] | -------------------------------------------------- method in this implementation [INFO] [stdout] 11 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinarySearchTree` is never constructed [INFO] [stdout] --> src/structs/binary_tree/binary_easy.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct BinarySearchTree { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BinarySearchTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `find` are never used [INFO] [stdout] --> src/structs/binary_tree/binary_easy.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinarySearchTree { [INFO] [stdout] | ------------------------------------------------------------------------- associated items in this implementation [INFO] [stdout] 8 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | pub fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn find(&self, x: T) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/structs/binary_tree/binary_easy.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, and `add` are never used [INFO] [stdout] --> src/structs/binary_tree/binary_easy.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl Node { [INFO] [stdout] | ------------------------------------------------------------- associated items in this implementation [INFO] [stdout] 29 | fn new(x: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn find(&self, x: T) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Tree` is never used [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:43:18 [INFO] [stdout] | [INFO] [stdout] 43 | pub(super) trait Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl WrapNode { [INFO] [stdout] | ---------------------------------------------------------------------- associated items in this implementation [INFO] [stdout] 47 | pub fn new(value: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn rotation_right(tree: &mut impl Tree, mut rotation_node: WrapNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn rotation_left(tree: &mut impl Tree, mut rotation_node: WrapNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | pub fn change_value(&self, new_value: T) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | pub fn value(&self) -> T { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 101 | pub fn clone(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | pub fn has_child(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | pub fn set_parent(&mut self, parent: Option>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 110 | pub fn set_right(&mut self, right: Option>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 113 | pub fn set_left(&mut self, left: Option>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | pub fn parent(&self) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | pub fn left(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 132 | pub fn right(&self) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 140 | pub fn from_node(node: Rc>>) -> Self { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 143 | pub fn to_node(&self) -> Rc>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | pub fn add_child(&mut self, child: WrapNode) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 159 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 172 | fn find_node(&self, value: T) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 188 | pub fn find(&self, value: T) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 191 | pub fn find_parent(&self, value: T) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 200 | pub fn find_last(&self, value: T) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 218 | pub fn depth(&self, value: T) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 236 | pub fn add(&mut self, value: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 241 | pub fn remove(&mut self, value: T) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:377:8 [INFO] [stdout] | [INFO] [stdout] 376 | impl BTNode { [INFO] [stdout] | -------------------------------------------------------------------- associated function in this implementation [INFO] [stdout] 377 | fn new(value: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTree` is never constructed [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:388:12 [INFO] [stdout] | [INFO] [stdout] 388 | pub struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BinaryTree` 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: multiple associated items are never used [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:393:12 [INFO] [stdout] | [INFO] [stdout] 392 | impl BinaryTree { [INFO] [stdout] | ------------------------------------------------------------------------ associated items in this implementation [INFO] [stdout] 393 | pub fn new(root: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 398 | pub fn remove(&mut self, value: T) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 408 | pub fn depth(&self, value: T) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 415 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 447 | fn find_node(&self, value: T) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 454 | pub fn find(&self, value: T) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 457 | fn find_last(&self, value: T) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 464 | pub fn add(&mut self, value: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/structs/binary_tree/random_binary_search_tree.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 36 | impl TreapNode { [INFO] [stdout] | --------------------------------------------------------------------------------- associated function in this implementation [INFO] [stdout] 37 | fn new(value: T, p: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/binary_tree/random_binary_search_tree.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 68 | impl WrapNode { [INFO] [stdout] | -------------------------------------------------------------------------------- associated items in this implementation [INFO] [stdout] 69 | fn new(value: T, p: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn clone(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn p(&self) -> usize { [INFO] [stdout] | ^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn add_use_binary_search_algo(&mut self, child: WrapNode) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn parent(&self) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 100 | fn left(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn right(&self) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn set_parent(&mut self, parent: Option>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn set_right(&mut self, right: Option>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 120 | fn set_left(&mut self, left: Option>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 123 | fn from_node(node: TreapNode) -> Self { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 126 | fn from_rc_node(node: Rc>>) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 129 | fn to_node(&self) -> Rc>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `RandomGenerator` is never used [INFO] [stdout] --> src/structs/binary_tree/random_binary_search_tree.rs:134:11 [INFO] [stdout] | [INFO] [stdout] 134 | pub trait RandomGenerator { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Treap` is never constructed [INFO] [stdout] --> src/structs/binary_tree/random_binary_search_tree.rs:138:12 [INFO] [stdout] | [INFO] [stdout] 138 | pub struct Treap< [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Treap` 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: associated items `new`, `find_node`, `find_last`, `rotation_right`, and `rotation_left` are never used [INFO] [stdout] --> src/structs/binary_tree/random_binary_search_tree.rs:151:8 [INFO] [stdout] | [INFO] [stdout] 146 | / impl< [INFO] [stdout] 147 | | T: Default + Clone + Default + Debug + Eq + PartialEq + PartialOrd + Ord, [INFO] [stdout] 148 | | R: RandomGenerator + Debug, [INFO] [stdout] 149 | | > Treap [INFO] [stdout] | |_________________- associated items in this implementation [INFO] [stdout] 150 | { [INFO] [stdout] 151 | fn new(root: T, mut random_generator: R) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn find_node(&self, value: T) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 176 | fn find_last(&self, value: T) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 197 | fn rotation_right(&mut self, mut rotation_node: WrapNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 219 | fn rotation_left(&mut self, mut rotation_node: WrapNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `NodeColor` is never used [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:10:6 [INFO] [stdout] | [INFO] [stdout] 10 | enum NodeColor { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `NodeColor` 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: associated items `new`, `change_color`, `to_red`, and `to_black` are never used [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl NodeColor { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 15 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn change_color(&mut self, color: NodeColor) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn to_red(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn to_black(&mut self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RedBlackNodeValue` is never constructed [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct RedBlackNodeValue { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `RedBlackNodeValue` 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: type alias `RedBlackNode` is never used [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:34:6 [INFO] [stdout] | [INFO] [stdout] 34 | type RedBlackNode = [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RedBlackTree` is never constructed [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct RedBlackTree { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `RedBlackTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `add_fixup` are never used [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 48 | / impl RedBlackTree [INFO] [stdout] 49 | | where [INFO] [stdout] 50 | | T: Clone + Debug + Eq + PartialEq + PartialOrd + Ord, [INFO] [stdout] | |_________________________________________________________- associated items in this implementation [INFO] [stdout] 51 | { [INFO] [stdout] 52 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn add_fixup(&mut self, mut node: RedBlackNode) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:115:8 [INFO] [stdout] | [INFO] [stdout] 111 | / impl RedBlackNode [INFO] [stdout] 112 | | where [INFO] [stdout] 113 | | T: Clone + Debug + Eq + PartialEq + PartialOrd + Ord, [INFO] [stdout] | |_________________________________________________________- methods in this implementation [INFO] [stdout] 114 | { [INFO] [stdout] 115 | fn flip_left(&mut self, tree: &mut RedBlackTree) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | fn flip_right(&mut self, tree: &mut RedBlackTree) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 129 | fn push_black(&mut self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 134 | fn pull_black(&mut self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 139 | fn swap_color(&mut self, other: &mut Self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | fn change_left_color(&mut self, color: NodeColor) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 152 | fn change_right_color(&mut self, color: NodeColor) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 159 | fn change_color(&mut self, color: NodeColor) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 169 | fn to_red(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 174 | fn to_black(&mut self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ScapegoatTree` is never constructed [INFO] [stdout] --> src/structs/binary_tree/scapegoat_tree.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct ScapegoatTree { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `ScapegoatTree` 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: associated items `remove`, `add`, `rebuild`, `build_balanced`, `pack_into_array`, and `log3_2` are never used [INFO] [stdout] --> src/structs/binary_tree/scapegoat_tree.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl ScapegoatTree { [INFO] [stdout] | --------------------------------------------------------------------------- associated items in this implementation [INFO] [stdout] 12 | pub fn remove(&mut self, x: T) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn rebuild(&mut self, node: WrapNode) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn build_balanced( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn pack_into_array( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | fn log3_2(q: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `update_block`, `place_data`, `free_block`, and `block_list_len` are never used [INFO] [stdout] --> src/structs/external_memory/block_store.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl BlockStore { [INFO] [stdout] | ---------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn update_block(&mut self, index: BIndex, data: T) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | pub fn place_data(&mut self, b: T) -> BIndex { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn free_block(&mut self, i: BIndex) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | pub fn block_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `index` is never used [INFO] [stdout] --> src/structs/external_memory/block_store.rs:98:12 [INFO] [stdout] | [INFO] [stdout] 94 | impl Block { [INFO] [stdout] | ---------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 98 | pub fn index(&self) -> BIndex { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `child_num`, `key_num`, `last_child`, and `last_key` are never used [INFO] [stdout] --> src/structs/external_memory/btree.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 13 | / impl Node [INFO] [stdout] 14 | | where [INFO] [stdout] 15 | | T: Clone + Debug + PartialEq + PartialOrd + Ord + Default, [INFO] [stdout] | |______________________________________________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 54 | fn child_num(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn key_num(&self) -> usize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn last_child(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn last_key(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/structs/external_memory/btree.rs:196:12 [INFO] [stdout] | [INFO] [stdout] 135 | / impl BTree [INFO] [stdout] 136 | | where [INFO] [stdout] 137 | | T: Clone + Debug + PartialEq + PartialOrd + Ord + Default, [INFO] [stdout] | |______________________________________________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 196 | pub fn remove(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 199 | fn remove_rec(&mut self, x: T, node_index: Option) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 230 | fn remove_smallest(&mut self, node_index: BIndex) -> T { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 241 | fn check_underflow(&mut self, block: Block>, child_index: ChildIndex) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 251 | fn shift_rl(&mut self, mut underflow_block: Block>, mut helper_block: Block>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 264 | fn merge( [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 294 | fn check_underflow_zero(&mut self, parent_block: Block>, child_index: ChildIndex) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 312 | fn check_underflow_non_zero(&mut self, parent_block: Block>, child_index: ChildIndex) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AdjacencyMatrix` is never constructed [INFO] [stdout] --> src/structs/graphs/adjacency_matrix.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct AdjacencyMatrix { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `is_over_len`, `len_check`, and `i_check` are never used [INFO] [stdout] --> src/structs/graphs/adjacency_matrix.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl AdjacencyMatrix { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 11 | pub fn new(n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn is_over_len(&self, i: usize, j: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn len_check(&self, i: usize, j: usize) -> () { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn i_check(&self, i: usize) -> () { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AdjacencyList` is never constructed [INFO] [stdout] --> src/structs/graphs/adjacency_list.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct AdjacencyList { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `AdjacencyList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Color` is never used [INFO] [stdout] --> src/structs/graphs/adjacency_list.rs:13:6 [INFO] [stdout] | [INFO] [stdout] 13 | enum Color { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Color` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/graphs/adjacency_list.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 18 | impl AdjacencyList { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 19 | pub fn new(n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn dfs2(&self, i: usize) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn private_dfs2(&self, i: usize, buffer: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn dfs(&self, i: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn private_dfs(&self, i: usize, colors: &mut Vec, buffer: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn can_reach(&self, start: usize, target: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn len_check(&self, i: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `w`, `z`, `resize`, `set`, and `hash` are never used [INFO] [stdout] --> src/structs/hash_tables/chaned_hash_table.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl ChanedHashTable { [INFO] [stdout] | ------------------------------------------------------------------------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 22 | fn w() -> usize { [INFO] [stdout] | ^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn z() -> usize { [INFO] [stdout] | ^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn resize(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn set(&mut self, i: usize, x: T) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn hash(x: T) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HashGen` is never constructed [INFO] [stdout] --> src/structs/hash_tables/hash_gen.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct HashGen { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `HashGen` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `from_usize`, and `hash` are never used [INFO] [stdout] --> src/structs/hash_tables/hash_gen.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl HashGen { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 11 | pub fn new(z: usize, w: u32, d: u32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn from_usize(&self, x: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn hash(&self, x: T) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Exist` and `Del` are never constructed [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 8 | enum DataState { [INFO] [stdout] | --------- variants in this enum [INFO] [stdout] 9 | Exist(T), [INFO] [stdout] | ^^^^^ [INFO] [stdout] 10 | Null, [INFO] [stdout] 11 | Del, [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `DataState` 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: struct `LinerHashTable` is never constructed [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct LinerHashTable { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `LinerHashTable` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `resize` are never used [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl LinerHashTable { [INFO] [stdout] | ------------------------------------------------------------------------------ associated items in this implementation [INFO] [stdout] 29 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | fn resize(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/structs/heap/binary_heap.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct BinaryHeap { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BinaryHeap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/heap/binary_heap.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl BinaryHeap { [INFO] [stdout] | ------------------------------------------------------------- associated items in this implementation [INFO] [stdout] 10 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn remove(&mut self) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn trickle_down(&mut self, mut i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn bubble_up(&mut self, mut i: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn left_index(i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn right_index(i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn parent_index(i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn resize(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MeldableHeap` is never constructed [INFO] [stdout] --> src/structs/heap/meldable_heap.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct MeldableHeap { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `MeldableHeap` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `remove` are never used [INFO] [stdout] --> src/structs/heap/meldable_heap.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl MeldableHeap { [INFO] [stdout] | -------------------------------------------------------------------------------------- associated items in this implementation [INFO] [stdout] 16 | pub fn new(rand_gen: R) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn remove(&mut self) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/heap/meldable_heap.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl WrapNode { [INFO] [stdout] | ----------------------------------------------------------- associated items in this implementation [INFO] [stdout] 53 | fn new(x: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn merge(&mut self, mut other: Self, rand: &mut impl RandomGenerator) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn value(&self) -> Option { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn left(&self) -> Self { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn right(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn parent(&self) -> Self { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | fn set_left(&mut self, left: Self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | fn set_right(&mut self, right: Self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn set_parent(&mut self, parent: Self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 135 | fn clone(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `value`, `left`, `right`, and `parent` are never read [INFO] [stdout] --> src/structs/heap/meldable_heap.rs:144:5 [INFO] [stdout] | [INFO] [stdout] 143 | struct MeldableHeapNode { [INFO] [stdout] | ---------------- fields in this struct [INFO] [stdout] 144 | value: T, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 145 | left: WrapNode, [INFO] [stdout] | ^^^^ [INFO] [stdout] 146 | right: WrapNode, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 147 | parent: Option>>>, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `MeldableHeapNode` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/structs/heap/meldable_heap.rs:150:8 [INFO] [stdout] | [INFO] [stdout] 149 | impl MeldableHeapNode { [INFO] [stdout] | ------------------------------------------------------------------- associated function in this implementation [INFO] [stdout] 150 | fn new(x: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `n`, `head`, and `tail` are never read [INFO] [stdout] --> src/structs/linked_lists/dl_list.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct DLList { [INFO] [stdout] | ------ fields in this struct [INFO] [stdout] 9 | n: isize, [INFO] [stdout] | ^ [INFO] [stdout] 10 | head: NodeWrapper, [INFO] [stdout] | ^^^^ [INFO] [stdout] 11 | tail: NodeWrapper, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `DLList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `get_node` is never used [INFO] [stdout] --> src/structs/linked_lists/dl_list.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl DLList { [INFO] [stdout] | ----------------------------------------------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 23 | fn get_node(&self, index: usize) -> Option> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `value`, `delete`, `next`, and `prev` are never used [INFO] [stdout] --> src/structs/linked_lists/dl_list.rs:81:8 [INFO] [stdout] | [INFO] [stdout] 77 | impl NodeWrapper { [INFO] [stdout] | ---------------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 81 | fn value(&self) -> T { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn delete(self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn next(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | fn prev(&self) -> Option { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `x` is never read [INFO] [stdout] --> src/structs/linked_lists/dl_list.rs:138:5 [INFO] [stdout] | [INFO] [stdout] 137 | struct Node { [INFO] [stdout] | ---- field in this struct [INFO] [stdout] 138 | x: T, [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: `Node` has derived impls for the traits `Default`, `Clone`, and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SEList` is never constructed [INFO] [stdout] --> src/structs/linked_lists/se_list.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct SEList {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `get_next`, `get_length`, `set_next`, and `set_length` are never used [INFO] [stdout] --> src/structs/skip_lists/skip_list_list.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Node { [INFO] [stdout] | --------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 21 | fn get_next(&self, h: usize) -> Option>>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn get_length(&self, h: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn set_next(&mut self, h: usize, next: Option>>>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn set_length(&mut self, h: usize, l: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `find_pred`, `add_base`, `change_height`, `gen_height`, and `height` are never used [INFO] [stdout] --> src/structs/skip_lists/skip_list_list.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 72 | impl SkipListList { [INFO] [stdout] | ----------------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 78 | fn find_pred(&self, i: usize) -> Rc>> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn add_base(&mut self, i: usize, x: T, h: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | fn change_height(&mut self, h: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 164 | fn gen_height(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 174 | fn height(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `set_next` and `get_next` are never used [INFO] [stdout] --> src/structs/skip_lists/skip_list_sset.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl Node { [INFO] [stdout] | ---------------------------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 25 | fn set_next(&mut self, h: usize, next: Option>>>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn get_next(&self, h: usize) -> Option>>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/structs/skip_lists/skip_list_sset.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl SkipListSSet { [INFO] [stdout] | ------------------------------------------------------------------------------------ methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn find_pred_node(&self, x: T) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn add_base(&mut self, x: T, height: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 128 | fn gen_height(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 138 | fn height(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn change_height(&mut self, h: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 144 | fn get_next(&self, h: usize) -> Option>>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | fn set_next(&mut self, h: usize, next: Option>>>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `ToUsize` is never used [INFO] [stdout] --> src/structs/tries/binary_trie.rs:5:11 [INFO] [stdout] | [INFO] [stdout] 5 | pub trait ToUsize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `num` and `update_jump` are never used [INFO] [stdout] --> src/structs/tries/binary_trie.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl StrongLinkNode { [INFO] [stdout] | -------------------------------------------------------------- methods in this implementation [INFO] [stdout] 9 | pub fn num(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | pub(super) fn update_jump(&mut self, binary: Binary) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `PathNode` and `Leaf` are never constructed [INFO] [stdout] --> src/structs/tries/binary_trie.rs:28:5 [INFO] [stdout] | [INFO] [stdout] 27 | pub(super) enum PathNodeOrLeaf { [INFO] [stdout] | -------------- variants in this enum [INFO] [stdout] 28 | PathNode, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] 29 | Leaf(T), [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `PathNodeOrLeaf` 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: associated functions `new_leaf` and `new_path` are never used [INFO] [stdout] --> src/structs/tries/binary_trie.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl PathNodeOrLeaf { [INFO] [stdout] | -------------------------------------------- associated functions in this implementation [INFO] [stdout] 32 | pub fn new_leaf(x: T) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn new_path() -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Binary` is never used [INFO] [stdout] --> src/structs/tries/binary_trie.rs:46:17 [INFO] [stdout] | [INFO] [stdout] 46 | pub(super) enum Binary { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Binary` 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: associated items `calc_binary`, `other`, and `to_num` are never used [INFO] [stdout] --> src/structs/tries/binary_trie.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Binary { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 51 | pub fn calc_binary(number: usize, digit: usize) -> Self { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn other(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn to_num(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTrie` is never constructed [INFO] [stdout] --> src/structs/tries/binary_trie.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | pub struct BinaryTrie { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BinaryTrie` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/tries/binary_trie.rs:87:12 [INFO] [stdout] | [INFO] [stdout] 86 | impl BinaryTrie { [INFO] [stdout] | ---------------------------------------------------------- associated items in this implementation [INFO] [stdout] 87 | pub fn new(w: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | pub fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 148 | pub fn remove(&mut self, x: &T) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 174 | pub fn find(&self, x: T) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 177 | fn find_leaf(&self, num: usize) -> StrongLinkNode { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 184 | fn find_prev(&self, num: usize) -> StrongLinkNode { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 207 | fn in_range(&self, x: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check_prev_next` is never used [INFO] [stdout] --> src/structs/tries/helper.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn check_prev_next(tree: BinaryTrie) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rec_assert` is never used [INFO] [stdout] --> src/structs/tries/helper.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn rec_assert( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new_leaf` and `new_path_node` are never used [INFO] [stdout] --> src/structs/tries/nodes/node.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Node { [INFO] [stdout] | ------------------------------------------ associated functions in this implementation [INFO] [stdout] 28 | pub fn new_leaf(x: T) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn new_path_node() -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/tries/nodes/strong_link.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl StrongLinkNode { [INFO] [stdout] | ---------------------------------------------------- associated items in this implementation [INFO] [stdout] 10 | pub fn new_leaf(x: T) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 13 | pub fn new(node: Option>>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn new_path_node() -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | pub fn new_none() -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn clone(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn get_min_child(&self) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn get_max_child(&self) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn next(&self) -> Self { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn prev(&self) -> Self { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | pub fn to_weak(&self) -> WeakLinkNode { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | pub fn has_child(&self, index: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn has_one_child(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | pub fn has_two_child(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | pub fn has_jump(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | pub fn left(&self) -> Self { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | pub fn right(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | pub fn child(&self, index: usize) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | pub fn parent(&self) -> Self { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | pub fn jump(&self) -> Self { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | pub fn set_jump(&mut self, leaf: Self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | pub fn remove_jump(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | pub fn set_next(&mut self, leaf: Self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 128 | pub fn set_prev(&mut self, leaf: Self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn remove_child(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | pub fn set_child(&mut self, child: Self, index: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 156 | pub fn set_left(&mut self, child: Self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 162 | pub fn set_right(&mut self, child: Self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 168 | pub fn set_parent(&mut self, node: Self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new_none`, `new`, `clone`, and `to_node` are never used [INFO] [stdout] --> src/structs/tries/nodes/weak_link.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl WeakLinkNode { [INFO] [stdout] | -------------------------------------------------- associated items in this implementation [INFO] [stdout] 8 | pub fn new_none() -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | pub fn new(weak_link: Option>>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn clone(&self) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn to_node(self) -> StrongLinkNode { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `XFastTrie` is never constructed [INFO] [stdout] --> src/structs/tries/x_fast_trie.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct XFastTrie { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `XFastTrie` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/structs/tries/x_fast_trie.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl XFastTrie { [INFO] [stdout] | --------------------------------------------------------- associated items in this implementation [INFO] [stdout] 27 | pub fn new(w: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn digit_to_depth(&self, digit: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn add(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | fn find_prev(&self, x: &T) -> StrongLinkNode { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn find_leaf(&self, x: &T) -> StrongLinkNode { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 143 | fn in_range(&self, x: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | pub fn find(&self, x: &T) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryLabel` is never constructed [INFO] [stdout] --> src/structs/tries/x_fast_trie_parts/binary_label.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct BinaryLabel { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BinaryLabel` 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: associated items `new` and `is_same` are never used [INFO] [stdout] --> src/structs/tries/x_fast_trie_parts/binary_label.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl BinaryLabel { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 9 | pub fn new(max_depth: usize, label_depth: usize, usized_data: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | pub fn is_same(&self, label_depth: usize, usized_data: usize) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `XFastTrieHashTable` is never constructed [INFO] [stdout] --> src/structs/tries/x_fast_trie_parts/hash_table.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct XFastTrieHashTable { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `XFastTrieHashTable` 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: multiple associated items are never used [INFO] [stdout] --> src/structs/tries/x_fast_trie_parts/hash_table.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl XFastTrieHashTable { [INFO] [stdout] | -------------------------------------------------------- associated items in this implementation [INFO] [stdout] 14 | pub fn new(max_depth: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn get(&self, depth: usize, usized_data: &impl ToUsize) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn register_binary_labels(&mut self, depth: usize, usized_data: &impl ToUsize, node: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn remove(&mut self, depth: usize, usized_data: &impl ToUsize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn find(&self, depth: usize, usized_data: &impl ToUsize) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn chaeck_in_range(&self, depth: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn in_range(&self, depth: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | fn gen_key(&self, depth: usize, usized_data: &impl ToUsize) -> BinaryLabel { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | fn leaf_parent_depth(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn table_index(depth: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn containes_all_label_at_data(&self, usized_leaf: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `NodeBoundary` is never used [INFO] [stdout] --> src/types/node_boundary.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait NodeBoundary: Clone + Debug + Eq + PartialEq {} [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: bounds on generic parameters in type aliases are not enforced [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:34:22 [INFO] [stdout] | [INFO] [stdout] 34 | type RedBlackNode = [INFO] [stdout] | --^^^^^---^^^^^---^^---^^^^^^^^^---^^^^^^^^^^---^^^ [INFO] [stdout] | | | [INFO] [stdout] | | will not be checked at usage sites of the type alias [INFO] [stdout] | help: remove this bound [INFO] [stdout] | [INFO] [stdout] = note: this is a known limitation of the type checker that may be lifted in a future edition. [INFO] [stdout] see issue #112792 for more information [INFO] [stdout] = help: add `#![feature(lazy_type_alias)]` to the crate attributes to enable the desired semantics [INFO] [stdout] = note: `#[warn(type_alias_bounds)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_B2_none` should have a snake case name [INFO] [stdout] --> src/structs/external_memory/helper.rs:2:14 [INFO] [stdout] | [INFO] [stdout] 2 | pub const fn build_B2_none() -> [Option; 2 * B] { [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `build_b2_none` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 3.65s [INFO] running `Command { std: "docker" "inspect" "39552f69dc9b14ed4cd5d4247b85bca2a8f2ee9b001af203fa6035fa34aeed96", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "39552f69dc9b14ed4cd5d4247b85bca2a8f2ee9b001af203fa6035fa34aeed96", kill_on_drop: false }` [INFO] [stdout] 39552f69dc9b14ed4cd5d4247b85bca2a8f2ee9b001af203fa6035fa34aeed96 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--no-run" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] e8ea5c0299b94e0be1788419c29d2596e97bb3ebc0fe6c13810449b506a5568f [INFO] running `Command { std: "docker" "start" "-a" "e8ea5c0299b94e0be1788419c29d2596e97bb3ebc0fe6c13810449b506a5568f", kill_on_drop: false }` [INFO] [stderr] Compiling data-structures v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused imports: `BufReader`, `Read`, `Write`, `fs::File`, `os::unix::thread`, and `stdin` [INFO] [stdout] --> src/main.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | fs::File, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] 3 | io::{stdin, BufRead, BufReader, Read, Write}, [INFO] [stdout] | ^^^^^ ^^^^^^^^^ ^^^^ ^^^^^ [INFO] [stdout] 4 | os::unix::thread, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Fill`, `Rng`, and `thread_rng` [INFO] [stdout] --> src/main.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | use rand::{thread_rng, Fill, Rng}; [INFO] [stdout] | ^^^^^^^^^^ ^^^^ ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BinaryTrie`, `binary_tree::binary_easy::BinarySearchTree`, and `x_fast_trie::XFastTrie` [INFO] [stdout] --> src/main.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | binary_tree::binary_easy::BinarySearchTree, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | binary_trie::{BinaryTrie, ToUsize}, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] 13 | x_fast_trie::XFastTrie, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `DerefMut`, `Deref`, and `rc::Rc` [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | ops::{Deref, DerefMut}, [INFO] [stdout] | ^^^^^ ^^^^^^^^ [INFO] [stdout] 4 | rc::Rc, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `binary_tree::WrapNode` [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:183:39 [INFO] [stdout] | [INFO] [stdout] 183 | use crate::structs::binary_tree::{binary_tree::WrapNode, red_black_tree::*}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around index expression [INFO] [stdout] --> src/structs/external_memory/btree.rs:286:31 [INFO] [stdout] | [INFO] [stdout] 286 | parent_block.children[(*left_index + 1)] = None; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 286 - parent_block.children[(*left_index + 1)] = None; [INFO] [stdout] 286 + parent_block.children[*left_index + 1] = None; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fmt::Debug` [INFO] [stdout] --> src/structs/linked_lists/se_list.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fmt::Debug; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/main.rs:3:17 [INFO] [stdout] | [INFO] [stdout] 3 | io::{stdin, BufRead, BufReader, Read, Write}, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/structs/binary_tree/binary_easy.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | let mut v = vec![7, 3, 1, 5, 4, 6, 11, 9, 8, 13, 12, 14]; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `next` is never read [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:418:17 [INFO] [stdout] | [INFO] [stdout] 418 | let mut next = None; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `next` is never read [INFO] [stdout] --> src/structs/binary_tree/random_binary_search_tree.rs:312:17 [INFO] [stdout] | [INFO] [stdout] 312 | let mut next = None; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let mut node = RedBlackNode::new(RedBlackNodeValue { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tree` [INFO] [stdout] --> src/structs/external_memory/btree.rs:594:17 [INFO] [stdout] | [INFO] [stdout] 594 | let mut tree = BTree::::new(); [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_tree` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/structs/external_memory/btree.rs:594:13 [INFO] [stdout] | [INFO] [stdout] 594 | let mut tree = BTree::::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `d` [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:42:17 [INFO] [stdout] | [INFO] [stdout] 42 | let mut d = 1; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_d` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:42:13 [INFO] [stdout] | [INFO] [stdout] 42 | let mut d = 1; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/structs/heap/binary_heap.rs:119:13 [INFO] [stdout] | [INFO] [stdout] 119 | let mut tobe = BinaryHeap { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s1` [INFO] [stdout] --> src/main.rs:50:9 [INFO] [stdout] | [INFO] [stdout] 50 | let s1 = " 0 \n 1 \n".to_string(); [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2` [INFO] [stdout] --> src/main.rs:51:9 [INFO] [stdout] | [INFO] [stdout] 51 | let s2 = " 1 \n 3 \n".to_string(); [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `size` is never used [INFO] [stdout] --> src/interfaces/list.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait List { [INFO] [stdout] | ---- method in this trait [INFO] [stdout] 4 | fn size(&self) -> usize; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `size` is never used [INFO] [stdout] --> src/interfaces/uset.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait USet { [INFO] [stdout] | ---- method in this trait [INFO] [stdout] 4 | fn size(&self) -> usize; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new_with_len` is never used [INFO] [stdout] --> src/structs/arrays/array_stack.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 18 | impl ArrayStack { [INFO] [stdout] | ---------------------------------------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn new_with_len(len: usize) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DualArrayDeque` is never constructed [INFO] [stdout] --> src/structs/arrays/dual_array_deque.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct DualArrayDeque { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `size` is never used [INFO] [stdout] --> src/structs/arrays/dual_array_deque.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl DualArrayDeque { [INFO] [stdout] | -------------------------------------------------- method in this implementation [INFO] [stdout] 11 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `find` is never used [INFO] [stdout] --> src/structs/binary_tree/binary_tree.rs:188:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl WrapNode { [INFO] [stdout] | ---------------------------------------------------------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 188 | pub fn find(&self, value: T) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl NodeColor { [INFO] [stdout] | -------------- associated function in this implementation [INFO] [stdout] 15 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `pull_black` is never used [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:134:8 [INFO] [stdout] | [INFO] [stdout] 111 | / impl RedBlackNode [INFO] [stdout] 112 | | where [INFO] [stdout] 113 | | T: Clone + Debug + Eq + PartialEq + PartialOrd + Ord, [INFO] [stdout] | |_________________________________________________________- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 134 | fn pull_black(&mut self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `update_block`, `place_data`, `free_block`, and `block_list_len` are never used [INFO] [stdout] --> src/structs/external_memory/block_store.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl BlockStore { [INFO] [stdout] | ---------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn update_block(&mut self, index: BIndex, data: T) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | pub fn place_data(&mut self, b: T) -> BIndex { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn free_block(&mut self, i: BIndex) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | pub fn block_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `index` is never used [INFO] [stdout] --> src/structs/external_memory/block_store.rs:98:12 [INFO] [stdout] | [INFO] [stdout] 94 | impl Block { [INFO] [stdout] | ---------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 98 | pub fn index(&self) -> BIndex { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `child_num`, `key_num`, `last_child`, and `last_key` are never used [INFO] [stdout] --> src/structs/external_memory/btree.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 13 | / impl Node [INFO] [stdout] 14 | | where [INFO] [stdout] 15 | | T: Clone + Debug + PartialEq + PartialOrd + Ord + Default, [INFO] [stdout] | |______________________________________________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 54 | fn child_num(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn key_num(&self) -> usize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn last_child(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn last_key(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/structs/external_memory/btree.rs:196:12 [INFO] [stdout] | [INFO] [stdout] 135 | / impl BTree [INFO] [stdout] 136 | | where [INFO] [stdout] 137 | | T: Clone + Debug + PartialEq + PartialOrd + Ord + Default, [INFO] [stdout] | |______________________________________________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 196 | pub fn remove(&mut self, x: T) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 199 | fn remove_rec(&mut self, x: T, node_index: Option) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 230 | fn remove_smallest(&mut self, node_index: BIndex) -> T { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 241 | fn check_underflow(&mut self, block: Block>, child_index: ChildIndex) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 251 | fn shift_rl(&mut self, mut underflow_block: Block>, mut helper_block: Block>) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 264 | fn merge( [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 294 | fn check_underflow_zero(&mut self, parent_block: Block>, child_index: ChildIndex) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 312 | fn check_underflow_non_zero(&mut self, parent_block: Block>, child_index: ChildIndex) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `d` is never read [INFO] [stdout] --> src/structs/hash_tables/liner_hash_table.rs:25:5 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct LinerHashTable { [INFO] [stdout] | -------------- field in this struct [INFO] [stdout] ... [INFO] [stdout] 25 | d: u32, [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: `LinerHashTable` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/structs/heap/binary_heap.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl BinaryHeap { [INFO] [stdout] | ------------------------------------------------------------- associated function in this implementation [INFO] [stdout] 10 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `parent` is never used [INFO] [stdout] --> src/structs/heap/meldable_heap.rs:98:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl WrapNode { [INFO] [stdout] | ----------------------------------------------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 98 | fn parent(&self) -> Self { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SEList` is never constructed [INFO] [stdout] --> src/structs/linked_lists/se_list.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct SEList {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check_prev_next` is never used [INFO] [stdout] --> src/structs/tries/helper.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn check_prev_next(tree: BinaryTrie) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `has_child` is never used [INFO] [stdout] --> src/structs/tries/nodes/strong_link.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl StrongLinkNode { [INFO] [stdout] | ---------------------------------------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 78 | pub fn has_child(&self, index: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `in_range` is never used [INFO] [stdout] --> src/structs/tries/x_fast_trie.rs:143:8 [INFO] [stdout] | [INFO] [stdout] 26 | impl XFastTrie { [INFO] [stdout] | --------------------------------------------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 143 | fn in_range(&self, x: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `leaf_parent_depth` and `containes_all_label_at_data` are never used [INFO] [stdout] --> src/structs/tries/x_fast_trie_parts/hash_table.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl XFastTrieHashTable { [INFO] [stdout] | -------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 49 | fn leaf_parent_depth(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn containes_all_label_at_data(&self, usized_leaf: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `NodeBoundary` is never used [INFO] [stdout] --> src/types/node_boundary.rs:3:11 [INFO] [stdout] | [INFO] [stdout] 3 | pub trait NodeBoundary: Clone + Debug + Eq + PartialEq {} [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: bounds on generic parameters in type aliases are not enforced [INFO] [stdout] --> src/structs/binary_tree/red_black_tree.rs:34:22 [INFO] [stdout] | [INFO] [stdout] 34 | type RedBlackNode = [INFO] [stdout] | --^^^^^---^^^^^---^^---^^^^^^^^^---^^^^^^^^^^---^^^ [INFO] [stdout] | | | [INFO] [stdout] | | will not be checked at usage sites of the type alias [INFO] [stdout] | help: remove this bound [INFO] [stdout] | [INFO] [stdout] = note: this is a known limitation of the type checker that may be lifted in a future edition. [INFO] [stdout] see issue #112792 for more information [INFO] [stdout] = help: add `#![feature(lazy_type_alias)]` to the crate attributes to enable the desired semantics [INFO] [stdout] = note: `#[warn(type_alias_bounds)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_B2_none` should have a snake case name [INFO] [stdout] --> src/structs/external_memory/helper.rs:2:14 [INFO] [stdout] | [INFO] [stdout] 2 | pub const fn build_B2_none() -> [Option; 2 * B] { [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `build_b2_none` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 2.65s [INFO] running `Command { std: "docker" "inspect" "e8ea5c0299b94e0be1788419c29d2596e97bb3ebc0fe6c13810449b506a5568f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "e8ea5c0299b94e0be1788419c29d2596e97bb3ebc0fe6c13810449b506a5568f", kill_on_drop: false }` [INFO] [stdout] e8ea5c0299b94e0be1788419c29d2596e97bb3ebc0fe6c13810449b506a5568f [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] c4a6dbd1852cbe199ca1db3a2c9d971ed5d960d0bcd639521761f053cd7e319f [INFO] running `Command { std: "docker" "start" "-a" "c4a6dbd1852cbe199ca1db3a2c9d971ed5d960d0bcd639521761f053cd7e319f", kill_on_drop: false }` [INFO] [stderr] warning: unused imports: `BufReader`, `Read`, `Write`, `fs::File`, `os::unix::thread`, and `stdin` [INFO] [stderr] --> src/main.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | fs::File, [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] 3 | io::{stdin, BufRead, BufReader, Read, Write}, [INFO] [stderr] | ^^^^^ ^^^^^^^^^ ^^^^ ^^^^^ [INFO] [stderr] 4 | os::unix::thread, [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Fill`, `Rng`, and `thread_rng` [INFO] [stderr] --> src/main.rs:7:12 [INFO] [stderr] | [INFO] [stderr] 7 | use rand::{thread_rng, Fill, Rng}; [INFO] [stderr] | ^^^^^^^^^^ ^^^^ ^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `BinaryTrie`, `binary_tree::binary_easy::BinarySearchTree`, and `x_fast_trie::XFastTrie` [INFO] [stderr] --> src/main.rs:9:5 [INFO] [stderr] | [INFO] [stderr] 9 | binary_tree::binary_easy::BinarySearchTree, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 12 | binary_trie::{BinaryTrie, ToUsize}, [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] 13 | x_fast_trie::XFastTrie, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `DerefMut`, `Deref`, and `rc::Rc` [INFO] [stderr] --> src/structs/binary_tree/red_black_tree.rs:3:11 [INFO] [stderr] | [INFO] [stderr] 3 | ops::{Deref, DerefMut}, [INFO] [stderr] | ^^^^^ ^^^^^^^^ [INFO] [stderr] 4 | rc::Rc, [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `binary_tree::WrapNode` [INFO] [stderr] --> src/structs/binary_tree/red_black_tree.rs:183:39 [INFO] [stderr] | [INFO] [stderr] 183 | use crate::structs::binary_tree::{binary_tree::WrapNode, red_black_tree::*}; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unnecessary parentheses around index expression [INFO] [stderr] --> src/structs/external_memory/btree.rs:286:31 [INFO] [stderr] | [INFO] [stderr] 286 | parent_block.children[(*left_index + 1)] = None; [INFO] [stderr] | ^ ^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_parens)]` on by default [INFO] [stderr] help: remove these parentheses [INFO] [stderr] | [INFO] [stderr] 286 - parent_block.children[(*left_index + 1)] = None; [INFO] [stderr] 286 + parent_block.children[*left_index + 1] = None; [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::fmt::Debug` [INFO] [stderr] --> src/structs/linked_lists/se_list.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use std::fmt::Debug; [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `BufRead` [INFO] [stderr] --> src/main.rs:3:17 [INFO] [stderr] | [INFO] [stderr] 3 | io::{stdin, BufRead, BufReader, Read, Write}, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/structs/binary_tree/binary_easy.rs:73:9 [INFO] [stderr] | [INFO] [stderr] 73 | let mut v = vec![7, 3, 1, 5, 4, 6, 11, 9, 8, 13, 12, 14]; [INFO] [stderr] | ----^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: value assigned to `next` is never read [INFO] [stderr] --> src/structs/binary_tree/binary_tree.rs:418:17 [INFO] [stderr] | [INFO] [stderr] 418 | let mut next = None; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] [INFO] [stderr] warning: value assigned to `next` is never read [INFO] [stderr] --> src/structs/binary_tree/random_binary_search_tree.rs:312:17 [INFO] [stderr] | [INFO] [stderr] 312 | let mut next = None; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/structs/binary_tree/red_black_tree.rs:56:13 [INFO] [stderr] | [INFO] [stderr] 56 | let mut node = RedBlackNode::new(RedBlackNodeValue { [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `tree` [INFO] [stderr] --> src/structs/external_memory/btree.rs:594:17 [INFO] [stderr] | [INFO] [stderr] 594 | let mut tree = BTree::::new(); [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_tree` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/structs/external_memory/btree.rs:594:13 [INFO] [stderr] | [INFO] [stderr] 594 | let mut tree = BTree::::new(); [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `d` [INFO] [stderr] --> src/structs/hash_tables/liner_hash_table.rs:42:17 [INFO] [stderr] | [INFO] [stderr] 42 | let mut d = 1; [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_d` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/structs/hash_tables/liner_hash_table.rs:42:13 [INFO] [stderr] | [INFO] [stderr] 42 | let mut d = 1; [INFO] [stderr] | ----^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/structs/heap/binary_heap.rs:119:13 [INFO] [stderr] | [INFO] [stderr] 119 | let mut tobe = BinaryHeap { [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `s1` [INFO] [stderr] --> src/main.rs:50:9 [INFO] [stderr] | [INFO] [stderr] 50 | let s1 = " 0 \n 1 \n".to_string(); [INFO] [stderr] | ^^ help: if this is intentional, prefix it with an underscore: `_s1` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `s2` [INFO] [stderr] --> src/main.rs:51:9 [INFO] [stderr] | [INFO] [stderr] 51 | let s2 = " 1 \n 3 \n".to_string(); [INFO] [stderr] | ^^ help: if this is intentional, prefix it with an underscore: `_s2` [INFO] [stderr] [INFO] [stderr] warning: method `size` is never used [INFO] [stderr] --> src/interfaces/list.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub trait List { [INFO] [stderr] | ---- method in this trait [INFO] [stderr] 4 | fn size(&self) -> usize; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: method `size` is never used [INFO] [stderr] --> src/interfaces/uset.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub trait USet { [INFO] [stderr] | ---- method in this trait [INFO] [stderr] 4 | fn size(&self) -> usize; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function `new_with_len` is never used [INFO] [stderr] --> src/structs/arrays/array_stack.rs:25:12 [INFO] [stderr] | [INFO] [stderr] 18 | impl ArrayStack { [INFO] [stderr] | ---------------------------------------------- associated function in this implementation [INFO] [stderr] ... [INFO] [stderr] 25 | pub fn new_with_len(len: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `DualArrayDeque` is never constructed [INFO] [stderr] --> src/structs/arrays/dual_array_deque.rs:5:12 [INFO] [stderr] | [INFO] [stderr] 5 | pub struct DualArrayDeque { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `size` is never used [INFO] [stderr] --> src/structs/arrays/dual_array_deque.rs:11:12 [INFO] [stderr] | [INFO] [stderr] 10 | impl DualArrayDeque { [INFO] [stderr] | -------------------------------------------------- method in this implementation [INFO] [stderr] 11 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `find` is never used [INFO] [stderr] --> src/structs/binary_tree/binary_tree.rs:188:12 [INFO] [stderr] | [INFO] [stderr] 46 | impl WrapNode { [INFO] [stderr] | ---------------------------------------------------------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 188 | pub fn find(&self, value: T) -> bool { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> src/structs/binary_tree/red_black_tree.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 14 | impl NodeColor { [INFO] [stderr] | -------------- associated function in this implementation [INFO] [stderr] 15 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: method `pull_black` is never used [INFO] [stderr] --> src/structs/binary_tree/red_black_tree.rs:134:8 [INFO] [stderr] | [INFO] [stderr] 111 | / impl RedBlackNode [INFO] [stderr] 112 | | where [INFO] [stderr] 113 | | T: Clone + Debug + Eq + PartialEq + PartialOrd + Ord, [INFO] [stderr] | |_________________________________________________________- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 134 | fn pull_black(&mut self) { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `update_block`, `place_data`, `free_block`, and `block_list_len` are never used [INFO] [stderr] --> src/structs/external_memory/block_store.rs:39:12 [INFO] [stderr] | [INFO] [stderr] 13 | impl BlockStore { [INFO] [stderr] | ---------------------------- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 39 | pub fn update_block(&mut self, index: BIndex, data: T) { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 69 | pub fn place_data(&mut self, b: T) -> BIndex { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 81 | pub fn free_block(&mut self, i: BIndex) { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 85 | pub fn block_list_len(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `index` is never used [INFO] [stderr] --> src/structs/external_memory/block_store.rs:98:12 [INFO] [stderr] | [INFO] [stderr] 94 | impl Block { [INFO] [stderr] | ---------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 98 | pub fn index(&self) -> BIndex { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `child_num`, `key_num`, `last_child`, and `last_key` are never used [INFO] [stderr] --> src/structs/external_memory/btree.rs:54:8 [INFO] [stderr] | [INFO] [stderr] 13 | / impl Node [INFO] [stderr] 14 | | where [INFO] [stderr] 15 | | T: Clone + Debug + PartialEq + PartialOrd + Ord + Default, [INFO] [stderr] | |______________________________________________________________- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 54 | fn child_num(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 61 | fn key_num(&self) -> usize { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 68 | fn last_child(&mut self) -> Option { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 71 | fn last_key(&mut self) -> Option { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple methods are never used [INFO] [stderr] --> src/structs/external_memory/btree.rs:196:12 [INFO] [stderr] | [INFO] [stderr] 135 | / impl BTree [INFO] [stderr] 136 | | where [INFO] [stderr] 137 | | T: Clone + Debug + PartialEq + PartialOrd + Ord + Default, [INFO] [stderr] | |______________________________________________________________- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 196 | pub fn remove(&mut self, x: T) -> bool { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 199 | fn remove_rec(&mut self, x: T, node_index: Option) -> bool { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 230 | fn remove_smallest(&mut self, node_index: BIndex) -> T { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 241 | fn check_underflow(&mut self, block: Block>, child_index: ChildIndex) { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 251 | fn shift_rl(&mut self, mut underflow_block: Block>, mut helper_block: Block>) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 264 | fn merge( [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 294 | fn check_underflow_zero(&mut self, parent_block: Block>, child_index: ChildIndex) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 312 | fn check_underflow_non_zero(&mut self, parent_block: Block>, child_index: ChildIndex) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field `d` is never read [INFO] [stderr] --> src/structs/hash_tables/liner_hash_table.rs:25:5 [INFO] [stderr] | [INFO] [stderr] 20 | pub struct LinerHashTable { [INFO] [stderr] | -------------- field in this struct [INFO] [stderr] ... [INFO] [stderr] 25 | d: u32, [INFO] [stderr] | ^ [INFO] [stderr] | [INFO] [stderr] = note: `LinerHashTable` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> src/structs/heap/binary_heap.rs:10:12 [INFO] [stderr] | [INFO] [stderr] 9 | impl BinaryHeap { [INFO] [stderr] | ------------------------------------------------------------- associated function in this implementation [INFO] [stderr] 10 | pub fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: method `parent` is never used [INFO] [stderr] --> src/structs/heap/meldable_heap.rs:98:8 [INFO] [stderr] | [INFO] [stderr] 52 | impl WrapNode { [INFO] [stderr] | ----------------------------------------------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 98 | fn parent(&self) -> Self { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `SEList` is never constructed [INFO] [stderr] --> src/structs/linked_lists/se_list.rs:3:12 [INFO] [stderr] | [INFO] [stderr] 3 | pub struct SEList {} [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `check_prev_next` is never used [INFO] [stderr] --> src/structs/tries/helper.rs:8:8 [INFO] [stderr] | [INFO] [stderr] 8 | pub fn check_prev_next(tree: BinaryTrie) { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `has_child` is never used [INFO] [stderr] --> src/structs/tries/nodes/strong_link.rs:78:12 [INFO] [stderr] | [INFO] [stderr] 9 | impl StrongLinkNode { [INFO] [stderr] | ---------------------------------------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 78 | pub fn has_child(&self, index: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `in_range` is never used [INFO] [stderr] --> src/structs/tries/x_fast_trie.rs:143:8 [INFO] [stderr] | [INFO] [stderr] 26 | impl XFastTrie { [INFO] [stderr] | --------------------------------------------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 143 | fn in_range(&self, x: &T) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `leaf_parent_depth` and `containes_all_label_at_data` are never used [INFO] [stderr] --> src/structs/tries/x_fast_trie_parts/hash_table.rs:49:8 [INFO] [stderr] | [INFO] [stderr] 13 | impl XFastTrieHashTable { [INFO] [stderr] | -------------------------------------------------------- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 49 | fn leaf_parent_depth(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 55 | fn containes_all_label_at_data(&self, usized_leaf: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: trait `NodeBoundary` is never used [INFO] [stderr] --> src/types/node_boundary.rs:3:11 [INFO] [stderr] | [INFO] [stderr] 3 | pub trait NodeBoundary: Clone + Debug + Eq + PartialEq {} [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: bounds on generic parameters in type aliases are not enforced [INFO] [stderr] --> src/structs/binary_tree/red_black_tree.rs:34:22 [INFO] [stderr] | [INFO] [stderr] 34 | type RedBlackNode = [INFO] [stderr] | --^^^^^---^^^^^---^^---^^^^^^^^^---^^^^^^^^^^---^^^ [INFO] [stderr] | | | [INFO] [stderr] | | will not be checked at usage sites of the type alias [INFO] [stderr] | help: remove this bound [INFO] [stderr] | [INFO] [stderr] = note: this is a known limitation of the type checker that may be lifted in a future edition. [INFO] [stderr] see issue #112792 for more information [INFO] [stderr] = help: add `#![feature(lazy_type_alias)]` to the crate attributes to enable the desired semantics [INFO] [stderr] = note: `#[warn(type_alias_bounds)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `build_B2_none` should have a snake case name [INFO] [stderr] --> src/structs/external_memory/helper.rs:2:14 [INFO] [stderr] | [INFO] [stderr] 2 | pub const fn build_B2_none() -> [Option; 2 * B] { [INFO] [stderr] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `build_b2_none` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_snake_case)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `data-structures` (bin "data-structures" test) generated 42 warnings (run `cargo fix --bin "data-structures" --tests` to apply 13 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.04s [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/data_structures-7aec8b0bb49a8e46) [INFO] [stdout] [INFO] [stdout] running 74 tests [INFO] [stdout] test macros::json::macro_json_test::json_null_test ... ok [INFO] [stdout] test macros::json::macro_json_test::json_array_test ... ok [INFO] [stdout] test macros::json::macro_json_test::json_num_test ... ok [INFO] [stdout] test structs::arrays::array_deque::array_deque_test::add_test ... ok [INFO] [stdout] test structs::arrays::array_deque::array_deque_test::get_test ... ok [INFO] [stdout] test structs::arrays::array_deque::array_deque_test::remove_test ... ok [INFO] [stdout] test structs::arrays::array_queue::array_queue_test::add_test ... ok [INFO] [stdout] test structs::arrays::array_stack::array_stack_test::add_test ... ok [INFO] [stdout] test structs::arrays::array_stack::array_stack_test::remove_test ... ok [INFO] [stdout] test structs::arrays::array_queue::array_queue_test::remove_test ... ok [INFO] [stdout] test structs::arrays::array_stack::array_stack_test::set_test ... ok [INFO] [stdout] test structs::arrays::array_stack::array_stack_test::iter_test ... ok [INFO] [stdout] test structs::arrays::array_deque::array_deque_test::set_test ... ok [INFO] [stdout] test structs::binary_tree::binary_tree::binary_tree_test::add_test ... ok [INFO] [stdout] test structs::binary_tree::binary_tree::binary_tree_test::find_test ... ok [INFO] [stdout] test structs::binary_tree::binary_tree::binary_tree_test::node_eq_test ... ok [INFO] [stdout] test structs::binary_tree::binary_easy::test ... ok [INFO] [stdout] test structs::binary_tree::binary_tree::binary_tree_test::remove_test ... ok [INFO] [stdout] test structs::binary_tree::binary_tree::binary_tree_test::size_test ... ok [INFO] [stdout] test structs::binary_tree::random_binary_search_tree::treap_tree_test::add_test ... ok [INFO] [stdout] test structs::binary_tree::random_binary_search_tree::treap_tree_test::remove_test ... ok [INFO] [stdout] test structs::binary_tree::binary_tree::binary_tree_test::depth_test ... ok [INFO] [stdout] test structs::binary_tree::random_binary_search_tree::treap_tree_test::size_test ... ok [INFO] [stdout] test structs::binary_tree::red_black_tree::red_black_tree_test::add_test ... ok [INFO] [stdout] test structs::binary_tree::scapegoat_tree::scapegoat_tree_test::build_balanced_test ... ok [INFO] [stdout] test structs::external_memory::btree::btree_test::node_add_test ... ok [INFO] [stdout] test structs::graphs::adjacency_list::adjacency_list_test::dfs2_test ... ok [INFO] [stdout] test structs::graphs::adjacency_list::adjacency_list_test::test ... ok [INFO] [stdout] test structs::graphs::adjacency_list::adjacency_list_test::can_reach_test ... ok [INFO] [stdout] test structs::hash_tables::chaned_hash_table::chaned_hash_table_test::hash_test ... ok [INFO] [stdout] test structs::binary_tree::scapegoat_tree::scapegoat_tree_test::pack_into_array_test ... ok [INFO] [stdout] test structs::binary_tree::scapegoat_tree::scapegoat_tree_test::add_test ... ok [INFO] [stdout] test structs::external_memory::btree::btree_test::remove_test ... ok [INFO] [stdout] test structs::external_memory::btree::btree_test::add_test ... ok [INFO] [stdout] test structs::graphs::adjacency_list::adjacency_list_test::dfs_test ... ok [INFO] [stdout] test structs::binary_tree::scapegoat_tree::scapegoat_tree_test::remove_test ... ok [INFO] [stdout] test structs::hash_tables::hash_gen::hash_gen_test::test ... ok [INFO] [stdout] test structs::hash_tables::chaned_hash_table::chaned_hash_table_test::test ... ok [INFO] [stdout] test structs::graphs::adjacency_matrix::adjacency_matrix_test::test ... ok [INFO] [stdout] test structs::heap::binary_heap::binary_heap_test::add_test ... ok [INFO] [stdout] test structs::hash_tables::liner_hash_table::liner_hash_table_test::test ... ok [INFO] [stdout] test structs::heap::binary_heap::binary_heap_test::remove_test ... ok [INFO] [stdout] test structs::linked_lists::dl_list::dl_list_test::get_test ... ok [INFO] [stdout] test structs::linked_lists::dl_list::dl_list_test::remove_test ... ok [INFO] [stdout] test structs::linked_lists::dl_list::dl_list_test::set_test ... ok [INFO] [stdout] test structs::linked_lists::sl_list::sl_list_tests::add_test ... ok [INFO] [stdout] test structs::linked_lists::dl_list::dl_list_test::node_wrapper_test ... ok [INFO] [stdout] test structs::linked_lists::sl_list::sl_list_tests::pop_test ... ok [INFO] [stdout] test structs::linked_lists::sl_list::sl_list_tests::push_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_list::skip_list_list_test::add_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_list::skip_list_list_test::get_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_list::skip_list_list_test::set_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_sset::skip_list_sset_test::add_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_sset::skip_list_sset_test::find_test ... ok [INFO] [stdout] test structs::tries::binary_trie::binary_trie_test::add_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_sset::skip_list_sset_test::add_base_test ... ok [INFO] [stdout] test structs::tries::binary_trie::binary_trie_test::calc_binary_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_sset::skip_list_sset_test::remove_test ... ok [INFO] [stdout] test structs::skip_lists::skip_list_list::skip_list_list_test::remove_test ... ok [INFO] [stdout] test structs::linked_lists::dl_list::dl_list_test::get_node_test ... ok [INFO] [stdout] test structs::tries::binary_trie::binary_trie_test::find_prev_test ... ok [INFO] [stdout] test structs::tries::binary_trie::binary_trie_test::find_test ... ok [INFO] [stdout] test structs::tries::binary_trie::binary_trie_test::remove_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie_parts::binary_label::binary_label_test::is_same_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie_parts::binary_label::binary_label_test::new_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie::x_fast_trie_test::add_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie_parts::hash_table::x_fast_trie_parts_test::find_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie_parts::hash_table::x_fast_trie_parts_test::get_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie_parts::hash_table::x_fast_trie_parts_test::x_fast_trie_hash_table_register_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie_parts::hash_table::x_fast_trie_parts_test::x_fast_trie_hash_table_remove_test ... ok [INFO] [stdout] test test_indent ... ok [INFO] [stdout] test structs::heap::meldable_heap::meldable_heap_test::test ... ok [INFO] [stdout] test structs::tries::x_fast_trie::x_fast_trie_test::find_test ... ok [INFO] [stdout] test structs::tries::x_fast_trie_parts::hash_table::x_fast_trie_parts_test::should_panic - should panic ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 74 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.09s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "c4a6dbd1852cbe199ca1db3a2c9d971ed5d960d0bcd639521761f053cd7e319f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "c4a6dbd1852cbe199ca1db3a2c9d971ed5d960d0bcd639521761f053cd7e319f", kill_on_drop: false }` [INFO] [stdout] c4a6dbd1852cbe199ca1db3a2c9d971ed5d960d0bcd639521761f053cd7e319f