[INFO] cloning repository https://github.com/HorseXInsectCoder/rust_datastruct [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/HorseXInsectCoder/rust_datastruct" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FHorseXInsectCoder%2Frust_datastruct", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FHorseXInsectCoder%2Frust_datastruct'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] e076a2e06c9fcf375764a74d31ae4c78e6e5b1a3 [INFO] checking HorseXInsectCoder/rust_datastruct/e076a2e06c9fcf375764a74d31ae4c78e6e5b1a3 against master#ab869e094a907cc5d19b4080f22eccaf347f1f95 for pr-129604 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FHorseXInsectCoder%2Frust_datastruct" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/HorseXInsectCoder/rust_datastruct on toolchain ab869e094a907cc5d19b4080f22eccaf347f1f95 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/HorseXInsectCoder/rust_datastruct [INFO] finished tweaking git repo https://github.com/HorseXInsectCoder/rust_datastruct [INFO] tweaked toml for git repo https://github.com/HorseXInsectCoder/rust_datastruct written to /workspace/builds/worker-1-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/HorseXInsectCoder/rust_datastruct 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" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 27f5427bc29c76b86025eae726530a01c7e70b1e05405a42bec84f7ddf241716 [INFO] running `Command { std: "docker" "start" "-a" "27f5427bc29c76b86025eae726530a01c7e70b1e05405a42bec84f7ddf241716", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "27f5427bc29c76b86025eae726530a01c7e70b1e05405a42bec84f7ddf241716", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "27f5427bc29c76b86025eae726530a01c7e70b1e05405a42bec84f7ddf241716", kill_on_drop: false }` [INFO] [stdout] 27f5427bc29c76b86025eae726530a01c7e70b1e05405a42bec84f7ddf241716 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 8b5cb4e14af8183c07115be9077dca57186c6084a29f05e6946d38cf053d18a4 [INFO] running `Command { std: "docker" "start" "-a" "8b5cb4e14af8183c07115be9077dca57186c6084a29f05e6946d38cf053d18a4", kill_on_drop: false }` [INFO] [stderr] Compiling proc-macro2 v1.0.66 [INFO] [stderr] Compiling unicode-ident v1.0.11 [INFO] [stderr] Compiling thiserror v1.0.43 [INFO] [stderr] Compiling quote v1.0.31 [INFO] [stderr] Compiling syn v2.0.26 [INFO] [stderr] Compiling thiserror-impl v1.0.43 [INFO] [stderr] Checking rust_datastruct v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `std::ops::Index` [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::ops::Index; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Sub` [INFO] [stdout] --> src/bin_search/binary_search.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Sub; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow` [INFO] [stdout] --> src/sort/quick_sort.rs:1:19 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/graph/adj_matrix.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fs::File; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, and `Read` [INFO] [stdout] --> src/graph/adj_matrix.rs:3:24 [INFO] [stdout] | [INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/graph/adj_matrix.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::path::Path; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `MatrixError` [INFO] [stdout] --> src/graph/adj_matrix.rs:6:43 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `fmt` and `io` [INFO] [stdout] --> src/graph/error.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{fmt, io, result}; [INFO] [stdout] | ^^^ ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/graph/adj_list.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fs::File; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, and `Read` [INFO] [stdout] --> src/graph/adj_list.rs:4:24 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/graph/adj_list.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::path::Path; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `MatrixError` [INFO] [stdout] --> src/graph/adj_list.rs:7:43 [INFO] [stdout] | [INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/graph/adj_set.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fs::File; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, and `Read` [INFO] [stdout] --> src/graph/adj_set.rs:4:24 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/graph/adj_set.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::path::Path; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `MatrixError` [INFO] [stdout] --> src/graph/adj_set.rs:7:43 [INFO] [stdout] | [INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `MatrixError::*` and `MatrixError` [INFO] [stdout] --> src/graph/adj_iterable.rs:200:27 [INFO] [stdout] | [INFO] [stdout] 200 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/graph_dfs.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/cc.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/single_source_path.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/path.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/cycle_detection.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/bi_partition_detection.rs:2:17 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/graph/graph_bfs.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/graph/single_path_bfs.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/graph/u_s_s_s_path.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Index` [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::ops::Index; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Sub` [INFO] [stdout] --> src/bin_search/binary_search.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Sub; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow` [INFO] [stdout] --> src/sort/quick_sort.rs:1:19 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/graph/adj_matrix.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fs::File; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, and `Read` [INFO] [stdout] --> src/graph/adj_matrix.rs:3:24 [INFO] [stdout] | [INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/graph/adj_matrix.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::path::Path; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `MatrixError` [INFO] [stdout] --> src/graph/adj_matrix.rs:6:43 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `fmt` and `io` [INFO] [stdout] --> src/graph/error.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{fmt, io, result}; [INFO] [stdout] | ^^^ ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/graph/adj_list.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fs::File; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, and `Read` [INFO] [stdout] --> src/graph/adj_list.rs:4:24 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/graph/adj_list.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::path::Path; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `MatrixError` [INFO] [stdout] --> src/graph/adj_list.rs:7:43 [INFO] [stdout] | [INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/graph/adj_set.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fs::File; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufReader`, `ErrorKind`, and `Read` [INFO] [stdout] --> src/graph/adj_set.rs:4:24 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^^^ ^^^^^^^^^ ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/graph/adj_set.rs:5:5 [INFO] [stdout] | [INFO] [stdout] 5 | use std::path::Path; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `MatrixError` [INFO] [stdout] --> src/graph/adj_set.rs:7:43 [INFO] [stdout] | [INFO] [stdout] 7 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `MatrixError::*` and `MatrixError` [INFO] [stdout] --> src/graph/adj_iterable.rs:200:27 [INFO] [stdout] | [INFO] [stdout] 200 | use crate::graph::error::{MatrixError::*, MatrixError, Result}; [INFO] [stdout] | ^^^^^^^^^^^^^^ ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/graph_dfs.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/cc.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/single_source_path.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/path.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/cycle_detection.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Ref` [INFO] [stdout] --> src/graph/bi_partition_detection.rs:2:17 [INFO] [stdout] | [INFO] [stdout] 2 | use std::cell::{Ref, RefCell}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/graph/graph_bfs.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/graph/single_path_bfs.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/graph/u_s_s_s_path.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/graph/adj_matrix.rs:3:15 [INFO] [stdout] | [INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/graph/adj_list.rs:4:15 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/graph/adj_set.rs:4:15 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Borrow` [INFO] [stdout] --> src/graph/bi_partition_detection.rs:1:19 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BorrowMut` [INFO] [stdout] --> src/graph/bi_partition_detection.rs:1:27 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/graph/graph_bfs.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/graph/single_path_bfs.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/graph/u_s_s_s_path.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `i` is assigned to, but never used [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:126:13 [INFO] [stdout] | [INFO] [stdout] 126 | let mut i = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_i` instead [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/deque/deque.rs:82:13 [INFO] [stdout] | [INFO] [stdout] 82 | let mut iterator = Iter { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `index` is never read [INFO] [stdout] --> src/vec/vec_impl.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 163 | index += 1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `times` [INFO] [stdout] --> src/bin_search/interpolation_search.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let mut times = 0; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_times` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/bin_search/interpolation_search.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | let mut times = 0; [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/hash_search/hash.rs:121:17 [INFO] [stdout] | [INFO] [stdout] 121 | let mut curr = pos; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `len` is never read [INFO] [stdout] --> src/sort/bubble_sort.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | len -= 1; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `key` [INFO] [stdout] --> src/tree/bst.rs:196:26 [INFO] [stdout] | [INFO] [stdout] 196 | Some(key) => (self.key.as_ref(), self.val.as_ref()), [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `key` [INFO] [stdout] --> src/tree/avl.rs:211:26 [INFO] [stdout] | [INFO] [stdout] 211 | Some(key) => (self.key.as_ref(), self.val.as_ref()), [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/pra/bst_prac.rs:245:13 [INFO] [stdout] | [INFO] [stdout] 245 | let mut size = self.size(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/graph/adj_matrix.rs:39:27 [INFO] [stdout] | [INFO] [stdout] 39 | .map(|(v, e)| self.read_second2end(&content, vec![vec![0; v]; v]).unwrap_or_default()) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/adj_matrix.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/adj_matrix.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/graph/adj_matrix.rs:74:18 [INFO] [stdout] | [INFO] [stdout] 74 | let (v, _) = AdjMatrix::read_v_e(&content).unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/graph/adj_list.rs:38:27 [INFO] [stdout] | [INFO] [stdout] 38 | .map(|(v, e)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/adj_list.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/adj_list.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/adj_list.rs:124:25 [INFO] [stdout] | [INFO] [stdout] 124 | fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/graph/adj_set.rs:38:27 [INFO] [stdout] | [INFO] [stdout] 38 | .map(|(v, e)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/adj_set.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/adj_set.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/adj_set.rs:123:25 [INFO] [stdout] | [INFO] [stdout] 123 | fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/graph.rs:74:17 [INFO] [stdout] | [INFO] [stdout] 74 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/graph.rs:75:17 [INFO] [stdout] | [INFO] [stdout] 75 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/graph.rs:105:29 [INFO] [stdout] | [INFO] [stdout] 105 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/graph/adj_matrix.rs:3:15 [INFO] [stdout] | [INFO] [stdout] 3 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/graph/adj_list.rs:4:15 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BufRead` [INFO] [stdout] --> src/graph/adj_set.rs:4:15 [INFO] [stdout] | [INFO] [stdout] 4 | use std::io::{BufRead, BufReader, ErrorKind, Read, Write}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Borrow` [INFO] [stdout] --> src/graph/bi_partition_detection.rs:1:19 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BorrowMut` [INFO] [stdout] --> src/graph/bi_partition_detection.rs:1:27 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/graph/graph_bfs.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/graph/single_path_bfs.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/graph/u_s_s_s_path.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `i` is assigned to, but never used [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:126:13 [INFO] [stdout] | [INFO] [stdout] 126 | let mut i = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_i` instead [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/graph_test.rs:75:17 [INFO] [stdout] | [INFO] [stdout] 75 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/graph_test.rs:76:17 [INFO] [stdout] | [INFO] [stdout] 76 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/graph_test.rs:106:29 [INFO] [stdout] | [INFO] [stdout] 106 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [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/deque/deque.rs:82:13 [INFO] [stdout] | [INFO] [stdout] 82 | let mut iterator = Iter { [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `hash_search::hash::Iter<'_, T>` is more private than the item `hash_search::hash::HashMap::::iter` [INFO] [stdout] --> src/hash_search/hash.rs:185:5 [INFO] [stdout] | [INFO] [stdout] 185 | pub fn iter(&self) -> Iter { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::::iter` is reachable at visibility `pub(hash_search)` [INFO] [stdout] | [INFO] [stdout] note: but type `hash_search::hash::Iter<'_, T>` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/hash_search/hash.rs:202:1 [INFO] [stdout] | [INFO] [stdout] 202 | struct Iter<'a, T> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] = note: `#[warn(private_interfaces)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `index` is never read [INFO] [stdout] --> src/vec/vec_impl.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 163 | index += 1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `hash_search::hash::IterMut<'_, T>` is more private than the item `hash_search::hash::HashMap::::iter_mut` [INFO] [stdout] --> src/hash_search/hash.rs:193:5 [INFO] [stdout] | [INFO] [stdout] 193 | pub fn iter_mut(&mut self) -> IterMut { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::::iter_mut` is reachable at visibility `pub(hash_search)` [INFO] [stdout] | [INFO] [stdout] note: but type `hash_search::hash::IterMut<'_, T>` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/hash_search/hash.rs:213:1 [INFO] [stdout] | [INFO] [stdout] 213 | struct IterMut<'a, T> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `par_checker1` is never used [INFO] [stdout] --> src/stack/parentheses_matching/parentheses_matching.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn par_checker1(par: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `infix_to_suffix` is never used [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn infix_to_suffix(infix: &str) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `suffix_eval` is never used [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:66:4 [INFO] [stdout] | [INFO] [stdout] 66 | fn suffix_eval(suffix: &str) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `do_calc` is never used [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:89:4 [INFO] [stdout] | [INFO] [stdout] 89 | fn do_calc(op: &str, op1: i32, op2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `infix_to_prefix` is never used [INFO] [stdout] --> src/stack/suffix/infix_to_suffix.rs:107:4 [INFO] [stdout] | [INFO] [stdout] 107 | fn infix_to_prefix(infix: &str) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `divide_by_two` is never used [INFO] [stdout] --> src/stack/nsc/number_system_conv.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn divide_by_two(mut dec_num: u32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `base_converter` is never used [INFO] [stdout] --> src/stack/nsc/number_system_conv.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn base_converter(mut dec_num: u32, base: u32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hot_potato` is never used [INFO] [stdout] --> src/queue/hot_potato/potato.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn hot_potato(names: Vec<&str>, num: usize) -> &str { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `nums_sum` is never used [INFO] [stdout] --> src/recursion/recursion.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn nums_sum(nums: &[i32]) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hanoi` is never used [INFO] [stdout] --> src/recursion/hanoi.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn hanoi(height: u32, src_p: &str, des_p: &str, mid_p: &str) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `BASE_STR` is never used [INFO] [stdout] --> src/recursion/num2str_rec.rs:2:7 [INFO] [stdout] | [INFO] [stdout] 2 | const BASE_STR: [&str; 16] = ["0", "1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"]; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `num2str_rec` is never used [INFO] [stdout] --> src/recursion/num2str_rec.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn num2str_rec(num: i32, base: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rec_mc1` is never used [INFO] [stdout] --> src/dp/rec_cm1.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn rec_mc1(cashes: &[u32], amount: u32) -> u32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rec_mc2` is never used [INFO] [stdout] --> src/dp/rec_cm2.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn rec_mc2(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dp_rec_mc` is never used [INFO] [stdout] --> src/dp/dp_rec_mc.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn dp_rec_mc(cashes: &[u32], amount: u32, min_cashes: &mut [u32]) -> u32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dp_rec_mc_show` is never used [INFO] [stdout] --> src/dp/dp_rec_mc_show.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn dp_rec_mc_show(cashes: &[u32], amount: u32, min_cashes: &mut [u32], cashes_used: &mut [u32]) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_cashes` is never used [INFO] [stdout] --> src/dp/dp_rec_mc_show.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn print_cashes(cashes_used: &[u32], mut amount: u32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_str_v1` is never used [INFO] [stdout] --> src/dp/longest_substr.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn longest_str_v1(nums: &[i32], i: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_str_v2` is never used [INFO] [stdout] --> src/dp/longest_substr.rs:21:4 [INFO] [stdout] | [INFO] [stdout] 21 | fn longest_str_v2(nums: &[i32], i: u32, memo: &mut HashMap) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sequential_search` is never used [INFO] [stdout] --> src/bin_search/sequential_search.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn sequential_search(nums: &[i32], num: i32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `order_sequential_search` is never used [INFO] [stdout] --> src/bin_search/order_sequential_search.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn order_sequential_search(nums: &[i32], num: i32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> src/bin_search/binary_search.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn binary_search(nums: &[i32], num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `interpolation_search` is never used [INFO] [stdout] --> src/bin_search/interpolation_search.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn interpolation_search(nums: &[i32], target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `exponential_search` is never used [INFO] [stdout] --> src/bin_search/exponential_search.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn exponential_search(nums: &[i32], target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/hash_search/hash.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl HashMap { [INFO] [stdout] | ----------------------------------------------- associated items in this implementation [INFO] [stdout] 9 | pub fn new(cap: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn clear(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn hash(&self, key: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn rehash(&self, pos: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn insert(&mut self, key: usize, value: T) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 101 | pub fn remove(&mut self, key: usize) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 143 | pub fn get_pos(&self, key: usize) -> usize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 168 | pub fn get(&self, key: usize) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 173 | pub fn get_mut(&mut self, key: usize) -> Option<&mut T> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 178 | pub fn contains(&self, key: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 185 | pub fn iter(&self) -> Iter { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 193 | pub fn iter_mut(&mut self) -> IterMut { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Iter` is never constructed [INFO] [stdout] --> src/hash_search/hash.rs:202:8 [INFO] [stdout] | [INFO] [stdout] 202 | struct Iter<'a, T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `IterMut` is never constructed [INFO] [stdout] --> src/hash_search/hash.rs:213:8 [INFO] [stdout] | [INFO] [stdout] 213 | struct IterMut<'a, T> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort` is never used [INFO] [stdout] --> src/sort/bubble_sort.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn bubble_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bubble_sort2` is never used [INFO] [stdout] --> src/sort/bubble_sort.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn bubble_sort2(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quick_sort` is never used [INFO] [stdout] --> src/sort/quick_sort.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn quick_sort(arr: &mut [T]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition2` is never used [INFO] [stdout] --> src/sort/quick_sort.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn partition2(arr: &mut [T], low: usize, high: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_sort` is never used [INFO] [stdout] --> src/sort/merge_sort.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn merge_sort(nums: &mut [i32]) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/sort/merge_sort.rs:14:4 [INFO] [stdout] | [INFO] [stdout] 14 | fn merge(nums: &mut [T], mid: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parent` is never used [INFO] [stdout] --> src/sort/heap_sort.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn parent(idx: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `left_child` is never used [INFO] [stdout] --> src/sort/heap_sort.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn left_child(idx: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_child` is never used [INFO] [stdout] --> src/sort/heap_sort.rs:14:4 [INFO] [stdout] | [INFO] [stdout] 14 | fn right_child(idx: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `heap_sort` is never used [INFO] [stdout] --> src/sort/heap_sort.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn heap_sort(arr: &mut [T]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `heapify` is never used [INFO] [stdout] --> src/sort/heap_sort.rs:53:4 [INFO] [stdout] | [INFO] [stdout] 53 | fn heapify(arr: &mut [T], n: usize, i: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTree` is never constructed [INFO] [stdout] --> src/tree/binary_tree.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/binary_tree.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- associated items in this implementation [INFO] [stdout] 15 | pub fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn insert_left_tree(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn insert_right_tree(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn get_key(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn set_key(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn min(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn max(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 131 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 135 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 153 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 165 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 177 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 189 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:218:4 [INFO] [stdout] | [INFO] [stdout] 218 | fn preorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:226:4 [INFO] [stdout] | [INFO] [stdout] 226 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:234:4 [INFO] [stdout] | [INFO] [stdout] 234 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/tree/binary_heap.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct BinaryHeap { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/binary_heap.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl BinaryHeap { [INFO] [stdout] | ---------------------------------- associated items in this implementation [INFO] [stdout] 9 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn push(&mut self, val: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn heapify(&mut self, n: usize, curr: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn h_sort(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/tree/bst.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BST` is never constructed [INFO] [stdout] --> src/tree/bst.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct BST { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/bst.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 15 | / impl BST [INFO] [stdout] 16 | | where T: Copy + Ord + Debug, [INFO] [stdout] 17 | | U: Copy + Debug, [INFO] [stdout] | |__________________________- associated items in this implementation [INFO] [stdout] 18 | { [INFO] [stdout] 19 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | fn insert(&mut self, key: T, val: U) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 154 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 177 | fn min(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 190 | fn max(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 203 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 207 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 212 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 235 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 247 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 259 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 272 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/tree/avl.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AVLTree` is never constructed [INFO] [stdout] --> src/tree/avl.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct AVLTree { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/avl.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 16 | / impl AVLTree [INFO] [stdout] 17 | | where T: Copy + Ord + Debug, [INFO] [stdout] 18 | | U: Copy + Debug, [INFO] [stdout] | |__________________________- associated items in this implementation [INFO] [stdout] 19 | { [INFO] [stdout] 20 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn get_height(&self) -> isize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn get_balance_factor(&self) -> isize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn insert(&mut self, key: T, val: U) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 169 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 192 | fn min_val(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 205 | fn max_val(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 218 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 222 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 227 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 250 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 262 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 274 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 287 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Queue` is never constructed [INFO] [stdout] --> src/tree/bst_ori.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Queue { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `len` are never used [INFO] [stdout] --> src/tree/bst_ori.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Queue { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 14 | fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn enqueue(&mut self, val: T) -> Result<(), String> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn dequeue(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:48:6 [INFO] [stdout] | [INFO] [stdout] 48 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BST` is never constructed [INFO] [stdout] --> src/tree/bst_ori.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct BST { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/tree/bst_ori.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 59 | / impl BST [INFO] [stdout] 60 | | where T: Copy + Ord + Debug, [INFO] [stdout] 61 | | U: Copy + Debug [INFO] [stdout] | |_________________________- associated items in this implementation [INFO] [stdout] 62 | { [INFO] [stdout] 63 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 126 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 140 | fn insert(&mut self, key: T, val: U) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 180 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 204 | fn min(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 215 | fn max(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 227 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 231 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 236 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 260 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 272 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 284 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 296 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:319:4 [INFO] [stdout] | [INFO] [stdout] 319 | fn preorder(bst: Link) [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:330:4 [INFO] [stdout] | [INFO] [stdout] 330 | fn inorder(bst: Link) [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:341:4 [INFO] [stdout] | [INFO] [stdout] 341 | fn postorder(bst: Link) [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `levelorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:352:4 [INFO] [stdout] | [INFO] [stdout] 352 | fn levelorder(bst: Link) [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/pra/bst_prac.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BST` is never constructed [INFO] [stdout] --> src/pra/bst_prac.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct BST { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/pra/bst_prac.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 15 | / impl BST [INFO] [stdout] 16 | | where T: Copy + Debug + Ord, [INFO] [stdout] 17 | | U: Copy + Debug [INFO] [stdout] | |_________________________- associated items in this implementation [INFO] [stdout] 18 | { [INFO] [stdout] 19 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | fn insert(&mut self, key: T, val: U) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn min(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 162 | fn max(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 172 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 176 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 180 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 203 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 216 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 230 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 244 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AdjMatrix` is never constructed [INFO] [stdout] --> src/graph/adj_matrix.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub struct AdjMatrix { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `AdjMatrix` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/graph/adj_matrix.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl AdjMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 16 | // 读取文件 [INFO] [stdout] 17 | fn new(file_path: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn init_matrix(&mut self) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn validate_vertex(&self, v: usize) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn read_second2end(&self, content: &String, mut adj: Vec>) -> Result>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | fn read_file(file_path: &str) -> Result { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 115 | fn read_v_e>(s: S) -> Result<(usize, usize)> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 133 | fn print_adj(&self, adj: Vec>) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 160 | fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 168 | fn adj(&self, v: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 183 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Result` is never used [INFO] [stdout] --> src/graph/error.rs:4:10 [INFO] [stdout] | [INFO] [stdout] 4 | pub type Result = result::Result; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `ReadFileError`, `PrintMatrixError`, `VertexError`, `InvalidVertexEdge`, `SelfLoop`, and `ParallelEdge` are never constructed [INFO] [stdout] --> src/graph/error.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 7 | pub enum MatrixError { [INFO] [stdout] | ----------- variants in this enum [INFO] [stdout] 8 | #[error("failed to read file")] [INFO] [stdout] 9 | ReadFileError, [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | PrintMatrixError, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | VertexError, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | InvalidVertexEdge(usize, usize), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | SelfLoop, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | ParallelEdge [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `MatrixError` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AdjList` is never constructed [INFO] [stdout] --> src/graph/adj_list.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 10 | pub struct AdjList { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `AdjList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/graph/adj_list.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl AdjList { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 17 | // 读取文件 [INFO] [stdout] 18 | fn new(file_path: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn init_matrix(&mut self) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn validate_vertex(&self, v: usize) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn read_second2end(&self, content: &String, mut adj: Vec>) -> Result>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | fn read_file(file_path: &str) -> Result { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | fn read_v_e>(s: S) -> Result<(usize, usize)> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 142 | fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 151 | fn adj(&self, v: usize) -> &LinkedList { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 160 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AdjSet` is never constructed [INFO] [stdout] --> src/graph/adj_set.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 10 | pub struct AdjSet { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `AdjSet` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/graph/adj_set.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl AdjSet { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 17 | // 读取文件 [INFO] [stdout] 18 | fn new(file_path: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn init_matrix(&mut self) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn validate_vertex(&self, v: usize) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn read_second2end(&self, content: &String, mut adj: Vec>) -> Result>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn read_file(file_path: &str) -> Result { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn read_v_e>(s: S) -> Result<(usize, usize)> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 123 | fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn adj(&self, v: usize) -> &BTreeSet { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 159 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `AdjIterable` is never used [INFO] [stdout] --> src/graph/adj_iterable.rs:202:11 [INFO] [stdout] | [INFO] [stdout] 202 | pub trait AdjIterable { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/graph/graph.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 10 | pub struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Graph` 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 variable: `times` [INFO] [stdout] --> src/bin_search/interpolation_search.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let mut times = 0; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_times` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/graph/graph.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 17 | // 读取文件 [INFO] [stdout] 18 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn init_matrix(&mut self, file_path: &str) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn validate_vertex(&self, v: usize) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn read_file(file_path: &str) -> Result { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn read_data>(&mut self, s: S) -> Result<(usize, usize, Vec>)> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 123 | pub fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 132 | pub fn adj(&self, v: usize) -> &BTreeSet { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `GraphDFS` is never constructed [INFO] [stdout] --> src/graph/graph_dfs.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct GraphDFS { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/bin_search/interpolation_search.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | let mut times = 0; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `process`, `order`, and `dfs` are never used [INFO] [stdout] --> src/graph/graph_dfs.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl GraphDFS { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 16 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn process(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn dfs(&self, v: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CC` is never constructed [INFO] [stdout] --> src/graph/cc.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct CC { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/graph/cc.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl CC { [INFO] [stdout] | ------- associated items in this implementation [INFO] [stdout] 15 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn process(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | fn count_cc(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn dfs(&self, v: i32, ccid: RefCell) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn is_connected(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn components(&self) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SingleSourcePath` is never constructed [INFO] [stdout] --> src/graph/single_source_path.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct SingleSourcePath { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used [INFO] [stdout] --> src/graph/single_source_path.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl SingleSourcePath { [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 18 | // 传入单源的顶点 [INFO] [stdout] 19 | fn new(s: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn process(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn dfs(&self, v: usize, parent: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn is_connected(&self, t: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | fn path(&self, t: usize) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Path` is never constructed [INFO] [stdout] --> src/graph/path.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Path { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, `is_connected`, and `path` are never used [INFO] [stdout] --> src/graph/path.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 21 | impl Path { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 22 | // 传入单源的顶点 [INFO] [stdout] 23 | fn new(s: usize, t: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn process(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn dfs(&self, v: usize, parent: usize) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn is_connected(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn path(&self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CycleDetection` is never constructed [INFO] [stdout] --> src/graph/cycle_detection.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct CycleDetection { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `process`, `order`, `dfs`, and `has_cycle` are never used [INFO] [stdout] --> src/graph/cycle_detection.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl CycleDetection { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 13 | fn new(file_path: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn process(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn dfs(&self, v: usize, parent: usize) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn has_cycle(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `GraphTest` is never constructed [INFO] [stdout] --> src/graph/graph_test.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct GraphTest { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `GraphTest` 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: multiple associated items are never used [INFO] [stdout] --> src/graph/graph_test.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl GraphTest { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 18 | // 读取文件 [INFO] [stdout] 19 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn init_matrix(&mut self, file_path: &str) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn validate_vertex(&self, v: usize) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn read_file(file_path: &str) -> Result { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn read_data>(&mut self, s: S) -> Result<(usize, usize, Vec>)> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | pub fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 133 | pub fn adj(&self, v: usize) -> &BTreeSet { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 142 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BiPartitionDetection` is never constructed [INFO] [stdout] --> src/graph/bi_partition_detection.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct BiPartitionDetection { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `process`, `dfs`, and `is_bipartite` are never used [INFO] [stdout] --> src/graph/bi_partition_detection.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl BiPartitionDetection { [INFO] [stdout] | ------------------------- associated items in this implementation [INFO] [stdout] 15 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn process(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn dfs(&self, v: usize, color: i32) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn is_bipartite(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `GraphBFS` is never constructed [INFO] [stdout] --> src/graph/graph_bfs.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct GraphBFS { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `process`, `bfs`, and `order` are never used [INFO] [stdout] --> src/graph/graph_bfs.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl GraphBFS { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 14 | fn new(file_path: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn process(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn bfs(&self, s: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SinglePathGraphBFS` is never constructed [INFO] [stdout] --> src/graph/single_path_bfs.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct SinglePathGraphBFS { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `process`, `bfs`, `order`, `is_connected_to`, and `path` are never used [INFO] [stdout] --> src/graph/single_path_bfs.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl SinglePathGraphBFS { [INFO] [stdout] | ----------------------- associated items in this implementation [INFO] [stdout] 16 | fn new(file_path: &str, source: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn process(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn bfs(&self, source: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn is_connected_to(&self, t: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn path(&self, target: usize) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `USSSPath` is never constructed [INFO] [stdout] --> src/graph/u_s_s_s_path.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct USSSPath { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/graph/u_s_s_s_path.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl USSSPath { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 18 | fn new(file_path: &str, source: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn process(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn bfs(&self, s: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn is_connected_to(&self, t: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn path(&self, target: usize) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 101 | fn dis(&self, target: usize) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `std::result::Result` that must be used [INFO] [stdout] --> src/deque/palindrome/palindrome.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | d.add_rear(c); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 6 | let _ = d.add_rear(c); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/hash_search/hash.rs:121:17 [INFO] [stdout] | [INFO] [stdout] 121 | let mut curr = pos; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/adj_matrix.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/adj_list.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/adj_set.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/graph.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/graph_test.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `len` is never read [INFO] [stdout] --> src/sort/bubble_sort.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | len -= 1; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `key` [INFO] [stdout] --> src/tree/bst.rs:196:26 [INFO] [stdout] | [INFO] [stdout] 196 | Some(key) => (self.key.as_ref(), self.val.as_ref()), [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `key` [INFO] [stdout] --> src/tree/avl.rs:211:26 [INFO] [stdout] | [INFO] [stdout] 211 | Some(key) => (self.key.as_ref(), self.val.as_ref()), [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 165 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/pra/bst_prac.rs:245:13 [INFO] [stdout] | [INFO] [stdout] 245 | let mut size = self.size(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/graph/adj_matrix.rs:39:27 [INFO] [stdout] | [INFO] [stdout] 39 | .map(|(v, e)| self.read_second2end(&content, vec![vec![0; v]; v]).unwrap_or_default()) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/adj_matrix.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/adj_matrix.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/graph/adj_matrix.rs:74:18 [INFO] [stdout] | [INFO] [stdout] 74 | let (v, _) = AdjMatrix::read_v_e(&content).unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/graph/adj_list.rs:38:27 [INFO] [stdout] | [INFO] [stdout] 38 | .map(|(v, e)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/adj_list.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/adj_list.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/adj_list.rs:124:25 [INFO] [stdout] | [INFO] [stdout] 124 | fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/graph/adj_set.rs:38:27 [INFO] [stdout] | [INFO] [stdout] 38 | .map(|(v, e)| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/adj_set.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/adj_set.rs:66:17 [INFO] [stdout] | [INFO] [stdout] 66 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/adj_set.rs:123:25 [INFO] [stdout] | [INFO] [stdout] 123 | fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/graph.rs:74:17 [INFO] [stdout] | [INFO] [stdout] 74 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/graph.rs:75:17 [INFO] [stdout] | [INFO] [stdout] 75 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/graph.rs:105:29 [INFO] [stdout] | [INFO] [stdout] 105 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num1` is never read [INFO] [stdout] --> src/graph/graph_test.rs:75:17 [INFO] [stdout] | [INFO] [stdout] 75 | let mut num1 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num2` is never read [INFO] [stdout] --> src/graph/graph_test.rs:76:17 [INFO] [stdout] | [INFO] [stdout] 76 | let mut num2 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/graph_test.rs:106:29 [INFO] [stdout] | [INFO] [stdout] 106 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `hash_search::hash::Iter<'_, T>` is more private than the item `hash_search::hash::HashMap::::iter` [INFO] [stdout] --> src/hash_search/hash.rs:185:5 [INFO] [stdout] | [INFO] [stdout] 185 | pub fn iter(&self) -> Iter { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::::iter` is reachable at visibility `pub(hash_search)` [INFO] [stdout] | [INFO] [stdout] note: but type `hash_search::hash::Iter<'_, T>` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/hash_search/hash.rs:202:1 [INFO] [stdout] | [INFO] [stdout] 202 | struct Iter<'a, T> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] = note: `#[warn(private_interfaces)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type `hash_search::hash::IterMut<'_, T>` is more private than the item `hash_search::hash::HashMap::::iter_mut` [INFO] [stdout] --> src/hash_search/hash.rs:193:5 [INFO] [stdout] | [INFO] [stdout] 193 | pub fn iter_mut(&mut self) -> IterMut { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method `hash_search::hash::HashMap::::iter_mut` is reachable at visibility `pub(hash_search)` [INFO] [stdout] | [INFO] [stdout] note: but type `hash_search::hash::IterMut<'_, T>` is only usable at visibility `pub(self)` [INFO] [stdout] --> src/hash_search/hash.rs:213:1 [INFO] [stdout] | [INFO] [stdout] 213 | struct IterMut<'a, T> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:218:4 [INFO] [stdout] | [INFO] [stdout] 218 | fn preorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:226:4 [INFO] [stdout] | [INFO] [stdout] 226 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/tree/binary_tree.rs:234:4 [INFO] [stdout] | [INFO] [stdout] 234 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `size`, `is_empty`, and `min` are never used [INFO] [stdout] --> src/tree/binary_heap.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl BinaryHeap { [INFO] [stdout] | ---------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 16 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used [INFO] [stdout] --> src/tree/bst.rs:203:8 [INFO] [stdout] | [INFO] [stdout] 15 | / impl BST [INFO] [stdout] 16 | | where T: Copy + Ord + Debug, [INFO] [stdout] 17 | | U: Copy + Debug, [INFO] [stdout] | |__________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 203 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 207 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 247 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 259 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 272 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used [INFO] [stdout] --> src/tree/avl.rs:218:8 [INFO] [stdout] | [INFO] [stdout] 16 | / impl AVLTree [INFO] [stdout] 17 | | where T: Copy + Ord + Debug, [INFO] [stdout] 18 | | U: Copy + Debug, [INFO] [stdout] | |__________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 218 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 222 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 262 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 274 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 287 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Queue` is never constructed [INFO] [stdout] --> src/tree/bst_ori.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Queue { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `enqueue`, `dequeue`, `is_empty`, and `len` are never used [INFO] [stdout] --> src/tree/bst_ori.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Queue { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 14 | fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn enqueue(&mut self, val: T) -> Result<(), String> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn dequeue(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/tree/bst_ori.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 59 | / impl BST [INFO] [stdout] 60 | | where T: Copy + Ord + Debug, [INFO] [stdout] 61 | | U: Copy + Debug [INFO] [stdout] | |_________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 72 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 126 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 180 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 204 | fn min(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 215 | fn max(&self) -> (Option<&T>, Option<&U>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 227 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 231 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 236 | fn get(&self, key: &T) -> Option<&U> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 272 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 284 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 296 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:319:4 [INFO] [stdout] | [INFO] [stdout] 319 | fn preorder(bst: Link) [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:330:4 [INFO] [stdout] | [INFO] [stdout] 330 | fn inorder(bst: Link) [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:341:4 [INFO] [stdout] | [INFO] [stdout] 341 | fn postorder(bst: Link) [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `levelorder` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:352:4 [INFO] [stdout] | [INFO] [stdout] 352 | fn levelorder(bst: Link) [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `basic` is never used [INFO] [stdout] --> src/tree/bst_ori.rs:382:8 [INFO] [stdout] | [INFO] [stdout] 382 | fn basic() { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `get_left`, `get_right`, `inorder`, `postorder`, and `levelorder` are never used [INFO] [stdout] --> src/pra/bst_prac.rs:172:8 [INFO] [stdout] | [INFO] [stdout] 15 | / impl BST [INFO] [stdout] 16 | | where T: Copy + Debug + Ord, [INFO] [stdout] 17 | | U: Copy + Debug [INFO] [stdout] | |_________________________- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 172 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 176 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 216 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 230 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 244 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `has_edge`, `adj`, and `degree` are never used [INFO] [stdout] --> src/graph/adj_matrix.rs:160:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl AdjMatrix { [INFO] [stdout] | -------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 160 | fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 168 | fn adj(&self, v: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 183 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `e` is never read [INFO] [stdout] --> src/graph/adj_list.rs:12:9 [INFO] [stdout] | [INFO] [stdout] 10 | pub struct AdjList { [INFO] [stdout] | ------- field in this struct [INFO] [stdout] 11 | pub v: usize, [INFO] [stdout] 12 | pub e: usize, [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: `AdjList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `has_edge`, `adj`, and `degree` are never used [INFO] [stdout] --> src/graph/adj_list.rs:142:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl AdjList { [INFO] [stdout] | ------------ methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 142 | fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 151 | fn adj(&self, v: usize) -> &LinkedList { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 160 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `e` is never read [INFO] [stdout] --> src/graph/adj_set.rs:12:9 [INFO] [stdout] | [INFO] [stdout] 10 | pub struct AdjSet { [INFO] [stdout] | ------ field in this struct [INFO] [stdout] 11 | pub v: usize, [INFO] [stdout] 12 | pub e: usize, [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: `AdjSet` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `has_edge`, `adj`, and `degree` are never used [INFO] [stdout] --> src/graph/adj_set.rs:141:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl AdjSet { [INFO] [stdout] | ----------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 141 | fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn adj(&self, v: usize) -> &BTreeSet { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 159 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `AdjIterable` is never used [INFO] [stdout] --> src/graph/adj_iterable.rs:202:11 [INFO] [stdout] | [INFO] [stdout] 202 | pub trait AdjIterable { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `print_adj`, `has_edge`, and `degree` are never used [INFO] [stdout] --> src/graph/graph.rs:105:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Graph { [INFO] [stdout] | ---------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 105 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 123 | pub fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `order` is never used [INFO] [stdout] --> src/graph/single_source_path.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl SingleSourcePath { [INFO] [stdout] | --------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 42 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `order` is never used [INFO] [stdout] --> src/graph/path.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 21 | impl Path { [INFO] [stdout] | --------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 61 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `order` is never used [INFO] [stdout] --> src/graph/cycle_detection.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl CycleDetection { [INFO] [stdout] | ------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 39 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `print_adj`, `has_edge`, `adj`, and `degree` are never used [INFO] [stdout] --> src/graph/graph_test.rs:106:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl GraphTest { [INFO] [stdout] | -------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 106 | pub fn print_adj(&self, mut adj: Vec>) -> Result<()> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | pub fn has_edge(&self, v: usize, w: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 133 | pub fn adj(&self, v: usize) -> &BTreeSet { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 142 | fn degree(&self, v: usize) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `order` is never used [INFO] [stdout] --> src/graph/single_path_bfs.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl SinglePathGraphBFS { [INFO] [stdout] | ----------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 62 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `order` is never used [INFO] [stdout] --> src/graph/u_s_s_s_path.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl USSSPath { [INFO] [stdout] | ------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 75 | fn order(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `std::result::Result` that must be used [INFO] [stdout] --> src/deque/palindrome/palindrome.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | d.add_rear(c); [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 6 | let _ = d.add_rear(c); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/adj_matrix.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/adj_list.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/adj_set.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/graph.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/graph/graph_test.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | if v < 0 || v >= self.v { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 98 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 5.82s [INFO] running `Command { std: "docker" "inspect" "8b5cb4e14af8183c07115be9077dca57186c6084a29f05e6946d38cf053d18a4", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8b5cb4e14af8183c07115be9077dca57186c6084a29f05e6946d38cf053d18a4", kill_on_drop: false }` [INFO] [stdout] 8b5cb4e14af8183c07115be9077dca57186c6084a29f05e6946d38cf053d18a4