[INFO] updating cached repository https://github.com/sebashack/rust_algorithms [INFO] running `"git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "-c" "remote.origin.fetch=refs/heads/*:refs/heads/*" "fetch" "origin" "--force" "--prune"` [INFO] [stderr] From https://github.com/sebashack/rust_algorithms [INFO] [stderr] c475170..e8ae15e master -> master [INFO] running `"git" "rev-parse" "HEAD"` [INFO] [stdout] e8ae15e0d55b3beecadd3027d88b959f3e52c9be [INFO] checking sebashack/rust_algorithms against try#8a749131e7beb72f6edacefd2bdcbed3d67b2112 for pr-72331 [INFO] running `"git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsebashack%2Frust_algorithms" "/workspace/builds/worker-11/source"` [INFO] [stderr] Cloning into '/workspace/builds/worker-11/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/sebashack/rust_algorithms on toolchain 8a749131e7beb72f6edacefd2bdcbed3d67b2112 [INFO] running `"/workspace/cargo-home/bin/cargo" "+8a749131e7beb72f6edacefd2bdcbed3d67b2112" "read-manifest" "--manifest-path" "Cargo.toml"` [INFO] started tweaking git repo https://github.com/sebashack/rust_algorithms [INFO] finished tweaking git repo https://github.com/sebashack/rust_algorithms [INFO] tweaked toml for git repo https://github.com/sebashack/rust_algorithms written to /workspace/builds/worker-11/source/Cargo.toml [INFO] crate git repo https://github.com/sebashack/rust_algorithms already has a lockfile, it will not be regenerated [INFO] running `"/workspace/cargo-home/bin/cargo" "+8a749131e7beb72f6edacefd2bdcbed3d67b2112" "fetch" "--locked" "--manifest-path" "Cargo.toml"` [INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-11/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-11/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" "MAP_USER_ID=0" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--network" "none" "rustops/crates-build-env" "/opt/rustwide/cargo-home/bin/cargo" "+8a749131e7beb72f6edacefd2bdcbed3d67b2112" "check" "--frozen" "--all" "--all-targets"` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] 5be4f21325ddb446ae17e0bdd3fcbe4eddda67d1648d848bebb9abf838e3a928 [INFO] running `"docker" "start" "-a" "5be4f21325ddb446ae17e0bdd3fcbe4eddda67d1648d848bebb9abf838e3a928"` [INFO] [stderr] sudo: setrlimit(RLIMIT_CORE): Operation not permitted [INFO] [stderr] Compiling getrandom v0.1.14 [INFO] [stderr] Checking rand_core v0.5.1 [INFO] [stderr] Checking rand_chacha v0.2.1 [INFO] [stderr] Checking rand v0.7.3 [INFO] [stderr] Checking rust_algorithms v0.1.0 (/opt/rustwide/workdir) [INFO] [stderr] warning: unused import: `Node` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:32:64 [INFO] [stderr] | [INFO] [stderr] 32 | use crate::algorithms::binary_search_tree::BST::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Leaf`, `Node` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:130:58 [INFO] [stderr] | [INFO] [stderr] 130 | use crate::algorithms::binary_search_tree::BST::{Leaf, Node}; [INFO] [stderr] | ^^^^ ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Leaf`, `Node` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:141:58 [INFO] [stderr] | [INFO] [stderr] 141 | use crate::algorithms::binary_search_tree::BST::{Leaf, Node}; [INFO] [stderr] | ^^^^ ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Node` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:41:57 [INFO] [stderr] | [INFO] [stderr] 41 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:170:47 [INFO] [stderr] | [INFO] [stderr] 170 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Black` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:202:47 [INFO] [stderr] | [INFO] [stderr] 202 | use crate::algorithms::llrb_tree::Color::{Black, Red}; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:203:47 [INFO] [stderr] | [INFO] [stderr] 203 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Black` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:235:47 [INFO] [stderr] | [INFO] [stderr] 235 | use crate::algorithms::llrb_tree::Color::{Black, Red}; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:236:47 [INFO] [stderr] | [INFO] [stderr] 236 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Node` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:32:64 [INFO] [stderr] | [INFO] [stderr] 32 | use crate::algorithms::binary_search_tree::BST::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Leaf`, `Node` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:130:58 [INFO] [stderr] | [INFO] [stderr] 130 | use crate::algorithms::binary_search_tree::BST::{Leaf, Node}; [INFO] [stderr] | ^^^^ ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Leaf`, `Node` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:141:58 [INFO] [stderr] | [INFO] [stderr] 141 | use crate::algorithms::binary_search_tree::BST::{Leaf, Node}; [INFO] [stderr] | ^^^^ ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Leaf`, `Node` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:185:54 [INFO] [stderr] | [INFO] [stderr] 185 | use crate::algorithms::binary_search_tree::BST::{Leaf, Node}; [INFO] [stderr] | ^^^^ ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `crate::algorithms::linked_list_stack::ConsumerIter` [INFO] [stderr] --> src/algorithms/linked_list_stack.rs:135:9 [INFO] [stderr] | [INFO] [stderr] 135 | use crate::algorithms::linked_list_stack::ConsumerIter; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Node` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:41:57 [INFO] [stderr] | [INFO] [stderr] 41 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:170:47 [INFO] [stderr] | [INFO] [stderr] 170 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Black` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:202:47 [INFO] [stderr] | [INFO] [stderr] 202 | use crate::algorithms::llrb_tree::Color::{Black, Red}; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:203:47 [INFO] [stderr] | [INFO] [stderr] 203 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Black` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:235:47 [INFO] [stderr] | [INFO] [stderr] 235 | use crate::algorithms::llrb_tree::Color::{Black, Red}; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `Leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:236:47 [INFO] [stderr] | [INFO] [stderr] 236 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Leaf`, `Node` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:267:47 [INFO] [stderr] | [INFO] [stderr] 267 | use crate::algorithms::llrb_tree::LLRBT::{Leaf, Node}; [INFO] [stderr] | ^^^^ ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rand::Rng` [INFO] [stderr] --> src/algorithms/sorting.rs:313:9 [INFO] [stderr] | [INFO] [stderr] 313 | use rand::Rng; [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused variable: `val` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:57:17 [INFO] [stderr] | [INFO] [stderr] 57 | val, [INFO] [stderr] | ^^^ help: try ignoring the field: `val: _` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `key` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:102:20 [INFO] [stderr] | [INFO] [stderr] 102 | Node { key, val, left, .. } => { [INFO] [stderr] | ^^^ help: try ignoring the field: `key: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `key` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:118:17 [INFO] [stderr] | [INFO] [stderr] 118 | key, val, right, .. [INFO] [stderr] | ^^^ help: try ignoring the field: `key: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `key` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:175:9 [INFO] [stderr] | [INFO] [stderr] 175 | key, [INFO] [stderr] | ^^^ help: try ignoring the field: `key: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `val` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:176:9 [INFO] [stderr] | [INFO] [stderr] 176 | val, [INFO] [stderr] | ^^^ help: try ignoring the field: `val: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `count` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:179:9 [INFO] [stderr] | [INFO] [stderr] 179 | count, [INFO] [stderr] | ^^^^^ help: try ignoring the field: `count: _` [INFO] [stderr] [INFO] [stderr] warning: variable `color` is assigned to, but never used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:188:23 [INFO] [stderr] | [INFO] [stderr] 188 | if let Node { mut color, .. } = **left { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: consider using `_color` instead [INFO] [stderr] [INFO] [stderr] warning: value assigned to `color` is never read [INFO] [stderr] --> src/algorithms/llrb_tree.rs:189:13 [INFO] [stderr] | [INFO] [stderr] 189 | color = Black; [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: variable `color` is assigned to, but never used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:192:23 [INFO] [stderr] | [INFO] [stderr] 192 | if let Node { mut color, .. } = **right { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: consider using `_color` instead [INFO] [stderr] [INFO] [stderr] warning: value assigned to `color` is never read [INFO] [stderr] --> src/algorithms/llrb_tree.rs:193:13 [INFO] [stderr] | [INFO] [stderr] 193 | color = Black; [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: unused variable: `val` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:98:17 [INFO] [stderr] | [INFO] [stderr] 98 | val, [INFO] [stderr] | ^^^ help: try ignoring the field: `val: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `v` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:50:13 [INFO] [stderr] | [INFO] [stderr] 50 | for v in 0..g.num_vertices { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stderr] [INFO] [stderr] warning: enum is never used: `BST` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:6:6 [INFO] [stderr] | [INFO] [stderr] 6 | enum BST { [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:21:12 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:31:12 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `size` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:41:12 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `put` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:50:12 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:78:12 [INFO] [stderr] | [INFO] [stderr] 78 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:97:12 [INFO] [stderr] | [INFO] [stderr] 97 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:112:12 [INFO] [stderr] | [INFO] [stderr] 112 | pub fn max(&self) -> Option<&V> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `keys` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:129:12 [INFO] [stderr] | [INFO] [stderr] 129 | pub fn keys(&self) -> LinkedQueue<&K> { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `values` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:140:12 [INFO] [stderr] | [INFO] [stderr] 140 | pub fn values(&self) -> LinkedQueue<&V> { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `inorder_keys` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:152:4 [INFO] [stderr] | [INFO] [stderr] 152 | fn inorder_keys<'a, K, V>(node: &'a BST, q: &RefCell<&mut LinkedQueue<&'a K>>) { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `inorder_values` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:167:4 [INFO] [stderr] | [INFO] [stderr] 167 | fn inorder_values<'a, K, V>(node: &'a BST, q: &RefCell<&mut LinkedQueue<&'a V>>) { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Red` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:7:5 [INFO] [stderr] | [INFO] [stderr] 7 | Red, [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: variant is never constructed: `Black` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:8:5 [INFO] [stderr] | [INFO] [stderr] 8 | Black, [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: enum is never used: `LLRBT` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:11:6 [INFO] [stderr] | [INFO] [stderr] 11 | enum LLRBT { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:27:12 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:40:12 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_red` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:50:12 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn is_red(&self) -> bool { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `size` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:63:12 [INFO] [stderr] | [INFO] [stderr] 63 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:72:12 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `put` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:91:12 [INFO] [stderr] | [INFO] [stderr] 91 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `min` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:134:12 [INFO] [stderr] | [INFO] [stderr] 134 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:149:12 [INFO] [stderr] | [INFO] [stderr] 149 | pub fn max(&self) -> Option<&V> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `flip_colors` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:165:4 [INFO] [stderr] | [INFO] [stderr] 165 | fn flip_colors<'a, K, V>(node: &'a mut LLRBT) [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `rotate_left` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:198:4 [INFO] [stderr] | [INFO] [stderr] 198 | fn rotate_left<'a, K, V>(parent: &'a mut LLRBT) [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `rotate_right` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:231:4 [INFO] [stderr] | [INFO] [stderr] 231 | fn rotate_right<'a, K, V>(parent: &'a mut LLRBT) [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `HashTable` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:6:8 [INFO] [stderr] | [INFO] [stderr] 6 | struct HashTable { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:15:12 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:26:12 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn get<'a>(&'a self, key: K) -> Option<&'a V> { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `put` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:40:12 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn put(&mut self, key: K, new_val: V) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `hash` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:55:8 [INFO] [stderr] | [INFO] [stderr] 55 | fn hash(&self, key: &K) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `UGraph` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | struct UGraph { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DFSPaths` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:8:8 [INFO] [stderr] | [INFO] [stderr] 8 | struct DFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:15:12 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn new(num_vertices: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_edge` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:28:12 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn add_edge(&mut self, v: usize, w: usize) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get_adj_edges` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:33:12 [INFO] [stderr] | [INFO] [stderr] 33 | pub fn get_adj_edges<'a>(&'a self, v: usize) -> &'a LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:37:12 [INFO] [stderr] | [INFO] [stderr] 37 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:43:12 [INFO] [stderr] | [INFO] [stderr] 43 | pub fn new(g: &UGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:60:12 [INFO] [stderr] | [INFO] [stderr] 60 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:64:12 [INFO] [stderr] | [INFO] [stderr] 64 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `dfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:82:8 [INFO] [stderr] | [INFO] [stderr] 82 | fn dfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: the type `std::boxed::Box>` does not permit being left uninitialized [INFO] [stderr] --> src/algorithms/llrb_tree.rs:213:31 [INFO] [stderr] | [INFO] [stderr] 213 | let uninit_node = MaybeUninit::>>::uninit().assume_init(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | this code causes undefined behavior when executed [INFO] [stderr] | help: use `MaybeUninit` instead, and only call `assume_init` after initialization is done [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(invalid_value)]` on by default [INFO] [stderr] = note: `Box` must be non-null [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:222:17 [INFO] [stderr] | [INFO] [stderr] 222 | replace(&mut color, parent_color.clone()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_must_use)]` on by default [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:223:17 [INFO] [stderr] | [INFO] [stderr] 223 | replace(parent_color, Red); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: the type `std::boxed::Box>` does not permit being left uninitialized [INFO] [stderr] --> src/algorithms/llrb_tree.rs:246:31 [INFO] [stderr] | [INFO] [stderr] 246 | let uninit_node = MaybeUninit::>>::uninit().assume_init(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | this code causes undefined behavior when executed [INFO] [stderr] | help: use `MaybeUninit` instead, and only call `assume_init` after initialization is done [INFO] [stderr] | [INFO] [stderr] = note: `Box` must be non-null [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:255:17 [INFO] [stderr] | [INFO] [stderr] 255 | replace(&mut color, parent_color.clone()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:256:17 [INFO] [stderr] | [INFO] [stderr] 256 | replace(parent_color, Red); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: variable `CUTOFF` should have a snake case name [INFO] [stderr] --> src/algorithms/sorting.rs:125:9 [INFO] [stderr] | [INFO] [stderr] 125 | let CUTOFF = 20; [INFO] [stderr] | ^^^^^^ help: convert the identifier to snake case: `cutoff` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_snake_case)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable `CUTOFF` should have a snake case name [INFO] [stderr] --> src/algorithms/sorting.rs:240:9 [INFO] [stderr] | [INFO] [stderr] 240 | let CUTOFF = 20; [INFO] [stderr] | ^^^^^^ help: convert the identifier to snake case: `cutoff` [INFO] [stderr] [INFO] [stderr] warning: 70 warnings emitted [INFO] [stderr] [INFO] [stderr] warning: unused variable: `val` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:57:17 [INFO] [stderr] | [INFO] [stderr] 57 | val, [INFO] [stderr] | ^^^ help: try ignoring the field: `val: _` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `key` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:102:20 [INFO] [stderr] | [INFO] [stderr] 102 | Node { key, val, left, .. } => { [INFO] [stderr] | ^^^ help: try ignoring the field: `key: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `key` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:118:17 [INFO] [stderr] | [INFO] [stderr] 118 | key, val, right, .. [INFO] [stderr] | ^^^ help: try ignoring the field: `key: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/algorithms/linked_list_queue.rs:166:13 [INFO] [stderr] | [INFO] [stderr] 166 | for i in 0..1000 { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/algorithms/linked_list_queue.rs:233:13 [INFO] [stderr] | [INFO] [stderr] 233 | for i in 0..25 { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `key` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:175:9 [INFO] [stderr] | [INFO] [stderr] 175 | key, [INFO] [stderr] | ^^^ help: try ignoring the field: `key: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `val` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:176:9 [INFO] [stderr] | [INFO] [stderr] 176 | val, [INFO] [stderr] | ^^^ help: try ignoring the field: `val: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `count` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:179:9 [INFO] [stderr] | [INFO] [stderr] 179 | count, [INFO] [stderr] | ^^^^^ help: try ignoring the field: `count: _` [INFO] [stderr] [INFO] [stderr] warning: variable `color` is assigned to, but never used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:188:23 [INFO] [stderr] | [INFO] [stderr] 188 | if let Node { mut color, .. } = **left { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: consider using `_color` instead [INFO] [stderr] [INFO] [stderr] warning: value assigned to `color` is never read [INFO] [stderr] --> src/algorithms/llrb_tree.rs:189:13 [INFO] [stderr] | [INFO] [stderr] 189 | color = Black; [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: variable `color` is assigned to, but never used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:192:23 [INFO] [stderr] | [INFO] [stderr] 192 | if let Node { mut color, .. } = **right { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: consider using `_color` instead [INFO] [stderr] [INFO] [stderr] warning: value assigned to `color` is never read [INFO] [stderr] --> src/algorithms/llrb_tree.rs:193:13 [INFO] [stderr] | [INFO] [stderr] 193 | color = Black; [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: unused variable: `val` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:98:17 [INFO] [stderr] | [INFO] [stderr] 98 | val, [INFO] [stderr] | ^^^ help: try ignoring the field: `val: _` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `v` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:50:13 [INFO] [stderr] | [INFO] [stderr] 50 | for v in 0..g.num_vertices { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::array_stack` [INFO] [stderr] --> src/main.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use rust_algorithms::algorithms::array_stack; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::connectivity_quick_find` [INFO] [stderr] --> src/main.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use rust_algorithms::algorithms::connectivity_quick_find; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::connectivity_quick_union` [INFO] [stderr] --> src/main.rs:3:5 [INFO] [stderr] | [INFO] [stderr] 3 | use rust_algorithms::algorithms::connectivity_quick_union; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::connectivity_quick_union_improved` [INFO] [stderr] --> src/main.rs:4:5 [INFO] [stderr] | [INFO] [stderr] 4 | use rust_algorithms::algorithms::connectivity_quick_union_improved; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::linked_list_stack` [INFO] [stderr] --> src/main.rs:5:5 [INFO] [stderr] | [INFO] [stderr] 5 | use rust_algorithms::algorithms::linked_list_stack; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:37:12 [INFO] [stderr] | [INFO] [stderr] 37 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::array_stack` [INFO] [stderr] --> src/main.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use rust_algorithms::algorithms::array_stack; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::connectivity_quick_find` [INFO] [stderr] --> src/main.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use rust_algorithms::algorithms::connectivity_quick_find; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::connectivity_quick_union` [INFO] [stderr] --> src/main.rs:3:5 [INFO] [stderr] | [INFO] [stderr] 3 | use rust_algorithms::algorithms::connectivity_quick_union; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::connectivity_quick_union_improved` [INFO] [stderr] --> src/main.rs:4:5 [INFO] [stderr] | [INFO] [stderr] 4 | use rust_algorithms::algorithms::connectivity_quick_union_improved; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algorithms::algorithms::linked_list_stack` [INFO] [stderr] --> src/main.rs:5:5 [INFO] [stderr] | [INFO] [stderr] 5 | use rust_algorithms::algorithms::linked_list_stack; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: the type `std::boxed::Box>` does not permit being left uninitialized [INFO] [stderr] --> src/algorithms/llrb_tree.rs:213:31 [INFO] [stderr] | [INFO] [stderr] 213 | let uninit_node = MaybeUninit::>>::uninit().assume_init(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | this code causes undefined behavior when executed [INFO] [stderr] | help: use `MaybeUninit` instead, and only call `assume_init` after initialization is done [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(invalid_value)]` on by default [INFO] [stderr] = note: `Box` must be non-null [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:222:17 [INFO] [stderr] | [INFO] [stderr] 222 | replace(&mut color, parent_color.clone()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_must_use)]` on by default [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:223:17 [INFO] [stderr] | [INFO] [stderr] 223 | replace(parent_color, Red); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: the type `std::boxed::Box>` does not permit being left uninitialized [INFO] [stderr] --> src/algorithms/llrb_tree.rs:246:31 [INFO] [stderr] | [INFO] [stderr] 246 | let uninit_node = MaybeUninit::>>::uninit().assume_init(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | this code causes undefined behavior when executed [INFO] [stderr] | help: use `MaybeUninit` instead, and only call `assume_init` after initialization is done [INFO] [stderr] | [INFO] [stderr] = note: `Box` must be non-null [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:255:17 [INFO] [stderr] | [INFO] [stderr] 255 | replace(&mut color, parent_color.clone()); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: unused return value of `std::mem::replace` that must be used [INFO] [stderr] --> src/algorithms/llrb_tree.rs:256:17 [INFO] [stderr] | [INFO] [stderr] 256 | replace(parent_color, Red); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: if you don't need the old value, you can just assign the new value directly [INFO] [stderr] [INFO] [stderr] warning: variable `CUTOFF` should have a snake case name [INFO] [stderr] --> src/algorithms/sorting.rs:125:9 [INFO] [stderr] | [INFO] [stderr] 125 | let CUTOFF = 20; [INFO] [stderr] | ^^^^^^ help: convert the identifier to snake case: `cutoff` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_snake_case)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable `CUTOFF` should have a snake case name [INFO] [stderr] --> src/algorithms/sorting.rs:240:9 [INFO] [stderr] | [INFO] [stderr] 240 | let CUTOFF = 20; [INFO] [stderr] | ^^^^^^ help: convert the identifier to snake case: `cutoff` [INFO] [stderr] [INFO] [stderr] warning: 5 warnings emitted [INFO] [stderr] [INFO] [stderr] warning: 5 warnings emitted [INFO] [stderr] [INFO] [stderr] warning: 36 warnings emitted [INFO] [stderr] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 5.83s [INFO] running `"docker" "inspect" "5be4f21325ddb446ae17e0bdd3fcbe4eddda67d1648d848bebb9abf838e3a928"` [INFO] running `"docker" "rm" "-f" "5be4f21325ddb446ae17e0bdd3fcbe4eddda67d1648d848bebb9abf838e3a928"` [INFO] [stdout] 5be4f21325ddb446ae17e0bdd3fcbe4eddda67d1648d848bebb9abf838e3a928