[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] running `"git" "rev-parse" "HEAD"` [INFO] [stdout] 9ba901447f9afdac40dd4ea4db018b1f3ca63f0d [INFO] testing sebashack/rust_algorithms against 1.44.0 for beta-1.45-1 [INFO] running `"git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsebashack%2Frust_algorithms" "/workspace/builds/worker-13/source"` [INFO] [stderr] Cloning into '/workspace/builds/worker-13/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/sebashack/rust_algorithms on toolchain 1.44.0 [INFO] running `"/workspace/cargo-home/bin/cargo" "+1.44.0" "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-13/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" "+1.44.0" "fetch" "--locked" "--manifest-path" "Cargo.toml"` [INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/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=warn" "-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" "+1.44.0" "build" "--frozen"` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] 52494ca2797fdb01b5e141b1b5b25b887a62320e87d136bbc415456ccfd00b56 [INFO] running `"docker" "start" "-a" "52494ca2797fdb01b5e141b1b5b25b887a62320e87d136bbc415456ccfd00b56"` [INFO] [stderr] sudo: setrlimit(RLIMIT_CORE): Operation not permitted [INFO] [stderr] Compiling rand_chacha v0.2.1 [INFO] [stderr] Compiling rand v0.7.3 [INFO] [stderr] Compiling 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 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: `v` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:35 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [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:137:35 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `size` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:78:5 [INFO] [stderr] | [INFO] [stderr] 78 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `min` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:97:5 [INFO] [stderr] | [INFO] [stderr] 97 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `max` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:112:5 [INFO] [stderr] | [INFO] [stderr] 112 | pub fn max(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `keys` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:129:5 [INFO] [stderr] | [INFO] [stderr] 129 | pub fn keys(&self) -> LinkedQueue<&K> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `values` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:140:5 [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: struct is never constructed: `DGraph` [INFO] [stderr] --> src/algorithms/directed_graph.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | struct DGraph { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DFSPaths` [INFO] [stderr] --> src/algorithms/directed_graph.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | struct DFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `BFSPaths` [INFO] [stderr] --> src/algorithms/directed_graph.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | struct BFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `TopologicalSort` [INFO] [stderr] --> src/algorithms/directed_graph.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct TopologicalSort { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DirectedCycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:26:8 [INFO] [stderr] | [INFO] [stderr] 26 | struct DirectedCycle { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `KosarajuSharirSCC` [INFO] [stderr] --> src/algorithms/directed_graph.rs:33:8 [INFO] [stderr] | [INFO] [stderr] 33 | struct KosarajuSharirSCC { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn new(num_vertices: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `add_edge` [INFO] [stderr] --> src/algorithms/directed_graph.rs:53:5 [INFO] [stderr] | [INFO] [stderr] 53 | pub fn add_edge(&mut self, v: usize, w: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges` [INFO] [stderr] --> src/algorithms/directed_graph.rs:57:5 [INFO] [stderr] | [INFO] [stderr] 57 | pub fn get_adj_edges<'a>(&'a self, v: usize) -> &'a LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:61:5 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse` [INFO] [stderr] --> src/algorithms/directed_graph.rs:65:5 [INFO] [stderr] | [INFO] [stderr] 65 | pub fn reverse(&self) -> DGraph { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:86:5 [INFO] [stderr] | [INFO] [stderr] 86 | pub fn new(g: &DGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:98:5 [INFO] [stderr] | [INFO] [stderr] 98 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:102:5 [INFO] [stderr] | [INFO] [stderr] 102 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:120:5 [INFO] [stderr] | [INFO] [stderr] 120 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:133:5 [INFO] [stderr] | [INFO] [stderr] 133 | pub fn new(g: &DGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:145:5 [INFO] [stderr] | [INFO] [stderr] 145 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:149:5 [INFO] [stderr] | [INFO] [stderr] 149 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `bfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:5 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:188:5 [INFO] [stderr] | [INFO] [stderr] 188 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse_post` [INFO] [stderr] --> src/algorithms/directed_graph.rs:203:5 [INFO] [stderr] | [INFO] [stderr] 203 | pub fn reverse_post(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse_post_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:207:5 [INFO] [stderr] | [INFO] [stderr] 207 | pub fn reverse_post_mut(&mut self) -> &mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:211:5 [INFO] [stderr] | [INFO] [stderr] 211 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:225:5 [INFO] [stderr] | [INFO] [stderr] 225 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:244:5 [INFO] [stderr] | [INFO] [stderr] 244 | pub fn has_cycle(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:248:5 [INFO] [stderr] | [INFO] [stderr] 248 | pub fn cycle(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:252:5 [INFO] [stderr] | [INFO] [stderr] 252 | pub fn cycle_mut(&mut self) -> &mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:256:5 [INFO] [stderr] | [INFO] [stderr] 256 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:285:5 [INFO] [stderr] | [INFO] [stderr] 285 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/directed_graph.rs:304:5 [INFO] [stderr] | [INFO] [stderr] 304 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `strongly_connected` [INFO] [stderr] --> src/algorithms/directed_graph.rs:308:5 [INFO] [stderr] | [INFO] [stderr] 308 | pub fn strongly_connected(&self, v: usize, w: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:312:5 [INFO] [stderr] | [INFO] [stderr] 312 | fn dfs(&mut self, g: &DGraph, v: usize) { [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_red` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn is_red(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `size` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:63:5 [INFO] [stderr] | [INFO] [stderr] 63 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:72:5 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:91:5 [INFO] [stderr] | [INFO] [stderr] 91 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `min` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:134:5 [INFO] [stderr] | [INFO] [stderr] 134 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `max` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:149:5 [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:15:5 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn new() -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn get<'a>(&'a self, key: K) -> Option<&'a V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn put(&mut self, key: K, new_val: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `hash` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:55:5 [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:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | struct UGraph { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DFSPaths` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | struct DFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `BFSPaths` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | struct BFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `ConnectedComponents` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct ConnectedComponents { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:28:5 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn new(num_vertices: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `add_edge` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn add_edge(&mut self, v: usize, w: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:46:5 [INFO] [stderr] | [INFO] [stderr] 46 | pub fn get_adj_edges<'a>(&'a self, v: usize) -> &'a LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:56:5 [INFO] [stderr] | [INFO] [stderr] 56 | pub fn new(g: &UGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:68:5 [INFO] [stderr] | [INFO] [stderr] 68 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:72:5 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:90:5 [INFO] [stderr] | [INFO] [stderr] 90 | fn dfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:103:5 [INFO] [stderr] | [INFO] [stderr] 103 | pub fn new(g: &UGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:115:5 [INFO] [stderr] | [INFO] [stderr] 115 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:119:5 [INFO] [stderr] | [INFO] [stderr] 119 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `bfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:137:5 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:158:5 [INFO] [stderr] | [INFO] [stderr] 158 | pub fn new(g: &UGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:175:5 [INFO] [stderr] | [INFO] [stderr] 175 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:179:5 [INFO] [stderr] | [INFO] [stderr] 179 | 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: 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: 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: 108 warnings emitted [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: 5 warnings emitted [INFO] [stderr] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 2.81s [INFO] running `"docker" "inspect" "52494ca2797fdb01b5e141b1b5b25b887a62320e87d136bbc415456ccfd00b56"` [INFO] running `"docker" "rm" "-f" "52494ca2797fdb01b5e141b1b5b25b887a62320e87d136bbc415456ccfd00b56"` [INFO] [stdout] 52494ca2797fdb01b5e141b1b5b25b887a62320e87d136bbc415456ccfd00b56 [INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/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=warn" "-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" "+1.44.0" "test" "--frozen" "--no-run"` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] 813f702bb4d465ce794f71154ae92a76b800fcb426d461275ee10b9d729b8fb1 [INFO] running `"docker" "start" "-a" "813f702bb4d465ce794f71154ae92a76b800fcb426d461275ee10b9d729b8fb1"` [INFO] [stderr] sudo: setrlimit(RLIMIT_CORE): Operation not permitted [INFO] [stderr] Compiling 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 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: `v` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:35 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [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:137:35 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `size` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:78:5 [INFO] [stderr] | [INFO] [stderr] 78 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `min` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:97:5 [INFO] [stderr] | [INFO] [stderr] 97 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `max` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:112:5 [INFO] [stderr] | [INFO] [stderr] 112 | pub fn max(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `keys` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:129:5 [INFO] [stderr] | [INFO] [stderr] 129 | pub fn keys(&self) -> LinkedQueue<&K> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `values` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:140:5 [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: struct is never constructed: `DGraph` [INFO] [stderr] --> src/algorithms/directed_graph.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | struct DGraph { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DFSPaths` [INFO] [stderr] --> src/algorithms/directed_graph.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | struct DFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `BFSPaths` [INFO] [stderr] --> src/algorithms/directed_graph.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | struct BFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `TopologicalSort` [INFO] [stderr] --> src/algorithms/directed_graph.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct TopologicalSort { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DirectedCycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:26:8 [INFO] [stderr] | [INFO] [stderr] 26 | struct DirectedCycle { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `KosarajuSharirSCC` [INFO] [stderr] --> src/algorithms/directed_graph.rs:33:8 [INFO] [stderr] | [INFO] [stderr] 33 | struct KosarajuSharirSCC { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn new(num_vertices: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `add_edge` [INFO] [stderr] --> src/algorithms/directed_graph.rs:53:5 [INFO] [stderr] | [INFO] [stderr] 53 | pub fn add_edge(&mut self, v: usize, w: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges` [INFO] [stderr] --> src/algorithms/directed_graph.rs:57:5 [INFO] [stderr] | [INFO] [stderr] 57 | pub fn get_adj_edges<'a>(&'a self, v: usize) -> &'a LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:61:5 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse` [INFO] [stderr] --> src/algorithms/directed_graph.rs:65:5 [INFO] [stderr] | [INFO] [stderr] 65 | pub fn reverse(&self) -> DGraph { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:86:5 [INFO] [stderr] | [INFO] [stderr] 86 | pub fn new(g: &DGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:98:5 [INFO] [stderr] | [INFO] [stderr] 98 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:102:5 [INFO] [stderr] | [INFO] [stderr] 102 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:120:5 [INFO] [stderr] | [INFO] [stderr] 120 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:133:5 [INFO] [stderr] | [INFO] [stderr] 133 | pub fn new(g: &DGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:145:5 [INFO] [stderr] | [INFO] [stderr] 145 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:149:5 [INFO] [stderr] | [INFO] [stderr] 149 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `bfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:5 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:188:5 [INFO] [stderr] | [INFO] [stderr] 188 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse_post` [INFO] [stderr] --> src/algorithms/directed_graph.rs:203:5 [INFO] [stderr] | [INFO] [stderr] 203 | pub fn reverse_post(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse_post_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:207:5 [INFO] [stderr] | [INFO] [stderr] 207 | pub fn reverse_post_mut(&mut self) -> &mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:211:5 [INFO] [stderr] | [INFO] [stderr] 211 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:225:5 [INFO] [stderr] | [INFO] [stderr] 225 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:244:5 [INFO] [stderr] | [INFO] [stderr] 244 | pub fn has_cycle(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:248:5 [INFO] [stderr] | [INFO] [stderr] 248 | pub fn cycle(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:252:5 [INFO] [stderr] | [INFO] [stderr] 252 | pub fn cycle_mut(&mut self) -> &mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:256:5 [INFO] [stderr] | [INFO] [stderr] 256 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:285:5 [INFO] [stderr] | [INFO] [stderr] 285 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/directed_graph.rs:304:5 [INFO] [stderr] | [INFO] [stderr] 304 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `strongly_connected` [INFO] [stderr] --> src/algorithms/directed_graph.rs:308:5 [INFO] [stderr] | [INFO] [stderr] 308 | pub fn strongly_connected(&self, v: usize, w: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:312:5 [INFO] [stderr] | [INFO] [stderr] 312 | fn dfs(&mut self, g: &DGraph, v: usize) { [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_red` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn is_red(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `size` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:63:5 [INFO] [stderr] | [INFO] [stderr] 63 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:72:5 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:91:5 [INFO] [stderr] | [INFO] [stderr] 91 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `min` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:134:5 [INFO] [stderr] | [INFO] [stderr] 134 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `max` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:149:5 [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:15:5 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn new() -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn get<'a>(&'a self, key: K) -> Option<&'a V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn put(&mut self, key: K, new_val: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `hash` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:55:5 [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:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | struct UGraph { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DFSPaths` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | struct DFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `BFSPaths` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | struct BFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `ConnectedComponents` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct ConnectedComponents { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:28:5 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn new(num_vertices: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `add_edge` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn add_edge(&mut self, v: usize, w: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:46:5 [INFO] [stderr] | [INFO] [stderr] 46 | pub fn get_adj_edges<'a>(&'a self, v: usize) -> &'a LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:56:5 [INFO] [stderr] | [INFO] [stderr] 56 | pub fn new(g: &UGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:68:5 [INFO] [stderr] | [INFO] [stderr] 68 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:72:5 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:90:5 [INFO] [stderr] | [INFO] [stderr] 90 | fn dfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:103:5 [INFO] [stderr] | [INFO] [stderr] 103 | pub fn new(g: &UGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:115:5 [INFO] [stderr] | [INFO] [stderr] 115 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:119:5 [INFO] [stderr] | [INFO] [stderr] 119 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `bfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:137:5 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:158:5 [INFO] [stderr] | [INFO] [stderr] 158 | pub fn new(g: &UGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:175:5 [INFO] [stderr] | [INFO] [stderr] 175 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:179:5 [INFO] [stderr] | [INFO] [stderr] 179 | 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: 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: 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: 108 warnings emitted [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: 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::LinkedStack` [INFO] [stderr] --> src/algorithms/directed_graph.rs:329:9 [INFO] [stderr] | [INFO] [stderr] 329 | use crate::algorithms::linked_list_stack::LinkedStack; [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: 5 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: `v` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:35 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [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:137:35 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/directed_graph.rs:456:13 [INFO] [stderr] | [INFO] [stderr] 456 | let mut sorting = paths.reverse_post_mut(); [INFO] [stderr] | ----^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/directed_graph.rs:496:13 [INFO] [stderr] | [INFO] [stderr] 496 | let mut c = paths.cycle_mut(); [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/algorithms/directed_graph.rs:530:13 [INFO] [stderr] | [INFO] [stderr] 530 | let mut cc = KosarajuSharirSCC::new(&g); [INFO] [stderr] | ----^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: field is never read: `origin` [INFO] [stderr] --> src/algorithms/directed_graph.rs:12:5 [INFO] [stderr] | [INFO] [stderr] 12 | origin: usize, [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:61:5 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:102:5 [INFO] [stderr] | [INFO] [stderr] 102 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:149:5 [INFO] [stderr] | [INFO] [stderr] 149 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:248:5 [INFO] [stderr] | [INFO] [stderr] 248 | pub fn cycle(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/directed_graph.rs:304:5 [INFO] [stderr] | [INFO] [stderr] 304 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [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: 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: 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: 43 warnings emitted [INFO] [stderr] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 1.92s [INFO] running `"docker" "inspect" "813f702bb4d465ce794f71154ae92a76b800fcb426d461275ee10b9d729b8fb1"` [INFO] running `"docker" "rm" "-f" "813f702bb4d465ce794f71154ae92a76b800fcb426d461275ee10b9d729b8fb1"` [INFO] [stdout] 813f702bb4d465ce794f71154ae92a76b800fcb426d461275ee10b9d729b8fb1 [INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/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=warn" "-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" "+1.44.0" "test" "--frozen"` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] e441fea6c1bac20c6baa35987e3109dada8948bda9f46317aa4f4082ae598868 [INFO] running `"docker" "start" "-a" "e441fea6c1bac20c6baa35987e3109dada8948bda9f46317aa4f4082ae598868"` [INFO] [stderr] sudo: setrlimit(RLIMIT_CORE): Operation not permitted [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 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: `v` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:35 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [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:137:35 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `size` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:78:5 [INFO] [stderr] | [INFO] [stderr] 78 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `min` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:97:5 [INFO] [stderr] | [INFO] [stderr] 97 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `max` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:112:5 [INFO] [stderr] | [INFO] [stderr] 112 | pub fn max(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `keys` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:129:5 [INFO] [stderr] | [INFO] [stderr] 129 | pub fn keys(&self) -> LinkedQueue<&K> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `values` [INFO] [stderr] --> src/algorithms/binary_search_tree.rs:140:5 [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: struct is never constructed: `DGraph` [INFO] [stderr] --> src/algorithms/directed_graph.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | struct DGraph { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DFSPaths` [INFO] [stderr] --> src/algorithms/directed_graph.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | struct DFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `BFSPaths` [INFO] [stderr] --> src/algorithms/directed_graph.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | struct BFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `TopologicalSort` [INFO] [stderr] --> src/algorithms/directed_graph.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct TopologicalSort { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DirectedCycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:26:8 [INFO] [stderr] | [INFO] [stderr] 26 | struct DirectedCycle { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `KosarajuSharirSCC` [INFO] [stderr] --> src/algorithms/directed_graph.rs:33:8 [INFO] [stderr] | [INFO] [stderr] 33 | struct KosarajuSharirSCC { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn new(num_vertices: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `add_edge` [INFO] [stderr] --> src/algorithms/directed_graph.rs:53:5 [INFO] [stderr] | [INFO] [stderr] 53 | pub fn add_edge(&mut self, v: usize, w: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges` [INFO] [stderr] --> src/algorithms/directed_graph.rs:57:5 [INFO] [stderr] | [INFO] [stderr] 57 | pub fn get_adj_edges<'a>(&'a self, v: usize) -> &'a LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:61:5 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse` [INFO] [stderr] --> src/algorithms/directed_graph.rs:65:5 [INFO] [stderr] | [INFO] [stderr] 65 | pub fn reverse(&self) -> DGraph { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:86:5 [INFO] [stderr] | [INFO] [stderr] 86 | pub fn new(g: &DGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:98:5 [INFO] [stderr] | [INFO] [stderr] 98 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:102:5 [INFO] [stderr] | [INFO] [stderr] 102 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:120:5 [INFO] [stderr] | [INFO] [stderr] 120 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:133:5 [INFO] [stderr] | [INFO] [stderr] 133 | pub fn new(g: &DGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:145:5 [INFO] [stderr] | [INFO] [stderr] 145 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:149:5 [INFO] [stderr] | [INFO] [stderr] 149 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `bfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:5 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:188:5 [INFO] [stderr] | [INFO] [stderr] 188 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse_post` [INFO] [stderr] --> src/algorithms/directed_graph.rs:203:5 [INFO] [stderr] | [INFO] [stderr] 203 | pub fn reverse_post(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `reverse_post_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:207:5 [INFO] [stderr] | [INFO] [stderr] 207 | pub fn reverse_post_mut(&mut self) -> &mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:211:5 [INFO] [stderr] | [INFO] [stderr] 211 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:225:5 [INFO] [stderr] | [INFO] [stderr] 225 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:244:5 [INFO] [stderr] | [INFO] [stderr] 244 | pub fn has_cycle(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:248:5 [INFO] [stderr] | [INFO] [stderr] 248 | pub fn cycle(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:252:5 [INFO] [stderr] | [INFO] [stderr] 252 | pub fn cycle_mut(&mut self) -> &mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:256:5 [INFO] [stderr] | [INFO] [stderr] 256 | fn dfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/directed_graph.rs:285:5 [INFO] [stderr] | [INFO] [stderr] 285 | pub fn new(g: &DGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/directed_graph.rs:304:5 [INFO] [stderr] | [INFO] [stderr] 304 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `strongly_connected` [INFO] [stderr] --> src/algorithms/directed_graph.rs:308:5 [INFO] [stderr] | [INFO] [stderr] 308 | pub fn strongly_connected(&self, v: usize, w: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/directed_graph.rs:312:5 [INFO] [stderr] | [INFO] [stderr] 312 | fn dfs(&mut self, g: &DGraph, v: usize) { [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn new(key: K, val: V) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_leaf` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn is_leaf(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `is_red` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn is_red(&self) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `size` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:63:5 [INFO] [stderr] | [INFO] [stderr] 63 | pub fn size(&self) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:72:5 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn get(&self, k: K) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:91:5 [INFO] [stderr] | [INFO] [stderr] 91 | pub fn put(&mut self, k: K, v: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `min` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:134:5 [INFO] [stderr] | [INFO] [stderr] 134 | pub fn min(&self) -> Option<&V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `max` [INFO] [stderr] --> src/algorithms/llrb_tree.rs:149:5 [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: method is never used: `new` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:15:5 [INFO] [stderr] | [INFO] [stderr] 15 | pub fn new() -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn get<'a>(&'a self, key: K) -> Option<&'a V> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `put` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn put(&mut self, key: K, new_val: V) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `hash` [INFO] [stderr] --> src/algorithms/separate_chainining_hash_table.rs:55:5 [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:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | struct UGraph { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DFSPaths` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | struct DFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `BFSPaths` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:15:8 [INFO] [stderr] | [INFO] [stderr] 15 | struct BFSPaths { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `ConnectedComponents` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:21:8 [INFO] [stderr] | [INFO] [stderr] 21 | struct ConnectedComponents { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:28:5 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn new(num_vertices: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `add_edge` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:41:5 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn add_edge(&mut self, v: usize, w: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:46:5 [INFO] [stderr] | [INFO] [stderr] 46 | pub fn get_adj_edges<'a>(&'a self, v: usize) -> &'a LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:56:5 [INFO] [stderr] | [INFO] [stderr] 56 | pub fn new(g: &UGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:68:5 [INFO] [stderr] | [INFO] [stderr] 68 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:72:5 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:90:5 [INFO] [stderr] | [INFO] [stderr] 90 | fn dfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:103:5 [INFO] [stderr] | [INFO] [stderr] 103 | pub fn new(g: &UGraph, origin: usize) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `has_path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:115:5 [INFO] [stderr] | [INFO] [stderr] 115 | pub fn has_path_to(&self, v: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:119:5 [INFO] [stderr] | [INFO] [stderr] 119 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `bfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:137:5 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `new` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:158:5 [INFO] [stderr] | [INFO] [stderr] 158 | pub fn new(g: &UGraph) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:175:5 [INFO] [stderr] | [INFO] [stderr] 175 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `dfs` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:179:5 [INFO] [stderr] | [INFO] [stderr] 179 | 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: 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: 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: 108 warnings emitted [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::LinkedStack` [INFO] [stderr] --> src/algorithms/directed_graph.rs:329:9 [INFO] [stderr] | [INFO] [stderr] 329 | use crate::algorithms::linked_list_stack::LinkedStack; [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: `v` [INFO] [stderr] --> src/algorithms/directed_graph.rs:167:35 [INFO] [stderr] | [INFO] [stderr] 167 | fn bfs(&mut self, g: &DGraph, v: usize) { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [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:137:35 [INFO] [stderr] | [INFO] [stderr] 137 | fn bfs(&mut self, g: &UGraph, v: usize) { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/directed_graph.rs:456:13 [INFO] [stderr] | [INFO] [stderr] 456 | let mut sorting = paths.reverse_post_mut(); [INFO] [stderr] | ----^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/directed_graph.rs:496:13 [INFO] [stderr] | [INFO] [stderr] 496 | let mut c = paths.cycle_mut(); [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/algorithms/directed_graph.rs:530:13 [INFO] [stderr] | [INFO] [stderr] 530 | let mut cc = KosarajuSharirSCC::new(&g); [INFO] [stderr] | ----^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: field is never read: `origin` [INFO] [stderr] --> src/algorithms/directed_graph.rs:12:5 [INFO] [stderr] | [INFO] [stderr] 12 | origin: usize, [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/directed_graph.rs:61:5 [INFO] [stderr] | [INFO] [stderr] 61 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:102:5 [INFO] [stderr] | [INFO] [stderr] 102 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `path_to` [INFO] [stderr] --> src/algorithms/directed_graph.rs:149:5 [INFO] [stderr] | [INFO] [stderr] 149 | pub fn path_to(&self, v: usize) -> Option> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `cycle` [INFO] [stderr] --> src/algorithms/directed_graph.rs:248:5 [INFO] [stderr] | [INFO] [stderr] 248 | pub fn cycle(&self) -> &LinkedStack { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `id` [INFO] [stderr] --> src/algorithms/directed_graph.rs:304:5 [INFO] [stderr] | [INFO] [stderr] 304 | pub fn id(&self, v: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method is never used: `get_adj_edges_mut` [INFO] [stderr] --> src/algorithms/undirected_graph.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 50 | pub fn get_adj_edges_mut<'a>(&'a mut self, v: usize) -> &'a mut LinkedStack { [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: 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: 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: 43 warnings emitted [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: 5 warnings emitted [INFO] [stderr] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.08s [INFO] [stderr] Running /opt/rustwide/target/debug/deps/rust_algorithms-940e77897479f48d [INFO] [stdout] [INFO] [stdout] running 36 tests [INFO] [stdout] test algorithms::array_stack::tests::iter_should_traverse_the_stack_without_consuming_it ... ok [INFO] [stdout] test algorithms::array_stack::tests::iter_should_traverse_the_stack_while_mutating_it ... ok [INFO] [stdout] test algorithms::directed_graph::tests::it_creates_topological_sort_on_gad ... ok [INFO] [stdout] test algorithms::directed_graph::tests::bfs_interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::array_stack::tests::into_iter_should_consume_the_stack ... ok [INFO] [stdout] test algorithms::directed_graph::tests::dfs_interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::connectivity_quick_union::tests::correctly_determines_connections ... ok [INFO] [stdout] test algorithms::binary_search_tree::tests::retrives_keys_with_inorder_ordering ... ok [INFO] [stdout] test algorithms::binary_search_tree::tests::interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::connectivity_quick_find::tests::correctly_determines_connections ... ok [INFO] [stdout] test algorithms::connectivity_quick_union_improved::tests::correctly_determines_connections ... ok [INFO] [stdout] test algorithms::binary_search_tree::tests::retrives_values_with_inorder_ordering ... ok [INFO] [stdout] test algorithms::array_stack::tests::interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::directed_graph::tests::it_detects_directed_cycles ... ok [INFO] [stdout] test algorithms::directed_graph::tests::it_strongly_connected_components ... ok [INFO] [stdout] test algorithms::priority_queue::tests::interface_operations_for_min_priority_queue_should_work_as_expected ... ok [INFO] [stdout] test algorithms::sorting::tests::insertion_sort_by_should_sort_the_vector ... ok [INFO] [stdout] test algorithms::linked_list_stack::tests::iter_should_traverse_the_stack_while_mutating_it ... ok [INFO] [stdout] test algorithms::linked_list_queue::tests::iter_should_traverse_the_queue_while_mutating_it ... ok [INFO] [stdout] test algorithms::linked_list_queue::tests::into_iter_should_consume_the_queue ... ok [INFO] [stdout] test algorithms::priority_queue::tests::interface_operations_for_max_priority_queue_should_work_as_expected ... ok [INFO] [stdout] test algorithms::linked_list_queue::tests::iter_should_traverse_the_queue_without_consuming_it ... ok [INFO] [stdout] test algorithms::linked_list_stack::tests::iter_should_traverse_the_stack_without_consuming_it ... ok [INFO] [stdout] test algorithms::linked_list_stack::tests::interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::linked_list_stack::tests::into_iter_should_consume_the_stack ... ok [INFO] [stdout] test algorithms::sorting::tests::selection_sort_by_should_sort_the_vector ... ok [INFO] [stdout] test algorithms::llrb_tree::tests::interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::separate_chainining_hash_table::tests::interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::linked_list_queue::tests::interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::undirected_graph::tests::bfs_interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::undirected_graph::tests::cc_interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::undirected_graph::tests::dfs_interface_operations_should_work_as_expected ... ok [INFO] [stdout] test algorithms::sorting::tests::quick_sort_by_should_sort_the_vector ... ok [INFO] [stdout] test algorithms::sorting::tests::shell_sort_by_should_sort_the_vector ... ok [INFO] [stdout] test algorithms::sorting::tests::bottom_up_merge_sort_by_should_sort_the_vector ... ok [INFO] [stderr] Running /opt/rustwide/target/debug/deps/rust_algorithms-b5e73ed825414335 [INFO] [stdout] test algorithms::sorting::tests::merge_sort_by_should_sort_the_vector ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 36 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out [INFO] [stdout] [INFO] [stderr] Doc-tests rust_algorithms [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out [INFO] [stdout] [INFO] running `"docker" "inspect" "e441fea6c1bac20c6baa35987e3109dada8948bda9f46317aa4f4082ae598868"` [INFO] running `"docker" "rm" "-f" "e441fea6c1bac20c6baa35987e3109dada8948bda9f46317aa4f4082ae598868"` [INFO] [stdout] e441fea6c1bac20c6baa35987e3109dada8948bda9f46317aa4f4082ae598868