[INFO] cloning repository https://github.com/buiqtuan/algo
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/buiqtuan/algo" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fbuiqtuan%2Falgo", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fbuiqtuan%2Falgo'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] c44ca0fac94c684643347036c763a94bb3c57868
[INFO] checking buiqtuan/algo/c44ca0fac94c684643347036c763a94bb3c57868 against master#ab869e094a907cc5d19b4080f22eccaf347f1f95 for pr-129604
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fbuiqtuan%2Falgo" "/workspace/builds/worker-5-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/buiqtuan/algo 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/buiqtuan/algo
[INFO] finished tweaking git repo https://github.com/buiqtuan/algo
[INFO] tweaked toml for git repo https://github.com/buiqtuan/algo written to /workspace/builds/worker-5-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/buiqtuan/algo 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-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-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] 6961d180e0f30a96e0a93ca00853d8c8e971e2638e4f8e7795f631a24c834499
[INFO] running `Command { std: "docker" "start" "-a" "6961d180e0f30a96e0a93ca00853d8c8e971e2638e4f8e7795f631a24c834499", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "6961d180e0f30a96e0a93ca00853d8c8e971e2638e4f8e7795f631a24c834499", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6961d180e0f30a96e0a93ca00853d8c8e971e2638e4f8e7795f631a24c834499", kill_on_drop: false }`
[INFO] [stdout] 6961d180e0f30a96e0a93ca00853d8c8e971e2638e4f8e7795f631a24c834499
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-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] bd85da27e79ce0883f6b4d71fdb702b5268a7b73f53f58d67f35cd519abad227
[INFO] running `Command { std: "docker" "start" "-a" "bd85da27e79ce0883f6b4d71fdb702b5268a7b73f53f58d67f35cd519abad227", kill_on_drop: false }`
[INFO] [stderr]     Checking algo v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `crate::main`
[INFO] [stdout]  --> src/data_structure/double_linked_list.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     use crate::main;
[INFO] [stdout]   |         ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/data_structure/stack.rs:2:22
[INFO] [stdout]   |
[INFO] [stdout] 2 |     use std::{cell::{Ref, RefCell}, fmt::Debug, rc::Rc};
[INFO] [stdout]   |                      ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BorrowMut`, `Borrow`, and `ops::Index`
[INFO] [stdout]  --> src/data_structure/binary_heap.rs:3:18
[INFO] [stdout]   |
[INFO] [stdout] 3 |         borrow::{Borrow, BorrowMut},
[INFO] [stdout]   |                  ^^^^^^  ^^^^^^^^^
[INFO] [stdout] 4 |         collections::HashMap,
[INFO] [stdout] 5 |         hash::Hash, ops::Index,
[INFO] [stdout]   |                     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::BorrowMut` and `ops::Not`
[INFO] [stdout]  --> src/data_structure/binary_tree.rs:2:15
[INFO] [stdout]   |
[INFO] [stdout] 2 |     use std::{borrow::BorrowMut, cmp::Ordering, ops::Not};
[INFO] [stdout]   |               ^^^^^^^^^^^^^^^^^                 ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::main`
[INFO] [stdout]  --> src/data_structure/double_linked_list.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     use crate::main;
[INFO] [stdout]   |         ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `data_structure::*`
[INFO] [stdout]  --> src/main.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use data_structure::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/data_structure/stack.rs:2:22
[INFO] [stdout]   |
[INFO] [stdout] 2 |     use std::{cell::{Ref, RefCell}, fmt::Debug, rc::Rc};
[INFO] [stdout]   |                      ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Borrow`
[INFO] [stdout]   --> src/leetcode/lc95.rs:20:23
[INFO] [stdout]    |
[INFO] [stdout] 20 |     use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]    |                       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BorrowMut`, `Borrow`, and `ops::Index`
[INFO] [stdout]  --> src/data_structure/binary_heap.rs:3:18
[INFO] [stdout]   |
[INFO] [stdout] 3 |         borrow::{Borrow, BorrowMut},
[INFO] [stdout]   |                  ^^^^^^  ^^^^^^^^^
[INFO] [stdout] 4 |         collections::HashMap,
[INFO] [stdout] 5 |         hash::Hash, ops::Index,
[INFO] [stdout]   |                     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]   --> src/leetcode/lc95.rs:21:21
[INFO] [stdout]    |
[INFO] [stdout] 21 |     use std::cell::{Ref, RefCell};
[INFO] [stdout]    |                     ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::BorrowMut` and `ops::Not`
[INFO] [stdout]  --> src/data_structure/binary_tree.rs:2:15
[INFO] [stdout]   |
[INFO] [stdout] 2 |     use std::{borrow::BorrowMut, cmp::Ordering, ops::Not};
[INFO] [stdout]   |               ^^^^^^^^^^^^^^^^^                 ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `data_structure::*`
[INFO] [stdout]  --> src/main.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use data_structure::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Borrow`
[INFO] [stdout]   --> src/leetcode/lc95.rs:20:23
[INFO] [stdout]    |
[INFO] [stdout] 20 |     use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]    |                       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]   --> src/leetcode/lc95.rs:21:21
[INFO] [stdout]    |
[INFO] [stdout] 21 |     use std::cell::{Ref, RefCell};
[INFO] [stdout]    |                     ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data_structure/linked_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 |     struct Node<T> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data_structure/linked_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 |     impl<T> Node<T> {
[INFO] [stdout]    |     --------------- associated function in this implementation
[INFO] [stdout] 12 |         fn new(value: T) -> Rc<RefCell<Self>> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedList` is never constructed
[INFO] [stdout]   --> src/data_structure/linked_list.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 20 |     struct LinkedList<T> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `size` are never used
[INFO] [stdout]   --> src/data_structure/linked_list.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     impl<T> LinkedList<T> {
[INFO] [stdout]    |     --------------------- associated items in this implementation
[INFO] [stdout] 25 |         fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |         fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `List` is never constructed
[INFO] [stdout]  --> src/data_structure/double_linked_list.rs:4:16
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub struct List<T> {
[INFO] [stdout]   |                ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/data_structure/double_linked_list.rs:9:10
[INFO] [stdout]   |
[INFO] [stdout] 9 |     type Link<T> = Option<*mut Node<T>>;
[INFO] [stdout]   |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/data_structure/double_linked_list.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 |     struct Node<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data_structure/double_linked_list.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 |     impl<T> Node<T> {
[INFO] [stdout]    |     --------------- associated function in this implementation
[INFO] [stdout] 18 |         fn new(element: T) -> *mut Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push_front`, `push_back`, `pop_front`, and `pop_back` are never used
[INFO] [stdout]   --> src/data_structure/double_linked_list.rs:30:16
[INFO] [stdout]    |
[INFO] [stdout] 29 |     impl<T> List<T> {
[INFO] [stdout]    |     --------------- associated items in this implementation
[INFO] [stdout] 30 |         pub fn new() -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |         pub fn push_front(&mut self, e: T) {
[INFO] [stdout]    |                ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |         pub fn push_back(&mut self, e: T) {
[INFO] [stdout]    |                ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 69 |         pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stdout]    |                ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 87 |         pub fn pop_back(&mut self) -> Option<T> {
[INFO] [stdout]    |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data_structure/stack.rs:5:16
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub struct Node<T: Debug> {
[INFO] [stdout]   |                ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` 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 `Stack` is never constructed
[INFO] [stdout]   --> src/data_structure/stack.rs:11:16
[INFO] [stdout]    |
[INFO] [stdout] 11 |     pub struct Stack<T: Debug> {
[INFO] [stdout]    |                ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Stack` 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 `IntoIter` is never constructed
[INFO] [stdout]   --> src/data_structure/stack.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 15 |     struct IntoIter<T: Debug> (Option<Rc<RefCell<Node<T>>>>);
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data_structure/stack.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 |     impl<T: Debug> Node<T> {
[INFO] [stdout]    |     ---------------------- associated function in this implementation
[INFO] [stdout] 32 |         fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, and `into_iter` are never used
[INFO] [stdout]   --> src/data_structure/stack.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 40 |     impl<T: Debug> Stack<T> {
[INFO] [stdout]    |     ----------------------- associated items in this implementation
[INFO] [stdout] 41 |         fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |         fn push(&mut self, value: T) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |         fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |         fn into_iter(self) -> IntoIter<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/data_structure/queue.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 |     struct Queue<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/data_structure/queue.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 |     impl<T: Copy + Clone + Default + PartialEq> Queue<T> {
[INFO] [stdout]    |     ---------------------------------------------------- associated items in this implementation
[INFO] [stdout] 13 |         fn new(d: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |         fn enqueue(&mut self, value: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |         fn dequeue(&mut self) -> T {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |         fn peek_head(&self) -> &T {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |         fn peek_tail(&self) -> &T {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78 |         fn len(&self) -> &usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |         fn poll_reserve(&mut self) -> T {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinHeap` is never constructed
[INFO] [stdout]  --> src/data_structure/binary_heap.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 8 |     struct MinHeap<T: Ord + Default + Hash + Copy> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/data_structure/binary_heap.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 |     impl<T: Ord + Default + Hash + Copy> MinHeap<T> {
[INFO] [stdout]    |     ----------------------------------------------- associated items in this implementation
[INFO] [stdout] 14 |         fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |         pub fn push(&mut self, value: T) {
[INFO] [stdout]    |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |         pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |         fn heapify_up(&mut self, mut idx: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |         fn heapify_down(&mut self, mut idx: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 80 |         pub fn remove(&mut self, value: T) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95 |         fn remove_and_push(&mut self, remove_i: usize, push_i: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFind` is never constructed
[INFO] [stdout]  --> src/data_structure/union_find.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 |     struct UnionFind {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_parent`, and `union` are never used
[INFO] [stdout]   --> src/data_structure/union_find.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 |     impl UnionFind {
[INFO] [stdout]    |     -------------- associated items in this implementation
[INFO] [stdout] 11 |         
[INFO] [stdout] 12 |         fn new(size: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |         fn find_parent(&mut self, id: usize) -> usize {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |         fn union(&mut self, x: usize, y: usize) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data_structure/linked_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 |     struct Node<T> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data_structure/linked_list.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 |     impl<T> Node<T> {
[INFO] [stdout]    |     --------------- associated function in this implementation
[INFO] [stdout] 12 |         fn new(value: T) -> Rc<RefCell<Self>> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedList` is never constructed
[INFO] [stdout]   --> src/data_structure/linked_list.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 20 |     struct LinkedList<T> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `size` are never used
[INFO] [stdout]   --> src/data_structure/linked_list.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     impl<T> LinkedList<T> {
[INFO] [stdout]    |     --------------------- associated items in this implementation
[INFO] [stdout] 25 |         fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |         fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `List` is never constructed
[INFO] [stdout]  --> src/data_structure/double_linked_list.rs:4:16
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub struct List<T> {
[INFO] [stdout]   |                ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/data_structure/double_linked_list.rs:9:10
[INFO] [stdout]   |
[INFO] [stdout] 9 |     type Link<T> = Option<*mut Node<T>>;
[INFO] [stdout]   |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/data_structure/double_linked_list.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 |     struct Node<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data_structure/double_linked_list.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 |     impl<T> Node<T> {
[INFO] [stdout]    |     --------------- associated function in this implementation
[INFO] [stdout] 18 |         fn new(element: T) -> *mut Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push_front`, `push_back`, `pop_front`, and `pop_back` are never used
[INFO] [stdout]   --> src/data_structure/double_linked_list.rs:30:16
[INFO] [stdout]    |
[INFO] [stdout] 29 |     impl<T> List<T> {
[INFO] [stdout]    |     --------------- associated items in this implementation
[INFO] [stdout] 30 |         pub fn new() -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |         pub fn push_front(&mut self, e: T) {
[INFO] [stdout]    |                ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |         pub fn push_back(&mut self, e: T) {
[INFO] [stdout]    |                ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 69 |         pub fn pop_front(&mut self) -> Option<T> {
[INFO] [stdout]    |                ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 87 |         pub fn pop_back(&mut self) -> Option<T> {
[INFO] [stdout]    |                ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data_structure/stack.rs:5:16
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub struct Node<T: Debug> {
[INFO] [stdout]   |                ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` 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 `Stack` is never constructed
[INFO] [stdout]   --> src/data_structure/stack.rs:11:16
[INFO] [stdout]    |
[INFO] [stdout] 11 |     pub struct Stack<T: Debug> {
[INFO] [stdout]    |                ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `Stack` 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 `IntoIter` is never constructed
[INFO] [stdout]   --> src/data_structure/stack.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 15 |     struct IntoIter<T: Debug> (Option<Rc<RefCell<Node<T>>>>);
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/data_structure/stack.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 |     impl<T: Debug> Node<T> {
[INFO] [stdout]    |     ---------------------- associated function in this implementation
[INFO] [stdout] 32 |         fn new(value: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, and `into_iter` are never used
[INFO] [stdout]   --> src/data_structure/stack.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 40 |     impl<T: Debug> Stack<T> {
[INFO] [stdout]    |     ----------------------- associated items in this implementation
[INFO] [stdout] 41 |         fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |         fn push(&mut self, value: T) {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |         fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |         fn into_iter(self) -> IntoIter<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Queue` is never constructed
[INFO] [stdout]  --> src/data_structure/queue.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 |     struct Queue<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/data_structure/queue.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 |     impl<T: Copy + Clone + Default + PartialEq> Queue<T> {
[INFO] [stdout]    |     ---------------------------------------------------- associated items in this implementation
[INFO] [stdout] 13 |         fn new(d: T) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |         fn enqueue(&mut self, value: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |         fn dequeue(&mut self) -> T {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |         fn peek_head(&self) -> &T {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |         fn peek_tail(&self) -> &T {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78 |         fn len(&self) -> &usize {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |         fn poll_reserve(&mut self) -> T {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinHeap` is never constructed
[INFO] [stdout]  --> src/data_structure/binary_heap.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 8 |     struct MinHeap<T: Ord + Default + Hash + Copy> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/data_structure/binary_heap.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 |     impl<T: Ord + Default + Hash + Copy> MinHeap<T> {
[INFO] [stdout]    |     ----------------------------------------------- associated items in this implementation
[INFO] [stdout] 14 |         fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |         pub fn push(&mut self, value: T) {
[INFO] [stdout]    |                ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |         pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |         fn heapify_up(&mut self, mut idx: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |         fn heapify_down(&mut self, mut idx: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 80 |         pub fn remove(&mut self, value: T) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95 |         fn remove_and_push(&mut self, remove_i: usize, push_i: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFind` is never constructed
[INFO] [stdout]  --> src/data_structure/union_find.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 |     struct UnionFind {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_parent`, and `union` are never used
[INFO] [stdout]   --> src/data_structure/union_find.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 |     impl UnionFind {
[INFO] [stdout]    |     -------------- associated items in this implementation
[INFO] [stdout] 11 |         
[INFO] [stdout] 12 |         fn new(size: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |         fn find_parent(&mut self, id: usize) -> usize {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |         fn union(&mut self, x: usize, y: usize) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_islands` is never used
[INFO] [stdout]   --> src/data_structure/union_find.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 |     fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data_structure/binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 |     struct Node<T: Clone + Copy> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]   --> src/data_structure/binary_tree.rs:12:16
[INFO] [stdout]    |
[INFO] [stdout] 12 |     pub struct BinaryTree<T: Clone + Copy> {
[INFO] [stdout]    |                ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `BinaryTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, `min_value`, and `insert_node` are never used
[INFO] [stdout]   --> src/data_structure/binary_tree.rs:17:16
[INFO] [stdout]    |
[INFO] [stdout] 16 |     impl<T: Ord + std::fmt::Debug + Clone + Copy> BinaryTree<T> {
[INFO] [stdout]    |     ----------------------------------------------------------- associated items in this implementation
[INFO] [stdout] 17 |         pub fn new() -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |         pub fn insert(&mut self, value: T) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |         fn remove(root: &mut Option<Box<Node<T>>>, value: T) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |         fn min_value(node: &mut Box<Node<T>>) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 60 |         fn insert_node(node: &mut Option<Box<Node<T>>>, value: T) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:12:16
[INFO] [stdout]    |
[INFO] [stdout] 10 |     impl TreeNode {
[INFO] [stdout]    |     ------------- associated function in this implementation
[INFO] [stdout] 11 |         #[inline]
[INFO] [stdout] 12 |         pub fn new(val: i32) -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_trees` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn generate_trees(n: i32) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_subtrees` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 |     fn generate_subtrees(start: i32, end: i32) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:59:12
[INFO] [stdout]    |
[INFO] [stdout] 59 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:83:12
[INFO] [stdout]    |
[INFO] [stdout] 81 |     impl ListNode {
[INFO] [stdout]    |     ------------- associated function in this implementation
[INFO] [stdout] 82 |         #[inline]
[INFO] [stdout] 83 |         fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_duplicate` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:88:12
[INFO] [stdout]    |
[INFO] [stdout] 88 |     pub fn delete_duplicate(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_islands` is never used
[INFO] [stdout]   --> src/data_structure/union_find.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 |     fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/data_structure/binary_tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 |     struct Node<T: Clone + Copy> {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]   --> src/data_structure/binary_tree.rs:12:16
[INFO] [stdout]    |
[INFO] [stdout] 12 |     pub struct BinaryTree<T: Clone + Copy> {
[INFO] [stdout]    |                ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `BinaryTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, `min_value`, and `insert_node` are never used
[INFO] [stdout]   --> src/data_structure/binary_tree.rs:17:16
[INFO] [stdout]    |
[INFO] [stdout] 16 |     impl<T: Ord + std::fmt::Debug + Clone + Copy> BinaryTree<T> {
[INFO] [stdout]    |     ----------------------------------------------------------- associated items in this implementation
[INFO] [stdout] 17 |         pub fn new() -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |         pub fn insert(&mut self, value: T) {
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |         fn remove(root: &mut Option<Box<Node<T>>>, value: T) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |         fn min_value(node: &mut Box<Node<T>>) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 60 |         fn insert_node(node: &mut Option<Box<Node<T>>>, value: T) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:12:16
[INFO] [stdout]    |
[INFO] [stdout] 10 |     impl TreeNode {
[INFO] [stdout]    |     ------------- associated function in this implementation
[INFO] [stdout] 11 |         #[inline]
[INFO] [stdout] 12 |         pub fn new(val: i32) -> Self {
[INFO] [stdout]    |                ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_trees` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn generate_trees(n: i32) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_subtrees` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 |     fn generate_subtrees(start: i32, end: i32) -> Vec<Option<Rc<RefCell<TreeNode>>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:59:12
[INFO] [stdout]    |
[INFO] [stdout] 59 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:83:12
[INFO] [stdout]    |
[INFO] [stdout] 81 |     impl ListNode {
[INFO] [stdout]    |     ------------- associated function in this implementation
[INFO] [stdout] 82 |         #[inline]
[INFO] [stdout] 83 |         fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_duplicate` is never used
[INFO] [stdout]   --> src/leetcode/lc95.rs:88:12
[INFO] [stdout]    |
[INFO] [stdout] 88 |     pub fn delete_duplicate(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 37 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 37 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.23s
[INFO] running `Command { std: "docker" "inspect" "bd85da27e79ce0883f6b4d71fdb702b5268a7b73f53f58d67f35cd519abad227", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "bd85da27e79ce0883f6b4d71fdb702b5268a7b73f53f58d67f35cd519abad227", kill_on_drop: false }`
[INFO] [stdout] bd85da27e79ce0883f6b4d71fdb702b5268a7b73f53f58d67f35cd519abad227