[INFO] cloning repository https://github.com/wusha0hua/datastruct-algorithm-rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/wusha0hua/datastruct-algorithm-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fwusha0hua%2Fdatastruct-algorithm-rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fwusha0hua%2Fdatastruct-algorithm-rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] de580a4133e1c836bfa04ac3f18a0f5a902129c5 [INFO] testing wusha0hua/datastruct-algorithm-rust against master#cdb45c87e2cd43495379f7e867e3cc15dcee9f93 for pr-145838-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fwusha0hua%2Fdatastruct-algorithm-rust" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/wusha0hua/datastruct-algorithm-rust [INFO] finished tweaking git repo https://github.com/wusha0hua/datastruct-algorithm-rust [INFO] tweaked toml for git repo https://github.com/wusha0hua/datastruct-algorithm-rust written to /workspace/builds/worker-0-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/wusha0hua/datastruct-algorithm-rust on toolchain cdb45c87e2cd43495379f7e867e3cc15dcee9f93 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/wusha0hua/datastruct-algorithm-rust 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" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 960dc7d45315b29da094e6b910ba2cd30601b8e1cc8b64b446af5993a3c63ca8 [INFO] running `Command { std: "docker" "start" "-a" "960dc7d45315b29da094e6b910ba2cd30601b8e1cc8b64b446af5993a3c63ca8", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "960dc7d45315b29da094e6b910ba2cd30601b8e1cc8b64b446af5993a3c63ca8", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "960dc7d45315b29da094e6b910ba2cd30601b8e1cc8b64b446af5993a3c63ca8", kill_on_drop: false }` [INFO] [stdout] 960dc7d45315b29da094e6b910ba2cd30601b8e1cc8b64b446af5993a3c63ca8 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 625a89a725a1e6fd6f8fd135b084e2463dc74f804ddb576e5314c49e68e4fd4e [INFO] running `Command { std: "docker" "start" "-a" "625a89a725a1e6fd6f8fd135b084e2463dc74f804ddb576e5314c49e68e4fd4e", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.155 [INFO] [stderr] Compiling getrandom v0.2.15 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling datastruct-alogritm-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `crate::y_combinator::y` [INFO] [stdout] --> src/datastruct/link_list/singly_link_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::y_combinator::y; [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: `crate::y_combinator::y` [INFO] [stdout] --> src/datastruct/link_list/doubly_link_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::y_combinator::y; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TreeNode` [INFO] [stdout] --> src/datastruct/tree/balanced_binary_tree.rs:1:37 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::node::{BalancedTreeNode, TreeNode}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `self` [INFO] [stdout] --> src/datastruct/tree/b_tree.rs:1:19 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::node::{self, BTreeNode}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/datastruct/tree/mod.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/datastruct/tree/mod.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `heap` [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:2:57 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::datastruct::{graph::{GraphTrait, GraphType}, heap}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `data` [INFO] [stdout] --> src/datastruct/tree/binary_tree.rs:105:24 [INFO] [stdout] | [INFO] [stdout] 105 | fn contains(&self, data: &T) -> bool {todo!()} [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `data` [INFO] [stdout] --> src/datastruct/tree/balanced_binary_tree.rs:28:23 [INFO] [stdout] | [INFO] [stdout] 28 | fn contains(&self, data: &T) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node15` [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:962:17 [INFO] [stdout] | [INFO] [stdout] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node15` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node18` [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:964:17 [INFO] [stdout] | [INFO] [stdout] 964 | let mut node18 = RedBlackNode::from(18); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node18` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:962:13 [INFO] [stdout] | [INFO] [stdout] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:964:13 [INFO] [stdout] | [INFO] [stdout] 964 | let mut node18 = RedBlackNode::from(18); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:209:13 [INFO] [stdout] | [INFO] [stdout] 209 | let mut path = Vec::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:215:43 [INFO] [stdout] | [INFO] [stdout] 215 | fn shortest_path_with_dijkstra(&self, start: usize) -> HashMap> {todo!()} [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/algorithm/bit.rs:100:19 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `b` [INFO] [stdout] --> src/algorithm/bit.rs:100:29 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/bit.rs:100:15 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/bit.rs:100:25 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `FindForPredecessor` is never constructed [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:33:5 [INFO] [stdout] | [INFO] [stdout] 31 | enum DeleteState<'a, T> where T: PartialOrd + std::fmt::Debug { [INFO] [stdout] | ----------- variant in this enum [INFO] [stdout] 32 | FindForDeleteNode(&'a T), [INFO] [stdout] 33 | FindForPredecessor, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `DeleteState` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gen_matrix_with_zero_present_nan` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn gen_matrix_with_zero_present_nan(m: Vec>) -> Vec>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gen_matrix_with_zero_present_zero` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:43:4 [INFO] [stdout] | [INFO] [stdout] 43 | fn gen_matrix_with_zero_present_zero(m: Vec>) -> Vec>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX1` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:54:7 [INFO] [stdout] | [INFO] [stdout] 54 | const MATRIX1: [[isize; 6]; 6] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX2` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:63:7 [INFO] [stdout] | [INFO] [stdout] 63 | const MATRIX2: [[isize; 7]; 7] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MINSPANTREEFORMATRIX2` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:74:7 [INFO] [stdout] | [INFO] [stdout] 74 | const MINSPANTREEFORMATRIX2: [[isize; 7]; 7] = [ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX3` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:85:7 [INFO] [stdout] | [INFO] [stdout] 85 | const MATRIX3: [[isize; 6]; 6] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX4` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:95:7 [INFO] [stdout] | [INFO] [stdout] 95 | const MATRIX4: [[isize; 7]; 7] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `max` and `bits` are never read [INFO] [stdout] --> src/datastruct/bitmap/mod.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct BitMap { [INFO] [stdout] | ------ fields in this struct [INFO] [stdout] 4 | max: usize, [INFO] [stdout] | ^^^ [INFO] [stdout] 5 | bits: usize, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BitMap` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `adjacency_linklist::GraphAdjacencyLinkList` and `adjacency_matrix::GraphAdjacencyMatrix` [INFO] [stdout] --> src/main.rs:1:51 [INFO] [stdout] | [INFO] [stdout] 1 | use datastruct_alogritm_rust::datastruct::graph::{adjacency_linklist::GraphAdjacencyLinkList, adjacency_matrix::GraphAdjacencyMatrix}; [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: `datastruct_alogritm_rust::datastruct::tree::binary_search_tree::BinarySearchTree` [INFO] [stdout] --> src/main.rs:5:9 [INFO] [stdout] | [INFO] [stdout] 5 | use datastruct_alogritm_rust::datastruct::tree::binary_search_tree::BinarySearchTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::TreeTrait` [INFO] [stdout] --> src/main.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | use datastruct_alogritm_rust::datastruct::tree::TreeTrait; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/main.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/main.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::node::TreeNode` [INFO] [stdout] --> src/main.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | use datastruct_alogritm_rust::node::TreeNode; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::algorithm::sort::*` [INFO] [stdout] --> src/main.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | use datastruct_alogritm_rust::algorithm::sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::algorithm::string::*` [INFO] [stdout] --> src/main.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | use datastruct_alogritm_rust::algorithm::string::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Rng` and `thread_rng` [INFO] [stdout] --> src/main.rs:12:16 [INFO] [stdout] | [INFO] [stdout] 12 | use rand::{Rng, thread_rng}; [INFO] [stdout] | ^^^ ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tire::tire::Trie` [INFO] [stdout] --> src/main.rs:13:9 [INFO] [stdout] | [INFO] [stdout] 13 | use datastruct_alogritm_rust::datastruct::tire::tire::Trie; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::graph::*` [INFO] [stdout] --> src/main.rs:14:9 [INFO] [stdout] | [INFO] [stdout] 14 | use datastruct_alogritm_rust::datastruct::graph::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::graph::union_find_set::UnionFindSet` [INFO] [stdout] --> src/main.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | use datastruct_alogritm_rust::datastruct::graph::union_find_set::UnionFindSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::link_list::doubly_link_list::*` [INFO] [stdout] --> src/main.rs:16:9 [INFO] [stdout] | [INFO] [stdout] 16 | use datastruct_alogritm_rust::datastruct::link_list::doubly_link_list::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::balanced_binary_tree::BalancedBinaryTree` [INFO] [stdout] --> src/main.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 17 | use datastruct_alogritm_rust::datastruct::tree::balanced_binary_tree::BalancedBinaryTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::b_tree::BTree` [INFO] [stdout] --> src/main.rs:18:9 [INFO] [stdout] | [INFO] [stdout] 18 | use datastruct_alogritm_rust::datastruct::tree::b_tree::BTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::red_black_tree::RedBlackTree` [INFO] [stdout] --> src/main.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 19 | use datastruct_alogritm_rust::datastruct::tree::red_black_tree::RedBlackTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/main.rs:21:9 [INFO] [stdout] | [INFO] [stdout] 21 | let mut number1 = Number::from_dec("789", 1000).unwrap(); [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 5.46s [INFO] running `Command { std: "docker" "inspect" "625a89a725a1e6fd6f8fd135b084e2463dc74f804ddb576e5314c49e68e4fd4e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "625a89a725a1e6fd6f8fd135b084e2463dc74f804ddb576e5314c49e68e4fd4e", kill_on_drop: false }` [INFO] [stdout] 625a89a725a1e6fd6f8fd135b084e2463dc74f804ddb576e5314c49e68e4fd4e [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 14ddb9511fadb2a35b8996f8c8fd853d6a35947c3fd47d7512dc0fb462248bce [INFO] running `Command { std: "docker" "start" "-a" "14ddb9511fadb2a35b8996f8c8fd853d6a35947c3fd47d7512dc0fb462248bce", kill_on_drop: false }` [INFO] [stderr] Compiling datastruct-alogritm-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `crate::y_combinator::y` [INFO] [stdout] --> src/datastruct/link_list/singly_link_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::y_combinator::y; [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: `crate::y_combinator::y` [INFO] [stdout] --> src/datastruct/link_list/doubly_link_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::y_combinator::y; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TreeNode` [INFO] [stdout] --> src/datastruct/tree/balanced_binary_tree.rs:1:37 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::node::{BalancedTreeNode, TreeNode}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `self` [INFO] [stdout] --> src/datastruct/tree/b_tree.rs:1:19 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::node::{self, BTreeNode}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/datastruct/tree/mod.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/datastruct/tree/mod.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `heap` [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:2:57 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::datastruct::{graph::{GraphTrait, GraphType}, heap}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `data` [INFO] [stdout] --> src/datastruct/tree/binary_tree.rs:105:24 [INFO] [stdout] | [INFO] [stdout] 105 | fn contains(&self, data: &T) -> bool {todo!()} [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `data` [INFO] [stdout] --> src/datastruct/tree/balanced_binary_tree.rs:28:23 [INFO] [stdout] | [INFO] [stdout] 28 | fn contains(&self, data: &T) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node15` [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:962:17 [INFO] [stdout] | [INFO] [stdout] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node15` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node18` [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:964:17 [INFO] [stdout] | [INFO] [stdout] 964 | let mut node18 = RedBlackNode::from(18); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node18` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:962:13 [INFO] [stdout] | [INFO] [stdout] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:964:13 [INFO] [stdout] | [INFO] [stdout] 964 | let mut node18 = RedBlackNode::from(18); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:209:13 [INFO] [stdout] | [INFO] [stdout] 209 | let mut path = Vec::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:215:43 [INFO] [stdout] | [INFO] [stdout] 215 | fn shortest_path_with_dijkstra(&self, start: usize) -> HashMap> {todo!()} [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/algorithm/bit.rs:100:19 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `b` [INFO] [stdout] --> src/algorithm/bit.rs:100:29 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/bit.rs:100:15 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/bit.rs:100:25 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `FindForPredecessor` is never constructed [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:33:5 [INFO] [stdout] | [INFO] [stdout] 31 | enum DeleteState<'a, T> where T: PartialOrd + std::fmt::Debug { [INFO] [stdout] | ----------- variant in this enum [INFO] [stdout] 32 | FindForDeleteNode(&'a T), [INFO] [stdout] 33 | FindForPredecessor, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `DeleteState` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gen_matrix_with_zero_present_nan` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn gen_matrix_with_zero_present_nan(m: Vec>) -> Vec>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gen_matrix_with_zero_present_zero` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:43:4 [INFO] [stdout] | [INFO] [stdout] 43 | fn gen_matrix_with_zero_present_zero(m: Vec>) -> Vec>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX1` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:54:7 [INFO] [stdout] | [INFO] [stdout] 54 | const MATRIX1: [[isize; 6]; 6] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX2` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:63:7 [INFO] [stdout] | [INFO] [stdout] 63 | const MATRIX2: [[isize; 7]; 7] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MINSPANTREEFORMATRIX2` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:74:7 [INFO] [stdout] | [INFO] [stdout] 74 | const MINSPANTREEFORMATRIX2: [[isize; 7]; 7] = [ [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX3` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:85:7 [INFO] [stdout] | [INFO] [stdout] 85 | const MATRIX3: [[isize; 6]; 6] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MATRIX4` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:95:7 [INFO] [stdout] | [INFO] [stdout] 95 | const MATRIX4: [[isize; 7]; 7] = [ [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `max` and `bits` are never read [INFO] [stdout] --> src/datastruct/bitmap/mod.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct BitMap { [INFO] [stdout] | ------ fields in this struct [INFO] [stdout] 4 | max: usize, [INFO] [stdout] | ^^^ [INFO] [stdout] 5 | bits: usize, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BitMap` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `adjacency_linklist::GraphAdjacencyLinkList` and `adjacency_matrix::GraphAdjacencyMatrix` [INFO] [stdout] --> src/main.rs:1:51 [INFO] [stdout] | [INFO] [stdout] 1 | use datastruct_alogritm_rust::datastruct::graph::{adjacency_linklist::GraphAdjacencyLinkList, adjacency_matrix::GraphAdjacencyMatrix}; [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: `datastruct_alogritm_rust::datastruct::tree::binary_search_tree::BinarySearchTree` [INFO] [stdout] --> src/main.rs:5:9 [INFO] [stdout] | [INFO] [stdout] 5 | use datastruct_alogritm_rust::datastruct::tree::binary_search_tree::BinarySearchTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::TreeTrait` [INFO] [stdout] --> src/main.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | use datastruct_alogritm_rust::datastruct::tree::TreeTrait; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/main.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/main.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::node::TreeNode` [INFO] [stdout] --> src/main.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | use datastruct_alogritm_rust::node::TreeNode; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::algorithm::sort::*` [INFO] [stdout] --> src/main.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | use datastruct_alogritm_rust::algorithm::sort::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::algorithm::string::*` [INFO] [stdout] --> src/main.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | use datastruct_alogritm_rust::algorithm::string::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Rng` and `thread_rng` [INFO] [stdout] --> src/main.rs:12:16 [INFO] [stdout] | [INFO] [stdout] 12 | use rand::{Rng, thread_rng}; [INFO] [stdout] | ^^^ ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tire::tire::Trie` [INFO] [stdout] --> src/main.rs:13:9 [INFO] [stdout] | [INFO] [stdout] 13 | use datastruct_alogritm_rust::datastruct::tire::tire::Trie; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::graph::*` [INFO] [stdout] --> src/main.rs:14:9 [INFO] [stdout] | [INFO] [stdout] 14 | use datastruct_alogritm_rust::datastruct::graph::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::graph::union_find_set::UnionFindSet` [INFO] [stdout] --> src/main.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | use datastruct_alogritm_rust::datastruct::graph::union_find_set::UnionFindSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::link_list::doubly_link_list::*` [INFO] [stdout] --> src/main.rs:16:9 [INFO] [stdout] | [INFO] [stdout] 16 | use datastruct_alogritm_rust::datastruct::link_list::doubly_link_list::*; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::balanced_binary_tree::BalancedBinaryTree` [INFO] [stdout] --> src/main.rs:17:9 [INFO] [stdout] | [INFO] [stdout] 17 | use datastruct_alogritm_rust::datastruct::tree::balanced_binary_tree::BalancedBinaryTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::b_tree::BTree` [INFO] [stdout] --> src/main.rs:18:9 [INFO] [stdout] | [INFO] [stdout] 18 | use datastruct_alogritm_rust::datastruct::tree::b_tree::BTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::red_black_tree::RedBlackTree` [INFO] [stdout] --> src/main.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 19 | use datastruct_alogritm_rust::datastruct::tree::red_black_tree::RedBlackTree; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/main.rs:21:9 [INFO] [stdout] | [INFO] [stdout] 21 | let mut number1 = Number::from_dec("789", 1000).unwrap(); [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::y_combinator::y` [INFO] [stdout] --> src/datastruct/link_list/singly_link_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::y_combinator::y; [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: `crate::y_combinator::y` [INFO] [stdout] --> src/datastruct/link_list/doubly_link_list.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::y_combinator::y; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::linked_list` [INFO] [stdout] --> src/datastruct/link_list/mod.rs:208:9 [INFO] [stdout] | [INFO] [stdout] 208 | use std::collections::linked_list; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TreeNode` [INFO] [stdout] --> src/datastruct/tree/balanced_binary_tree.rs:1:37 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::node::{BalancedTreeNode, TreeNode}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `self` [INFO] [stdout] --> src/datastruct/tree/b_tree.rs:1:19 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::node::{self, BTreeNode}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/datastruct/tree/mod.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cell::RefCell` [INFO] [stdout] --> src/datastruct/tree/mod.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | use std::cell::RefCell; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `self` [INFO] [stdout] --> src/datastruct/tree/mod.rs:243:23 [INFO] [stdout] | [INFO] [stdout] 243 | use crate::node::{self, BalancedTreeNode}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::char::MAX` [INFO] [stdout] --> src/datastruct/tree/mod.rs:492:9 [INFO] [stdout] | [INFO] [stdout] 492 | use std::char::MAX; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `heap` [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:2:57 [INFO] [stdout] | [INFO] [stdout] 2 | use crate::datastruct::{graph::{GraphTrait, GraphType}, heap}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::datastruct::tree::TreeTrait` [INFO] [stdout] --> src/datastruct/tree/mod.rs:241:9 [INFO] [stdout] | [INFO] [stdout] 241 | use crate::datastruct::tree::TreeTrait; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `data` [INFO] [stdout] --> src/datastruct/tree/binary_tree.rs:105:24 [INFO] [stdout] | [INFO] [stdout] 105 | fn contains(&self, data: &T) -> bool {todo!()} [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `data` [INFO] [stdout] --> src/datastruct/tree/balanced_binary_tree.rs:28:23 [INFO] [stdout] | [INFO] [stdout] 28 | fn contains(&self, data: &T) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node15` [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:962:17 [INFO] [stdout] | [INFO] [stdout] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node15` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node18` [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:964:17 [INFO] [stdout] | [INFO] [stdout] 964 | let mut node18 = RedBlackNode::from(18); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node18` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:962:13 [INFO] [stdout] | [INFO] [stdout] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:964:13 [INFO] [stdout] | [INFO] [stdout] 964 | let mut node18 = RedBlackNode::from(18); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:209:13 [INFO] [stdout] | [INFO] [stdout] 209 | let mut path = Vec::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/datastruct/graph/adjacency_linklist.rs:215:43 [INFO] [stdout] | [INFO] [stdout] 215 | fn shortest_path_with_dijkstra(&self, start: usize) -> HashMap> {todo!()} [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/algorithm/bit.rs:100:19 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `b` [INFO] [stdout] --> src/algorithm/bit.rs:100:29 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/bit.rs:100:15 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/bit.rs:100:25 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant `FindForPredecessor` is never constructed [INFO] [stdout] --> src/datastruct/tree/red_black_tree.rs:33:5 [INFO] [stdout] | [INFO] [stdout] 31 | enum DeleteState<'a, T> where T: PartialOrd + std::fmt::Debug { [INFO] [stdout] | ----------- variant in this enum [INFO] [stdout] 32 | FindForDeleteNode(&'a T), [INFO] [stdout] 33 | FindForPredecessor, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `DeleteState` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gen_matrix_with_zero_present_zero` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:43:4 [INFO] [stdout] | [INFO] [stdout] 43 | fn gen_matrix_with_zero_present_zero(m: Vec>) -> Vec>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_bfs` is never used [INFO] [stdout] --> src/datastruct/graph/mod.rs:203:8 [INFO] [stdout] | [INFO] [stdout] 203 | fn test_bfs() { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `max` and `bits` are never read [INFO] [stdout] --> src/datastruct/bitmap/mod.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct BitMap { [INFO] [stdout] | ------ fields in this struct [INFO] [stdout] 4 | max: usize, [INFO] [stdout] | ^^^ [INFO] [stdout] 5 | bits: usize, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BitMap` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 3.02s [INFO] running `Command { std: "docker" "inspect" "14ddb9511fadb2a35b8996f8c8fd853d6a35947c3fd47d7512dc0fb462248bce", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "14ddb9511fadb2a35b8996f8c8fd853d6a35947c3fd47d7512dc0fb462248bce", kill_on_drop: false }` [INFO] [stdout] 14ddb9511fadb2a35b8996f8c8fd853d6a35947c3fd47d7512dc0fb462248bce [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] a4a46094c9144770a4758212f56f7b23d964ba9a38bdbe319eef17b2973d61b9 [INFO] running `Command { std: "docker" "start" "-a" "a4a46094c9144770a4758212f56f7b23d964ba9a38bdbe319eef17b2973d61b9", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `crate::y_combinator::y` [INFO] [stdout] [INFO] [stderr] --> src/datastruct/link_list/singly_link_list.rs:2:5 [INFO] [stdout] running 91 tests [INFO] [stderr] | [INFO] [stdout] test algorithm::test_bit::test_add ... ok [INFO] [stderr] 2 | use crate::y_combinator::y; [INFO] [stdout] test algorithm::test_bit::test_max ... ok [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] test algorithm::test_bit::test_sub ... ok [INFO] [stderr] | [INFO] [stdout] test algorithm::test_bit::test_swap ... ok [INFO] [stderr] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `crate::y_combinator::y` [INFO] [stderr] --> src/datastruct/link_list/doubly_link_list.rs:2:5 [INFO] [stderr] | [INFO] [stderr] 2 | use crate::y_combinator::y; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `TreeNode` [INFO] [stderr] --> src/datastruct/tree/balanced_binary_tree.rs:1:37 [INFO] [stderr] | [INFO] [stderr] 1 | use crate::node::{BalancedTreeNode, TreeNode}; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `self` [INFO] [stderr] --> src/datastruct/tree/b_tree.rs:1:19 [INFO] [stderr] | [INFO] [stderr] 1 | use crate::node::{self, BTreeNode}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::rc::Rc` [INFO] [stdout] test algorithm::test_bit::test_mul ... ok [INFO] [stderr] --> src/datastruct/tree/mod.rs:7:5 [INFO] [stderr] | [INFO] [stderr] 7 | use std::rc::Rc; [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::cell::RefCell` [INFO] [stderr] --> src/datastruct/tree/mod.rs:8:5 [INFO] [stderr] | [INFO] [stderr] 8 | use std::cell::RefCell; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `heap` [INFO] [stderr] --> src/datastruct/graph/adjacency_linklist.rs:2:57 [INFO] [stderr] | [INFO] [stderr] 2 | use crate::datastruct::{graph::{GraphTrait, GraphType}, heap}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused variable: `data` [INFO] [stderr] --> src/datastruct/tree/binary_tree.rs:105:24 [INFO] [stderr] | [INFO] [stderr] 105 | fn contains(&self, data: &T) -> bool {todo!()} [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `data` [INFO] [stderr] --> src/datastruct/tree/balanced_binary_tree.rs:28:23 [INFO] [stderr] | [INFO] [stderr] 28 | fn contains(&self, data: &T) -> bool { [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_data` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `node15` [INFO] [stderr] --> src/datastruct/tree/red_black_tree.rs:962:17 [INFO] [stderr] | [INFO] [stderr] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stderr] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node15` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `node18` [INFO] [stderr] --> src/datastruct/tree/red_black_tree.rs:964:17 [INFO] [stderr] | [INFO] [stderr] 964 | let mut node18 = RedBlackNode::from(18); [INFO] [stderr] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_node18` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/datastruct/tree/red_black_tree.rs:962:13 [INFO] [stderr] | [INFO] [stderr] 962 | let mut node15 = RedBlackNode::from(15); [INFO] [stderr] | ----^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/datastruct/tree/red_black_tree.rs:964:13 [INFO] [stderr] | [INFO] [stderr] 964 | let mut node18 = RedBlackNode::from(18); [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/datastruct/graph/adjacency_linklist.rs:209:13 [INFO] [stderr] | [INFO] [stderr] 209 | let mut path = Vec::new(); [INFO] [stderr] | ----^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `start` [INFO] [stderr] --> src/datastruct/graph/adjacency_linklist.rs:215:43 [INFO] [stderr] | [INFO] [stderr] 215 | fn shortest_path_with_dijkstra(&self, start: usize) -> HashMap> {todo!()} [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `a` [INFO] [stderr] --> src/algorithm/bit.rs:100:19 [INFO] [stderr] | [INFO] [stderr] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `b` [INFO] [stderr] --> src/algorithm/bit.rs:100:29 [INFO] [stderr] | [INFO] [stderr] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithm/bit.rs:100:15 [INFO] [stderr] | [INFO] [stderr] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [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/algorithm/bit.rs:100:25 [INFO] [stderr] | [INFO] [stderr] 100 | pub fn div(mut a: T, mut b: T) -> Option<(T, T)> where [INFO] [stderr] | ----^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variant `FindForPredecessor` is never constructed [INFO] [stderr] --> src/datastruct/tree/red_black_tree.rs:33:5 [INFO] [stderr] | [INFO] [stderr] 31 | enum DeleteState<'a, T> where T: PartialOrd + std::fmt::Debug { [INFO] [stderr] | ----------- variant in this enum [INFO] [stderr] 32 | FindForDeleteNode(&'a T), [INFO] [stderr] 33 | FindForPredecessor, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `DeleteState` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stderr] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: function `gen_matrix_with_zero_present_nan` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:30:4 [INFO] [stderr] | [INFO] [stderr] 30 | fn gen_matrix_with_zero_present_nan(m: Vec>) -> Vec>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `gen_matrix_with_zero_present_zero` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:43:4 [INFO] [stderr] | [INFO] [stderr] 43 | fn gen_matrix_with_zero_present_zero(m: Vec>) -> Vec>> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: constant `MATRIX1` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:54:7 [INFO] [stderr] | [INFO] [stderr] 54 | const MATRIX1: [[isize; 6]; 6] = [ [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: constant `MATRIX2` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:63:7 [INFO] [stderr] | [INFO] [stderr] 63 | const MATRIX2: [[isize; 7]; 7] = [ [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: constant `MINSPANTREEFORMATRIX2` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:74:7 [INFO] [stderr] | [INFO] [stderr] 74 | const MINSPANTREEFORMATRIX2: [[isize; 7]; 7] = [ [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: constant `MATRIX3` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:85:7 [INFO] [stderr] | [INFO] [stderr] 85 | const MATRIX3: [[isize; 6]; 6] = [ [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: constant `MATRIX4` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:95:7 [INFO] [stderr] | [INFO] [stderr] 95 | const MATRIX4: [[isize; 7]; 7] = [ [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: fields `max` and `bits` are never read [INFO] [stderr] --> src/datastruct/bitmap/mod.rs:4:5 [INFO] [stderr] | [INFO] [stderr] 3 | pub struct BitMap { [INFO] [stderr] | ------ fields in this struct [INFO] [stderr] 4 | max: usize, [INFO] [stderr] | ^^^ [INFO] [stderr] 5 | bits: usize, [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `BitMap` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::collections::linked_list` [INFO] [stderr] --> src/datastruct/link_list/mod.rs:208:9 [INFO] [stderr] | [INFO] [stderr] 208 | use std::collections::linked_list; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `self` [INFO] [stderr] --> src/datastruct/tree/mod.rs:243:23 [INFO] [stderr] | [INFO] [stderr] 243 | use crate::node::{self, BalancedTreeNode}; [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::char::MAX` [INFO] [stderr] --> src/datastruct/tree/mod.rs:492:9 [INFO] [stderr] | [INFO] [stderr] 492 | use std::char::MAX; [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `crate::datastruct::tree::TreeTrait` [INFO] [stderr] --> src/datastruct/tree/mod.rs:241:9 [INFO] [stderr] | [INFO] [stderr] 241 | use crate::datastruct::tree::TreeTrait; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `test_bfs` is never used [INFO] [stderr] --> src/datastruct/graph/mod.rs:203:8 [INFO] [stderr] | [INFO] [stderr] 203 | fn test_bfs() { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `datastruct-alogritm-rust` (lib) generated 28 warnings (run `cargo fix --lib -p datastruct-alogritm-rust` to apply 12 suggestions) [INFO] [stderr] warning: `datastruct-alogritm-rust` (lib test) generated 27 warnings (22 duplicates) (run `cargo fix --lib -p datastruct-alogritm-rust --tests` to apply 3 suggestions) [INFO] [stderr] warning: unused imports: `adjacency_linklist::GraphAdjacencyLinkList` and `adjacency_matrix::GraphAdjacencyMatrix` [INFO] [stderr] --> src/main.rs:1:51 [INFO] [stderr] | [INFO] [stderr] 1 | use datastruct_alogritm_rust::datastruct::graph::{adjacency_linklist::GraphAdjacencyLinkList, adjacency_matrix::GraphAdjacencyMatrix}; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::binary_search_tree::BinarySearchTree` [INFO] [stderr] --> src/main.rs:5:9 [INFO] [stderr] | [INFO] [stderr] 5 | use datastruct_alogritm_rust::datastruct::tree::binary_search_tree::BinarySearchTree; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::TreeTrait` [INFO] [stderr] --> src/main.rs:6:9 [INFO] [stderr] | [INFO] [stderr] 6 | use datastruct_alogritm_rust::datastruct::tree::TreeTrait; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::rc::Rc` [INFO] [stderr] --> src/main.rs:7:9 [INFO] [stderr] | [INFO] [stderr] 7 | use std::rc::Rc; [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `std::cell::RefCell` [INFO] [stderr] --> src/main.rs:8:9 [INFO] [stderr] | [INFO] [stderr] 8 | use std::cell::RefCell; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::node::TreeNode` [INFO] [stderr] --> src/main.rs:9:9 [INFO] [stderr] | [INFO] [stderr] 9 | use datastruct_alogritm_rust::node::TreeNode; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::algorithm::sort::*` [INFO] [stderr] --> src/main.rs:10:9 [INFO] [stderr] | [INFO] [stderr] 10 | use datastruct_alogritm_rust::algorithm::sort::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::algorithm::string::*` [INFO] [stderr] --> src/main.rs:11:9 [INFO] [stderr] | [INFO] [stderr] 11 | use datastruct_alogritm_rust::algorithm::string::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused imports: `Rng` and `thread_rng` [INFO] [stderr] --> src/main.rs:12:16 [INFO] [stderr] | [INFO] [stderr] 12 | use rand::{Rng, thread_rng}; [INFO] [stderr] | ^^^ ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::tire::tire::Trie` [INFO] [stderr] --> src/main.rs:13:9 [INFO] [stderr] | [INFO] [stderr] 13 | use datastruct_alogritm_rust::datastruct::tire::tire::Trie; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::graph::*` [INFO] [stderr] --> src/main.rs:14:9 [INFO] [stderr] | [INFO] [stderr] 14 | use datastruct_alogritm_rust::datastruct::graph::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::graph::union_find_set::UnionFindSet` [INFO] [stderr] --> src/main.rs:15:9 [INFO] [stderr] | [INFO] [stderr] 15 | use datastruct_alogritm_rust::datastruct::graph::union_find_set::UnionFindSet; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::link_list::doubly_link_list::*` [INFO] [stderr] --> src/main.rs:16:9 [INFO] [stderr] | [INFO] [stderr] 16 | use datastruct_alogritm_rust::datastruct::link_list::doubly_link_list::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::balanced_binary_tree::BalancedBinaryTree` [INFO] [stderr] --> src/main.rs:17:9 [INFO] [stderr] | [INFO] [stderr] 17 | use datastruct_alogritm_rust::datastruct::tree::balanced_binary_tree::BalancedBinaryTree; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::b_tree::BTree` [INFO] [stderr] --> src/main.rs:18:9 [INFO] [stderr] | [INFO] [stderr] 18 | use datastruct_alogritm_rust::datastruct::tree::b_tree::BTree; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: unused import: `datastruct_alogritm_rust::datastruct::tree::red_black_tree::RedBlackTree` [INFO] [stderr] --> src/main.rs:19:9 [INFO] [stderr] | [INFO] [stderr] 19 | use datastruct_alogritm_rust::datastruct::tree::red_black_tree::RedBlackTree; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/main.rs:21:9 [INFO] [stderr] | [INFO] [stderr] 21 | let mut number1 = Number::from_dec("789", 1000).unwrap(); [INFO] [stderr] | ----^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: `datastruct-alogritm-rust` (bin "datastruct-alogritm-rust" test) generated 17 warnings (run `cargo fix --bin "datastruct-alogritm-rust" --tests` to apply 17 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.07s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/datastruct_alogritm_rust-b8c6ab3f56eff26b) [INFO] [stdout] test algorithm::string::test_single_pattern_match::test_rk ... ok [INFO] [stdout] test algorithm::test_sort::test_count_sort ... ok [INFO] [stdout] test algorithm::test_sort::test_merge_sort ... ok [INFO] [stdout] test algorithm::test_sort::test_bucket_sort ... ok [INFO] [stdout] test algorithm::test_sort::test_heap_sort ... ok [INFO] [stdout] test algorithm::test_sort::test_radix_sort ... ok [INFO] [stdout] test datastruct::bitmap::test_bitmap::test_bitmap ... ok [INFO] [stdout] test datastruct::graph::test_graph_adjacency_linklist::test_dfs ... ok [INFO] [stdout] test datastruct::graph::test_graph_adjacency_matrix::test_bfs ... ok [INFO] [stdout] test datastruct::graph::test_graph_adjacency_matrix::test_dfs ... ok [INFO] [stdout] test datastruct::graph::test_graph_adjacency_matrix::test_mst_kruskal ... ok [INFO] [stdout] test datastruct::graph::test_graph_adjacency_matrix::test_mst_prime ... ok [INFO] [stdout] test datastruct::graph::test_graph_adjacency_matrix::test_sp_dijkstra ... ok [INFO] [stdout] test datastruct::graph::test_graph_adjacency_matrix::test_sp_floyd ... ok [INFO] [stdout] test algorithm::test_sort::test_quick_sort ... ok [INFO] [stdout] test algorithm::test_sort::test_shell_sort ... ok [INFO] [stdout] test datastruct::link_list::test_doubly_link_list::test_clear ... ok [INFO] [stdout] test datastruct::link_list::test_doubly_link_list::test_countains ... ok [INFO] [stdout] test datastruct::link_list::test_doubly_link_list::test_insert ... ok [INFO] [stdout] test datastruct::link_list::test_doubly_link_list::test_is_empty ... ok [INFO] [stdout] test datastruct::link_list::test_doubly_link_list::test_push_pop ... ok [INFO] [stdout] test datastruct::link_list::test_doubly_link_list::test_remove ... ok [INFO] [stdout] test datastruct::link_list::test_singly_link_list::test_clear ... ok [INFO] [stdout] test datastruct::link_list::test_singly_link_list::test_contains ... ok [INFO] [stdout] test datastruct::link_list::test_singly_link_list::test_empty ... ok [INFO] [stdout] test datastruct::link_list::test_singly_link_list::test_init ... ok [INFO] [stdout] test datastruct::link_list::test_singly_link_list::test_insert ... ok [INFO] [stdout] test datastruct::link_list::test_singly_link_list::test_len ... ok [INFO] [stdout] test datastruct::link_list::test_singly_link_list::test_remove ... ok [INFO] [stdout] test datastruct::stack::test_stack::test_stack ... ok [INFO] [stdout] test datastruct::tire::test_tire::test_delete ... ok [INFO] [stdout] test datastruct::tire::test_tire::test_insert ... ok [INFO] [stdout] test datastruct::tire::test_tire::test_query ... ok [INFO] [stdout] test datastruct::tire::test_tire::test_query_prefix ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_append_to_leaf_with_once_upoverflow ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_append_to_leaf_without_overflow ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_append_to_root_with_upoverflow ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_append_to_root_without_overflow ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_append_with_multiple_upoverflow ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_delete_adjust_by_merge ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_delete_to_leaf_with_once_underoverflow ... ok [INFO] [stdout] test datastruct::tree::test_b_tree::test_delete_without_underoverflow ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_append_base ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_append_ll ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_append_lr ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_append_rl ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_append_rr ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_delete_ll ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_delete_lr ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_delete_rl ... ok [INFO] [stdout] test datastruct::tree::test_balanced_binary_tree::test_delete_rr ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_append ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_contains ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_delete ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_depth ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_in_order_traversal ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_level_order_traversal ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_post_order_traversal ... ok [INFO] [stdout] test datastruct::tree::test_binary_search_tree::test_pre_order_traversal ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_append_base ... ok [INFO] [stdout] test datastruct::heap::test_heap::test_max_heap ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_append_change_color_once ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_append_ll ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_append_multiple_adjsut ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_append_rl ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_append_lr ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_append_rr ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_black_sbling_and_black_children_and_red_parent ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_black_sbling_and_black_children_and_black_parent ... ok [INFO] [stdout] test datastruct::heap::test_heap::test_min_heap ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_ll ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_black_sbling_and_black_children_and_root_parent ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_just_a_node ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_node_with_a_left_child ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_lr ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_node_with_a_right_child ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_red_sbling ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_red_without_children ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_rl ... ok [INFO] [stdout] test datastruct::tree::test_red_black_tree::test_delete_rr ... ok [INFO] [stdout] test algorithm::string::test_single_pattern_match::test_kmp ... ok [INFO] [stdout] test algorithm::string::test_single_pattern_match::test_brute_force ... ok [INFO] [stdout] test algorithm::test_sort::test_select_sort ... ok [INFO] [stdout] test algorithm::test_sort::test_bubble_sort ... ok [INFO] [stdout] test algorithm::test_sort::test_insert_sort ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 91 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 17.68s [INFO] [stdout] [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/debug/deps/datastruct_alogritm_rust-2db96f3e2ad2eb9a) [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; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Doc-tests datastruct_alogritm_rust [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; finished in 0.00s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "a4a46094c9144770a4758212f56f7b23d964ba9a38bdbe319eef17b2973d61b9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a4a46094c9144770a4758212f56f7b23d964ba9a38bdbe319eef17b2973d61b9", kill_on_drop: false }` [INFO] [stdout] a4a46094c9144770a4758212f56f7b23d964ba9a38bdbe319eef17b2973d61b9