[INFO] cloning repository https://github.com/GrossBetruger/CrackingTheJobInterview [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/GrossBetruger/CrackingTheJobInterview" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FGrossBetruger%2FCrackingTheJobInterview", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FGrossBetruger%2FCrackingTheJobInterview'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] fc7fbe747672dc0353627501661d3eb77919bb21 [INFO] checking GrossBetruger/CrackingTheJobInterview against try#a7a572ce3edd6d476191fbfe92c9c1986e009b34 for pr-87190-3 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FGrossBetruger%2FCrackingTheJobInterview" "/workspace/builds/worker-5/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-5/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/GrossBetruger/CrackingTheJobInterview on toolchain a7a572ce3edd6d476191fbfe92c9c1986e009b34 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/GrossBetruger/CrackingTheJobInterview [INFO] finished tweaking git repo https://github.com/GrossBetruger/CrackingTheJobInterview [INFO] tweaked toml for git repo https://github.com/GrossBetruger/CrackingTheJobInterview written to /workspace/builds/worker-5/source/Cargo.toml [INFO] crate git repo https://github.com/GrossBetruger/CrackingTheJobInterview already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded counter v0.5.2 [INFO] [stderr] Downloaded queues v1.1.0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:34b6a614d2c27851fe6cbf88fbd1137609cefab8b10d0615aaeb6fd47975d74e" "/opt/rustwide/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 373bad3fdd875d1d3bc6be01aca701aeff21290ef0c33db72dcfbefadd3e60d5 [INFO] running `Command { std: "docker" "start" "-a" "373bad3fdd875d1d3bc6be01aca701aeff21290ef0c33db72dcfbefadd3e60d5", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "373bad3fdd875d1d3bc6be01aca701aeff21290ef0c33db72dcfbefadd3e60d5", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "373bad3fdd875d1d3bc6be01aca701aeff21290ef0c33db72dcfbefadd3e60d5", kill_on_drop: false }` [INFO] [stdout] 373bad3fdd875d1d3bc6be01aca701aeff21290ef0c33db72dcfbefadd3e60d5 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:34b6a614d2c27851fe6cbf88fbd1137609cefab8b10d0615aaeb6fd47975d74e" "/opt/rustwide/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] d4e44c32a76c888861d824a4559d6425ded7d9ba971b1b3ffd3a66f6f9f0d300 [INFO] running `Command { std: "docker" "start" "-a" "d4e44c32a76c888861d824a4559d6425ded7d9ba971b1b3ffd3a66f6f9f0d300", kill_on_drop: false }` [INFO] [stderr] Copying to /tmp/fixit [INFO] [stderr] Running `cargo fix --edition` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Checking fixedbitset v0.2.0 [INFO] [stderr] Checking queues v1.1.0 [INFO] [stderr] Compiling num-traits v0.2.14 [INFO] [stderr] Compiling indexmap v1.6.2 [INFO] [stderr] Checking itertools v0.9.0 [INFO] [stderr] Checking petgraph v0.5.1 [INFO] [stderr] Checking counter v0.5.2 [INFO] [stderr] Checking cracking_the_job_interview v0.1.0 (/tmp/fixit) [INFO] [stderr] Migrating src/main.rs from 2018 edition to 2021 [INFO] [stderr] Fixed src/linked_lists.rs (1 fix) [INFO] [stderr] Fixed src/naive_bayes.rs (2 fixes) [INFO] [stderr] Fixed src/graphs.rs (3 fixes) [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> src/trees_and_graphs.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BinaryNode` [INFO] [stdout] --> src/trees_and_graphs.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct BinaryNode { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Tree` [INFO] [stdout] --> src/trees_and_graphs.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BinaryTree` [INFO] [stdout] --> src/trees_and_graphs.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn new(data: T, left: Box>>, right: Box>>) [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn new(root: BinaryNode) -> BinaryTree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new(data: T, children: Vec>) -> Node { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `leaf_node` [INFO] [stdout] --> src/trees_and_graphs.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn leaf_node(data: T) -> Node { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn new(root: Node) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `traverse_node_in_order` [INFO] [stdout] --> src/trees_and_graphs.rs:65:4 [INFO] [stdout] | [INFO] [stdout] 65 | fn traverse_node_in_order(node: &Node){ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `handle_neighbors` [INFO] [stdout] --> src/graphs.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn handle_neighbors(queue: & mut Queue, visited: &HashSet, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `search_path` [INFO] [stdout] --> src/graphs.rs:19:4 [INFO] [stdout] | [INFO] [stdout] 19 | fn search_path(graph: Graph<&str, u32>, from: NodeIndex, to: NodeIndex) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `ALPHA` [INFO] [stdout] --> src/naive_bayes.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | const ALPHA: f64 = 1.; // count added to missing words to avoid probability 0.0 [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `NaiveBayes` [INFO] [stdout] --> src/naive_bayes.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct NaiveBayes { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `NaiveBayesParameters` [INFO] [stdout] --> src/naive_bayes.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct NaiveBayesParameters { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Probabilities` [INFO] [stdout] --> src/naive_bayes.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Probabilities { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `empty` [INFO] [stdout] --> src/naive_bayes.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn empty() -> Probabilities { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `train` [INFO] [stdout] --> src/naive_bayes.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn train(&mut self, x: Vec<&str>, y: Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `predict` [INFO] [stdout] --> src/naive_bayes.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn predict(&self, text: &str) -> u16 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/naive_bayes.rs:91:12 [INFO] [stdout] | [INFO] [stdout] 91 | pub fn new() -> NaiveBayes { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `is_unique` [INFO] [stdout] --> src/main.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn is_unique(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `check_permutation` [INFO] [stdout] --> src/main.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn check_permutation(s1: &str, s2: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `palindrome_permutation` [INFO] [stdout] --> src/main.rs:60:4 [INFO] [stdout] | [INFO] [stdout] 60 | fn palindrome_permutation(s: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `one_away` [INFO] [stdout] --> src/main.rs:78:4 [INFO] [stdout] | [INFO] [stdout] 78 | fn one_away(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `compare_with_one_change` [INFO] [stdout] --> src/main.rs:98:4 [INFO] [stdout] | [INFO] [stdout] 98 | fn compare_with_one_change(s1: &str, s2: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `string_compression` [INFO] [stdout] --> src/main.rs:131:4 [INFO] [stdout] | [INFO] [stdout] 131 | fn string_compression(s: &str) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_counter` [INFO] [stdout] --> src/main.rs:160:4 [INFO] [stdout] | [INFO] [stdout] 160 | fn push_counter(counter: usize, char_vec: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rotate_matrix` [INFO] [stdout] --> src/main.rs:169:4 [INFO] [stdout] | [INFO] [stdout] 169 | fn rotate_matrix(matrix: Vec>) -> Vec>{ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graphs.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | queue.add(neighbor.clone()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 29 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Fixed src/linked_lists.rs (1 fix) [INFO] [stderr] Fixed src/trees_and_graphs.rs (2 fixes) [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> src/trees_and_graphs.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `right` [INFO] [stdout] --> src/trees_and_graphs.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | pub right: Box>> [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Tree` [INFO] [stdout] --> src/trees_and_graphs.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new(data: T, children: Vec>) -> Node { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `leaf_node` [INFO] [stdout] --> src/trees_and_graphs.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn leaf_node(data: T) -> Node { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn new(root: Node) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `traverse_node_in_order` [INFO] [stdout] --> src/trees_and_graphs.rs:65:4 [INFO] [stdout] | [INFO] [stdout] 65 | fn traverse_node_in_order(node: &Node){ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graphs.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | queue.add(neighbor.clone()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 8 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 4.81s [INFO] [stderr] Running `cargo check` to verify 2021 [INFO] [stderr] Checking cracking_the_job_interview v0.1.0 (/tmp/fixit) [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> src/trees_and_graphs.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BinaryNode` [INFO] [stdout] --> src/trees_and_graphs.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct BinaryNode { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Tree` [INFO] [stdout] --> src/trees_and_graphs.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BinaryTree` [INFO] [stdout] --> src/trees_and_graphs.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn new(data: T, left: Box>>, right: Box>>) [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn new(root: BinaryNode) -> BinaryTree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new(data: T, children: Vec>) -> Node { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `leaf_node` [INFO] [stdout] --> src/trees_and_graphs.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn leaf_node(data: T) -> Node { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn new(root: Node) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `traverse_node_in_order` [INFO] [stdout] --> src/trees_and_graphs.rs:65:4 [INFO] [stdout] | [INFO] [stdout] 65 | fn traverse_node_in_order(node: &Node){ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `handle_neighbors` [INFO] [stdout] --> src/graphs.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn handle_neighbors(queue: & mut Queue, visited: &HashSet, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `search_path` [INFO] [stdout] --> src/graphs.rs:19:4 [INFO] [stdout] | [INFO] [stdout] 19 | fn search_path(graph: Graph<&str, u32>, from: NodeIndex, to: NodeIndex) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `ALPHA` [INFO] [stdout] --> src/naive_bayes.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | const ALPHA: f64 = 1.; // count added to missing words to avoid probability 0.0 [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `NaiveBayes` [INFO] [stdout] --> src/naive_bayes.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct NaiveBayes { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `NaiveBayesParameters` [INFO] [stdout] --> src/naive_bayes.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct NaiveBayesParameters { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Probabilities` [INFO] [stdout] --> src/naive_bayes.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | struct Probabilities { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `empty` [INFO] [stdout] --> src/naive_bayes.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn empty() -> Probabilities { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `train` [INFO] [stdout] --> src/naive_bayes.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn train(&mut self, x: Vec<&str>, y: Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `predict` [INFO] [stdout] --> src/naive_bayes.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn predict(&self, text: &str) -> u16 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/naive_bayes.rs:91:12 [INFO] [stdout] | [INFO] [stdout] 91 | pub fn new() -> NaiveBayes { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `is_unique` [INFO] [stdout] --> src/main.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn is_unique(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `check_permutation` [INFO] [stdout] --> src/main.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn check_permutation(s1: &str, s2: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `palindrome_permutation` [INFO] [stdout] --> src/main.rs:60:4 [INFO] [stdout] | [INFO] [stdout] 60 | fn palindrome_permutation(s: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `one_away` [INFO] [stdout] --> src/main.rs:78:4 [INFO] [stdout] | [INFO] [stdout] 78 | fn one_away(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `compare_with_one_change` [INFO] [stdout] --> src/main.rs:98:4 [INFO] [stdout] | [INFO] [stdout] 98 | fn compare_with_one_change(s1: &str, s2: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `string_compression` [INFO] [stdout] --> src/main.rs:131:4 [INFO] [stdout] | [INFO] [stdout] 131 | fn string_compression(s: &str) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_counter` [INFO] [stdout] --> src/main.rs:160:4 [INFO] [stdout] | [INFO] [stdout] 160 | fn push_counter(counter: usize, char_vec: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rotate_matrix` [INFO] [stdout] --> src/main.rs:169:4 [INFO] [stdout] | [INFO] [stdout] 169 | fn rotate_matrix(matrix: Vec>) -> Vec>{ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graphs.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | queue.add(neighbor.clone()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 29 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Node` [INFO] [stdout] --> src/trees_and_graphs.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `right` [INFO] [stdout] --> src/trees_and_graphs.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | pub right: Box>> [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Tree` [INFO] [stdout] --> src/trees_and_graphs.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new(data: T, children: Vec>) -> Node { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `leaf_node` [INFO] [stdout] --> src/trees_and_graphs.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn leaf_node(data: T) -> Node { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/trees_and_graphs.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn new(root: Node) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `traverse_node_in_order` [INFO] [stdout] --> src/trees_and_graphs.rs:65:4 [INFO] [stdout] | [INFO] [stdout] 65 | fn traverse_node_in_order(node: &Node){ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graphs.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | queue.add(neighbor.clone()); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 8 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 0.32s [INFO] running `Command { std: "docker" "inspect" "d4e44c32a76c888861d824a4559d6425ded7d9ba971b1b3ffd3a66f6f9f0d300", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "d4e44c32a76c888861d824a4559d6425ded7d9ba971b1b3ffd3a66f6f9f0d300", kill_on_drop: false }` [INFO] [stdout] d4e44c32a76c888861d824a4559d6425ded7d9ba971b1b3ffd3a66f6f9f0d300