[INFO] cloning repository https://github.com/Moshizzl3/rust-algos [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Moshizzl3/rust-algos" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMoshizzl3%2Frust-algos", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMoshizzl3%2Frust-algos'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 17116b81f31b4b8125c3a386940f5437a952442c [INFO] checking Moshizzl3/rust-algos against try#db4e1d23234d93b5e96ecc768b35d9090c32cddf for pr-149901 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMoshizzl3%2Frust-algos" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/Moshizzl3/rust-algos [INFO] finished tweaking git repo https://github.com/Moshizzl3/rust-algos [INFO] tweaked toml for git repo https://github.com/Moshizzl3/rust-algos written to /workspace/builds/worker-6-tc2/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/Moshizzl3/rust-algos on toolchain db4e1d23234d93b5e96ecc768b35d9090c32cddf [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+db4e1d23234d93b5e96ecc768b35d9090c32cddf" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/Moshizzl3/rust-algos already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+db4e1d23234d93b5e96ecc768b35d9090c32cddf" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/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:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+db4e1d23234d93b5e96ecc768b35d9090c32cddf" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] e0663b0dd2a12f04548e921375a1bc47f9e22c1054fac9e9ab435d3651c2bcc5 [INFO] running `Command { std: "docker" "start" "-a" "e0663b0dd2a12f04548e921375a1bc47f9e22c1054fac9e9ab435d3651c2bcc5", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "e0663b0dd2a12f04548e921375a1bc47f9e22c1054fac9e9ab435d3651c2bcc5", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "e0663b0dd2a12f04548e921375a1bc47f9e22c1054fac9e9ab435d3651c2bcc5", kill_on_drop: false }` [INFO] [stdout] e0663b0dd2a12f04548e921375a1bc47f9e22c1054fac9e9ab435d3651c2bcc5 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+db4e1d23234d93b5e96ecc768b35d9090c32cddf" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 01ca51a1236b4d319297b4198dd7b5d004b5b63b6a33c88511e4c13c28daf3e0 [INFO] running `Command { std: "docker" "start" "-a" "01ca51a1236b4d319297b4198dd7b5d004b5b63b6a33c88511e4c13c28daf3e0", kill_on_drop: false }` [INFO] [stderr] Checking rust-algos v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `binary_search::binary_search` [INFO] [stdout] --> src/algoritms/search/mod.rs:3:9 [INFO] [stdout] | [INFO] [stdout] 3 | pub use binary_search::binary_search; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/algoritms/sorting/bubble_sort.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 17 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/algoritms/sorting/quick_sort.rs:29:9 [INFO] [stdout] | [INFO] [stdout] 29 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow` [INFO] [stdout] --> src/data_structures/avl_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | use core::{borrow, fmt}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::data_structures::graphs::Node` [INFO] [stdout] --> src/data_structures/avl_bst.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use crate::data_structures::graphs::Node; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow` [INFO] [stdout] --> src/data_structures/bst.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | use core::{borrow, fmt}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Ref` and `write` [INFO] [stdout] --> src/data_structures/bst.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | cell::{Ref, RefCell}, [INFO] [stdout] | ^^^ [INFO] [stdout] 6 | fmt::{Display, write}, [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs` [INFO] [stdout] --> src/main.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::fs; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Duration` and `Instant` [INFO] [stdout] --> src/main.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | use std::time::{Duration, Instant}; [INFO] [stdout] | ^^^^^^^^ ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `collections::VecDeque` and `fs::read_dir` [INFO] [stdout] --> src/main.rs:6:26 [INFO] [stdout] | [INFO] [stdout] 6 | use std::{cell::RefCell, collections::VecDeque, fs::read_dir, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::algoritms::compression::huffman::decode` [INFO] [stdout] --> src/main.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::algoritms::compression::huffman::decode; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::data_structures::avl_bst::Avl` [INFO] [stdout] --> src/main.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use crate::data_structures::avl_bst::Avl; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::data_structures::bst::Bst` [INFO] [stdout] --> src/main.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | use crate::data_structures::bst::Bst; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `MoGraph`, `Node`, `build_huffman_tree`, `count_frequencies`, `encode`, `generate_codes`, `search`, and `tree::TreeNode` [INFO] [stdout] --> src/main.rs:15:32 [INFO] [stdout] | [INFO] [stdout] 15 | compression::huffman::{build_huffman_tree, count_frequencies, encode, generate_codes}, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^ ^^^^^^ ^^^^^^^^^^^^^^ [INFO] [stdout] 16 | search, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | graphs::{MoGraph, Node}, [INFO] [stdout] | ^^^^^^^ ^^^^ [INFO] [stdout] 20 | tree::TreeNode, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `binary_search::binary_search` [INFO] [stdout] --> src/algoritms/search/mod.rs:3:9 [INFO] [stdout] | [INFO] [stdout] 3 | pub use binary_search::binary_search; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow` [INFO] [stdout] --> src/data_structures/avl_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | use core::{borrow, fmt}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::data_structures::graphs::Node` [INFO] [stdout] --> src/data_structures/avl_bst.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use crate::data_structures::graphs::Node; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `borrow` [INFO] [stdout] --> src/data_structures/bst.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | use core::{borrow, fmt}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Ref` and `write` [INFO] [stdout] --> src/data_structures/bst.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | cell::{Ref, RefCell}, [INFO] [stdout] | ^^^ [INFO] [stdout] 6 | fmt::{Display, write}, [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs` [INFO] [stdout] --> src/main.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::fs; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Duration` and `Instant` [INFO] [stdout] --> src/main.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | use std::time::{Duration, Instant}; [INFO] [stdout] | ^^^^^^^^ ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `collections::VecDeque` and `fs::read_dir` [INFO] [stdout] --> src/main.rs:6:26 [INFO] [stdout] | [INFO] [stdout] 6 | use std::{cell::RefCell, collections::VecDeque, fs::read_dir, rc::Rc}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::algoritms::compression::huffman::decode` [INFO] [stdout] --> src/main.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::algoritms::compression::huffman::decode; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::data_structures::avl_bst::Avl` [INFO] [stdout] --> src/main.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use crate::data_structures::avl_bst::Avl; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::data_structures::bst::Bst` [INFO] [stdout] --> src/main.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | use crate::data_structures::bst::Bst; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `MoGraph`, `Node`, `build_huffman_tree`, `count_frequencies`, `encode`, `generate_codes`, `search`, and `tree::TreeNode` [INFO] [stdout] --> src/main.rs:15:32 [INFO] [stdout] | [INFO] [stdout] 15 | compression::huffman::{build_huffman_tree, count_frequencies, encode, generate_codes}, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^ ^^^^^^ ^^^^^^^^^^^^^^ [INFO] [stdout] 16 | search, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | graphs::{MoGraph, Node}, [INFO] [stdout] | ^^^^^^^ ^^^^ [INFO] [stdout] 20 | tree::TreeNode, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_frequencies` is never used [INFO] [stdout] --> src/algoritms/compression/huffman.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | pub fn count_frequencies(text: &str) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_huffman_tree` is never used [INFO] [stdout] --> src/algoritms/compression/huffman.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn build_huffman_tree(text: &str) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_codes` is never used [INFO] [stdout] --> src/algoritms/compression/huffman.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn generate_codes(root: &Rc>) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `generate_codes_helper` is never used [INFO] [stdout] --> src/algoritms/compression/huffman.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn generate_codes_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `encode` is never used [INFO] [stdout] --> src/algoritms/compression/huffman.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | pub fn encode(text: &str, codes: &HashMap) -> Result { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `decode` is never used [INFO] [stdout] --> src/algoritms/compression/huffman.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub fn decode(encoded: &str, tree: &Rc>) -> Result { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HeapNode` is never constructed [INFO] [stdout] --> src/algoritms/compression/huffman.rs:160:12 [INFO] [stdout] | [INFO] [stdout] 160 | pub struct HeapNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_recursive` is never used [INFO] [stdout] --> src/algoritms/recursive_stuff.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn sum_recursive(input_list: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_recursive_match` is never used [INFO] [stdout] --> src/algoritms/recursive_stuff.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn sum_recursive_match(input_list: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_recursive` is never used [INFO] [stdout] --> src/algoritms/recursive_stuff.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn count_recursive(input_list: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_recursive_match` is never used [INFO] [stdout] --> src/algoritms/recursive_stuff.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn count_recursive_match(input_list: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_value_recursive` is never used [INFO] [stdout] --> src/algoritms/recursive_stuff.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn max_value_recursive(input_list: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_value_recursive_pattern` is never used [INFO] [stdout] --> src/algoritms/recursive_stuff.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn max_value_recursive_pattern(input_list: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> src/algoritms/search/binary_search.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn binary_search(input_list: &[i32], target: i32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/algoritms/sorting/bubble_sort.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn bubble_sort(input_list: &[T]) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/algoritms/sorting/quick_sort.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn quick_sort(input_list: &[T]) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_smallest` is never used [INFO] [stdout] --> src/algoritms/sorting/selection_sort.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find_smallest(input_list: &[i32]) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> src/algoritms/sorting/selection_sort.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn selection_sort(input_list: &[i32]) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `NodeRef` is never used [INFO] [stdout] --> src/data_structures/avl_bst.rs:9:6 [INFO] [stdout] | [INFO] [stdout] 9 | type NodeRef = Rc>>; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AVLNode` is never constructed [INFO] [stdout] --> src/data_structures/avl_bst.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct AVLNode { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Avl` is never constructed [INFO] [stdout] --> src/data_structures/avl_bst.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Avl { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/avl_bst.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 24 | impl Avl { [INFO] [stdout] | ---------------------------------------- associated items in this implementation [INFO] [stdout] 25 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn search(&self, key: &K) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn search_helper(node: &NodeRef, key: &K) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | pub fn delete(&mut self, key: &K) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn delete_helper(node: &NodeRef, key: &K) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 133 | fn find_min(node: &Rc>>) -> (K, V) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | pub fn contains(&self, key: &K) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 149 | fn get_height(node: &Option>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 155 | fn update_height(node: &NodeRef) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 162 | fn get_balance_factor(node: &NodeRef) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 166 | fn rotate_right(y: &NodeRef) -> NodeRef { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 182 | fn rotate_left(y: &NodeRef) -> NodeRef { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 199 | fn rotate_left_right(z: &NodeRef) -> NodeRef { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 208 | fn rotate_right_left(z: &NodeRef) -> NodeRef { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 218 | pub fn insert(&mut self, key: K, value: V) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 232 | fn insert_helper(node: &NodeRef, key: K, value: V) -> NodeRef { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `display_helper` is never used [INFO] [stdout] --> src/data_structures/avl_bst.rs:313:8 [INFO] [stdout] | [INFO] [stdout] 312 | impl Avl { [INFO] [stdout] | -------------------------------------------- associated function in this implementation [INFO] [stdout] 313 | fn display_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `order` is never read [INFO] [stdout] --> src/data_structures/b_tree.rs:18:5 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct BTree { [INFO] [stdout] | ----- field in this struct [INFO] [stdout] 17 | pub root: Option>, [INFO] [stdout] 18 | order: usize, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `insert`, `insert_helper`, and `split_node` are never used [INFO] [stdout] --> src/data_structures/b_tree.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl BTree { [INFO] [stdout] | ------------------------------------------ associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn insert(&mut self, key: K, value: V) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn insert_helper( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn split_node(node: &NodeRef) -> (K, V, NodeRef) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTNode` is never constructed [INFO] [stdout] --> src/data_structures/bst.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct BSTNode { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Bst` is never constructed [INFO] [stdout] --> src/data_structures/bst.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Bst { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/bst.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Bst { [INFO] [stdout] | ---------------------------------------- associated items in this implementation [INFO] [stdout] 24 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn insert(&mut self, key: K, value: V) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn insert_helper(node: &Rc>>, key: K, value: V) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | pub fn search(&self, key: &K) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn search_helper(node: &Rc>>, key: &K) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | pub fn delete(&mut self, key: &K) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 112 | fn delete_helper( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 156 | fn find_min(node: &Rc>>) -> (K, V) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 166 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 170 | pub fn contains(&self, key: &K) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `display_helper` is never used [INFO] [stdout] --> src/data_structures/bst.rs:187:8 [INFO] [stdout] | [INFO] [stdout] 186 | impl Bst { [INFO] [stdout] | -------------------------------------------- associated function in this implementation [INFO] [stdout] 187 | fn display_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/data_structures/graphs.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MoGraph` is never constructed [INFO] [stdout] --> src/data_structures/graphs.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct MoGraph { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/graphs.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl MoGraph { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 17 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn add_node(&mut self, node: Node) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn add_edge(&mut self, from: String, to: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn neighbors(&self, node: &str) -> Option<&Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn get_node(&self, key: &str) -> Option<&Node> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn bfs(&self, start: &str, condition: &F) -> Option<&Node> [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | pub fn dfs(&self, start: &str, condition: &F) -> Option<&Node> [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn dfs_helper( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MoMap` is never constructed [INFO] [stdout] --> src/data_structures/hash_tables.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct MoMap { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/hash_tables.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 9 | / impl MoMap [INFO] [stdout] 10 | | where [INFO] [stdout] 11 | | V: Clone, [INFO] [stdout] | |_____________- associated items in this implementation [INFO] [stdout] 12 | { [INFO] [stdout] 13 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn bla(&self) [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn insert(&mut self, key: String, value: V) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn get(&self, key: &str) -> Option<&V> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn remove(&mut self, key: &str) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn hash_with_size(&self, chars: Chars, size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn hashing_function(&self, chars: Chars) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn resize(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MoMap` is never constructed [INFO] [stdout] --> src/data_structures/hash_tables_generic.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct MoMap { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/data_structures/hash_tables_generic.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 9 | / impl MoMap [INFO] [stdout] 10 | | where [INFO] [stdout] 11 | | K: Clone + PartialEq + Hash, [INFO] [stdout] 12 | | V: Clone, [INFO] [stdout] | |_____________- associated items in this implementation [INFO] [stdout] 13 | { [INFO] [stdout] 14 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn bla(&self) [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn insert(&mut self, key: K, value: V) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn get(&self, key: &K) -> Option<&V> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn remove(&mut self, key: &K) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn hash_with_size(&self, key: &K, size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn hashing_function(&self, key: &K) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn resize(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/data_structures/tree.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new_leaf`, `new_internal`, and `is_leaf` are never used [INFO] [stdout] --> src/data_structures/tree.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl TreeNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 13 | // Leaf, must have a char. [INFO] [stdout] 14 | pub fn new_leaf(character: char, frequency: usize) -> Rc> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn new_internal( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn is_leaf(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `is_empty` and `contains` are never used [INFO] [stdout] --> src/data_structures/avl_bst.rs:141:12 [INFO] [stdout] | [INFO] [stdout] 24 | impl Avl { [INFO] [stdout] | ---------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 141 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | pub fn contains(&self, key: &K) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `order` is never read [INFO] [stdout] --> src/data_structures/b_tree.rs:18:5 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct BTree { [INFO] [stdout] | ----- field in this struct [INFO] [stdout] 17 | pub root: Option>, [INFO] [stdout] 18 | order: usize, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `insert`, `insert_helper`, and `split_node` are never used [INFO] [stdout] --> src/data_structures/b_tree.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl BTree { [INFO] [stdout] | ------------------------------------------ associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn insert(&mut self, key: K, value: V) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn insert_helper( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn split_node(node: &NodeRef) -> (K, V, NodeRef) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `is_empty` and `contains` are never used [INFO] [stdout] --> src/data_structures/bst.rs:166:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Bst { [INFO] [stdout] | ---------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 166 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 170 | pub fn contains(&self, key: &K) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `bla` is never used [INFO] [stdout] --> src/data_structures/hash_tables.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 9 | / impl MoMap [INFO] [stdout] 10 | | where [INFO] [stdout] 11 | | V: Clone, [INFO] [stdout] | |_____________- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn bla(&self) [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `bla` is never used [INFO] [stdout] --> src/data_structures/hash_tables_generic.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 9 | / impl MoMap [INFO] [stdout] 10 | | where [INFO] [stdout] 11 | | K: Clone + PartialEq + Hash, [INFO] [stdout] 12 | | V: Clone, [INFO] [stdout] | |_____________- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn bla(&self) [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 1.17s [INFO] running `Command { std: "docker" "inspect" "01ca51a1236b4d319297b4198dd7b5d004b5b63b6a33c88511e4c13c28daf3e0", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "01ca51a1236b4d319297b4198dd7b5d004b5b63b6a33c88511e4c13c28daf3e0", kill_on_drop: false }` [INFO] [stdout] 01ca51a1236b4d319297b4198dd7b5d004b5b63b6a33c88511e4c13c28daf3e0