[INFO] fetching crate rust-algo 0.2.1...
[INFO] checking rust-algo-0.2.1 against master#507271bc119683008ec719ecee48814e8ac86c65 for pr-146440
[INFO] extracting crate rust-algo 0.2.1 into /workspace/builds/worker-7-tc1/source
[INFO] started tweaking crates.io crate rust-algo 0.2.1
[INFO] finished tweaking crates.io crate rust-algo 0.2.1
[INFO] tweaked toml for crates.io crate rust-algo 0.2.1 written to /workspace/builds/worker-7-tc1/source/Cargo.toml
[INFO] validating manifest of crates.io crate rust-algo 0.2.1 on toolchain 507271bc119683008ec719ecee48814e8ac86c65
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+507271bc119683008ec719ecee48814e8ac86c65" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+507271bc119683008ec719ecee48814e8ac86c65" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+507271bc119683008ec719ecee48814e8ac86c65" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+507271bc119683008ec719ecee48814e8ac86c65" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] f8d730ff4a165efe226b11a1e358e71609a55a40c8bda417ee7b9ab1c246fef3
[INFO] running `Command { std: "docker" "start" "-a" "f8d730ff4a165efe226b11a1e358e71609a55a40c8bda417ee7b9ab1c246fef3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "f8d730ff4a165efe226b11a1e358e71609a55a40c8bda417ee7b9ab1c246fef3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f8d730ff4a165efe226b11a1e358e71609a55a40c8bda417ee7b9ab1c246fef3", kill_on_drop: false }`
[INFO] [stdout] f8d730ff4a165efe226b11a1e358e71609a55a40c8bda417ee7b9ab1c246fef3
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+507271bc119683008ec719ecee48814e8ac86c65" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] eaaa426bab2dadd03f46e1ad3e4693b0c01f9e5f845a261f394d85d95574c014
[INFO] running `Command { std: "docker" "start" "-a" "eaaa426bab2dadd03f46e1ad3e4693b0c01f9e5f845a261f394d85d95574c014", kill_on_drop: false }`
[INFO] [stderr]     Checking rust-algo v0.2.1 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::process::id`
[INFO] [stdout]   --> src/history/graph.rs:26:5
[INFO] [stdout]    |
[INFO] [stdout] 26 | use std::process::id;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VecDeque`
[INFO] [stdout]   --> src/graph.rs:24:42
[INFO] [stdout]    |
[INFO] [stdout] 24 | use std::collections::{HashMap, HashSet, VecDeque};
[INFO] [stdout]    |                                          ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `curr_idx` is never read
[INFO] [stdout]    --> src/linked_list.rs:118:25
[INFO] [stdout]     |
[INFO] [stdout] 118 |                         curr_idx = new_idx;
[INFO] [stdout]     |                         ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/double_linked_list.rs:60:13
[INFO] [stdout]    |
[INFO] [stdout] 60 |         let mut node_to_del = self.nodes.swap_remove(idx);
[INFO] [stdout]    |             ----^^^^^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/double_linked_list.rs:125:13
[INFO] [stdout]     |
[INFO] [stdout] 125 |         let mut res = Self {
[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/double_linked_list.rs:134:13
[INFO] [stdout]     |
[INFO] [stdout] 134 |         let mut res = Self {
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `make_node` are never used
[INFO] [stdout]   --> src/linked_list.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl<T> ArenaList<T> {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 22 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn make_node(&mut self, data: Option<T>) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `root` and `owner` are never read
[INFO] [stdout]   --> src/linked_list.rs:50:5
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub struct LinkedList<'a, T> {
[INFO] [stdout]    |            ---------- fields in this struct
[INFO] [stdout] 50 |     root: usize,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 51 |     //根节点id
[INFO] [stdout] 52 |     owner: &'a mut ArenaList<T>,
[INFO] [stdout]    |     ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `from_vec`, `clear`, `to_vec`, `get`, `insert`, and `del` are never used
[INFO] [stdout]    --> src/linked_list.rs:56:8
[INFO] [stdout]     |
[INFO] [stdout]  55 | impl<'a, T> LinkedList<'a, T> {
[INFO] [stdout]     | ----------------------------- associated items in this implementation
[INFO] [stdout]  56 |     fn from_vec(arena_list: &'a mut ArenaList<T>, vec1: Vec<T>) -> Self {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  71 |     fn clear() {}
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  74 |     fn to_vec(&self) -> Vec<&T> {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  93 |     fn get(&self, mut num: usize) -> &Option<T> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 109 |     fn insert(&mut self, mut num: usize, data: T) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 130 |     fn del(&mut self, mut num: usize) -> bool {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `split` is never used
[INFO] [stdout]    --> src/linked_list.rs:156:8
[INFO] [stdout]     |
[INFO] [stdout] 153 | impl<'a, T> LinkedList<'a, T> {
[INFO] [stdout]     | ----------------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 156 |     fn split(&mut self, mut num: usize) -> LinkedList<T> {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ArenaList` is never constructed
[INFO] [stdout]   --> src/history/linked_list.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct ArenaList<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NodeInfo` is never constructed
[INFO] [stdout]   --> src/history/linked_list.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub struct NodeInfo<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/history/linked_list.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub struct Node<'a, T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `make_node`, `compact`, and `clear` are never used
[INFO] [stdout]   --> src/history/linked_list.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl<T> ArenaList<T> {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 30 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn make_node(&mut self, data: Option<T>) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn compact(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     fn clear(&mut self) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/history/linked_list.rs:65:8
[INFO] [stdout]     |
[INFO] [stdout]  64 | impl<'a, T> Node<'a, T> {
[INFO] [stdout]     | ----------------------- associated items in this implementation
[INFO] [stdout]  65 |     fn init_with_dummy(arena_list: &'a mut ArenaList<T>) -> Self {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  73 |     fn push_by_vec(&mut self, vec: Vec<T>) {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  81 |     fn from_vec(arena_list: &'a mut ArenaList<T>, vec: Vec<T>) -> Self {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  87 |     fn to_vec(&self) -> Vec<&T> {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn insert(&mut self, mut idx: usize, val: T) -> bool {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 123 |     fn get(&self, mut idx: usize) -> &Option<T> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 139 |     fn del(&mut self, mut idx: usize) -> bool {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/history/graph.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub struct Node<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ArenaList` is never constructed
[INFO] [stdout]   --> src/history/graph.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | pub struct ArenaList<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/history/graph.rs:47:8
[INFO] [stdout]     |
[INFO] [stdout]  46 | impl<T> ArenaList<T> {
[INFO] [stdout]     | -------------------- associated items in this implementation
[INFO] [stdout]  47 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  55 |     fn clear(&mut self) {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  62 |     fn make_or_get_node(&mut self, name: &str, data: T) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  79 |     fn get_idx_by_name(&self, name: &str) -> Option<&usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  84 |     fn add_next_idx(&mut self, src_idx: usize, dst_idx: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  96 |     fn del_node_by_idx(&mut self, idx: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 110 |     fn del_edge_by_idx(&mut self, src_idx: usize, dst_idx: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 118 |     fn compact(&mut self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]    --> src/history/graph.rs:124:12
[INFO] [stdout]     |
[INFO] [stdout] 124 | pub struct Graph<'a, T> {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/history/graph.rs:129:8
[INFO] [stdout]     |
[INFO] [stdout] 128 | impl<'a, T> Graph<'a, T> {
[INFO] [stdout]     | ------------------------ associated items in this implementation
[INFO] [stdout] 129 |     fn new(arena_list: &'a mut ArenaList<T>) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 136 |     fn add_node(&mut self, name: &str, data: T) -> usize {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 142 |     fn add_edge(&mut self, src_name: &str, src_data: T, dst_name: &str, dst_data: T) {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 150 |     fn get_node_by_idx(&self, idx: usize) -> Option<&Node<T>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 155 |     fn get_name_by_idx(&self, idx: usize) -> Option<&String> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 162 |     fn get_idx_by_name(&self, name: &str) -> Option<&usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 167 |     fn get_edges(&self) -> Vec<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 183 |     fn print_edges(&self) {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 201 |     fn del_node_by_idx(&mut self, idx: usize) -> bool { self.owner.del_node_by_idx(idx) }
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 202 |     // 删除边
[INFO] [stdout] 203 |     fn del_edge_by_idx(&mut self, src_idx: usize, dst_idx: usize) -> bool { self.owner.del_edge_by_idx(src_idx, dst_idx) }
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 206 |     fn del_node_by_name(&mut self, name: &str) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 214 |     fn del_edge_by_name(&mut self, src_name: &str, dst_name: &str) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/graph.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub struct Node<T> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ArenaList` is never constructed
[INFO] [stdout]   --> src/graph.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub struct ArenaList<T> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/graph.rs:44:8
[INFO] [stdout]     |
[INFO] [stdout]  43 | impl<T> ArenaList<T> {
[INFO] [stdout]     | -------------------- associated items in this implementation
[INFO] [stdout]  44 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  51 |     fn clear(&mut self) {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  57 |     fn add_node(&mut self, name: &str, data: T) -> usize {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  78 |     fn get_node(&self, idx: usize) -> &Node<T> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  83 |     fn get_idx_by_name(&self, name: &str) -> Option<&usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  86 |     fn get_name_by_idx(&self, idx: usize) -> &str {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  90 |     fn add_edge(&mut self, src_idx: usize, dst_idx: usize) {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  96 |     fn del_edge(&mut self, src_idx: usize, dst_idx: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 103 |     fn del_node(&mut self, idx: usize) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]    --> src/graph.rs:168:12
[INFO] [stdout]     |
[INFO] [stdout] 168 | pub struct Graph<'a, T> {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/graph.rs:173:8
[INFO] [stdout]     |
[INFO] [stdout] 172 | impl<'a, T> Graph<'a, T> {
[INFO] [stdout]     | ------------------------ associated items in this implementation
[INFO] [stdout] 173 |     fn new(arena_list: &'a mut ArenaList<T>) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 180 |     fn add_node(&mut self, name: &str, data: T) -> usize {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 185 |     fn add_edge(&mut self, src_idx: usize, dst_idx: usize) {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 190 |     fn add_node_and_edge(&mut self, src_name: &str, src_data: T, dst_name: &str, dst_data: T) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 198 |     fn get_node_by_idx(&self, idx: usize) -> &Node<T> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 202 |     fn get_name_by_idx(&self, idx: usize) -> &String {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 206 |     fn get_idx_by_name(&self, name: &str) -> Option<&usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 212 |     fn get_all_edges(&self) -> Vec<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 223 |     fn print_nodes(&self) {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 227 |     fn print_edges(&self) {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 236 |     fn del_node_by_idx(&mut self, idx: usize) -> bool { self.owner.del_node(idx) }
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 237 |     // 删除边
[INFO] [stdout] 238 |     fn del_edge_by_idx(&mut self, src_idx: usize, dst_idx: usize) -> bool { self.owner.del_edge(src_idx, dst_idx) }
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 241 |     fn del_node_by_name(&mut self, name: &str) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 249 |     fn del_edge_by_name(&mut self, src_name: &str, dst_name: &str) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 257 |     fn clear(&mut self) { self.owner.clear() }
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 260 |     fn save(&self) {}
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 263 |     fn load(&mut self) {}
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `get_downstream` and `get_shortest` are never used
[INFO] [stdout]    --> src/graph.rs:268:8
[INFO] [stdout]     |
[INFO] [stdout] 266 | impl<'a, T> Graph<'a, T> {
[INFO] [stdout]     | ------------------------ methods in this implementation
[INFO] [stdout] 267 |     // 找到某个节点的全部下游节点。返回的数据结构是 {level: [idx1, idx2, ...]} 的 HashMap，存放的是下游层数、节点号
[INFO] [stdout] 268 |     fn get_downstream(&self, batch_idx: Vec<usize>, max_level: usize) -> HashMap<usize, Vec<usize>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 286 |     fn get_shortest(&self, src_idx: usize, dst_idx: usize, max_level: usize) -> Option<usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `clear` is never used
[INFO] [stdout]   --> src/double_linked_list.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl<T> ArenaList<T> {
[INFO] [stdout]    | -------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn clear(&mut self) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/linked_list.rs:156:14
[INFO] [stdout]     |
[INFO] [stdout] 156 |     fn split(&mut self, mut num: usize) -> LinkedList<T> {
[INFO] [stdout]     |              ^^^^^^^^^                     ^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |              |
[INFO] [stdout]     |              the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 156 |     fn split(&mut self, mut num: usize) -> LinkedList<'_, T> {
[INFO] [stdout]     |                                                       +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing
[INFO] [stdout]    --> src/double_linked_list.rs:133:72
[INFO] [stdout]     |
[INFO] [stdout] 133 |     pub fn from_vec(arena_list: &'a mut ArenaList<T>, vec1: Vec<T>) -> DoubleLinkedList<T> {
[INFO] [stdout]     |                                  -- the lifetime is named here         ^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: consistently use `'a`
[INFO] [stdout]     |
[INFO] [stdout] 133 |     pub fn from_vec(arena_list: &'a mut ArenaList<T>, vec1: Vec<T>) -> DoubleLinkedList<'a, T> {
[INFO] [stdout]     |                                                                                         +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::process::id`
[INFO] [stdout]   --> src/history/graph.rs:26:5
[INFO] [stdout]    |
[INFO] [stdout] 26 | use std::process::id;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VecDeque`
[INFO] [stdout]   --> src/graph.rs:24:42
[INFO] [stdout]    |
[INFO] [stdout] 24 | use std::collections::{HashMap, HashSet, VecDeque};
[INFO] [stdout]    |                                          ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `HashSet`
[INFO] [stdout]    --> src/graph.rs:308:28
[INFO] [stdout]     |
[INFO] [stdout] 308 |     use std::collections::{HashMap, HashSet};
[INFO] [stdout]     |                            ^^^^^^^  ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `curr_idx` is never read
[INFO] [stdout]    --> src/linked_list.rs:118:25
[INFO] [stdout]     |
[INFO] [stdout] 118 |                         curr_idx = new_idx;
[INFO] [stdout]     |                         ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/linked_list.rs:203:13
[INFO] [stdout]     |
[INFO] [stdout] 203 |         let mut linked_list2 = linked_list1.split(3);
[INFO] [stdout]     |             ----^^^^^^^^^^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edges`
[INFO] [stdout]    --> src/history/graph.rs:266:13
[INFO] [stdout]     |
[INFO] [stdout] 266 |         let edges = graph.get_edges();
[INFO] [stdout]     |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rust_algo::linked_list`
[INFO] [stdout]  --> tests/test_linked_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use rust_algo::linked_list;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edges`
[INFO] [stdout]    --> src/graph.rs:347:13
[INFO] [stdout]     |
[INFO] [stdout] 347 |         let edges = graph.get_all_edges();
[INFO] [stdout]     |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> tests/test_double_linked_list.rs:7:9
[INFO] [stdout]   |
[INFO] [stdout] 7 |     let mut double_linked_list = DoubleLinkedList::new(&mut arena_list);
[INFO] [stdout]   |         ----^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/double_linked_list.rs:60:13
[INFO] [stdout]    |
[INFO] [stdout] 60 |         let mut node_to_del = self.nodes.swap_remove(idx);
[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/double_linked_list.rs:125:13
[INFO] [stdout]     |
[INFO] [stdout] 125 |         let mut res = Self {
[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/double_linked_list.rs:134:13
[INFO] [stdout]     |
[INFO] [stdout] 134 |         let mut res = Self {
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `clear` is never used
[INFO] [stdout]   --> src/linked_list.rs:71:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | impl<'a, T> LinkedList<'a, T> {
[INFO] [stdout]    | ----------------------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn clear() {}
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `len` is never read
[INFO] [stdout]   --> src/history/linked_list.rs:14:5
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct ArenaList<T> {
[INFO] [stdout]    |            --------- field in this struct
[INFO] [stdout] ...
[INFO] [stdout] 14 |     len: usize,
[INFO] [stdout]    |     ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `compact` and `clear` are never used
[INFO] [stdout]   --> src/history/linked_list.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl<T> ArenaList<T> {
[INFO] [stdout]    | -------------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn compact(&mut self) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     fn clear(&mut self) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `data` is never read
[INFO] [stdout]   --> src/history/graph.rs:31:5
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub struct Node<T> {
[INFO] [stdout]    |            ---- field in this struct
[INFO] [stdout] 30 |     name: String,
[INFO] [stdout] 31 |     data: T,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `clear` and `compact` are never used
[INFO] [stdout]    --> src/history/graph.rs:55:8
[INFO] [stdout]     |
[INFO] [stdout]  46 | impl<T> ArenaList<T> {
[INFO] [stdout]     | -------------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout]  55 |     fn clear(&mut self) {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 118 |     fn compact(&mut self) {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `get_name_by_idx` is never used
[INFO] [stdout]    --> src/history/graph.rs:155:8
[INFO] [stdout]     |
[INFO] [stdout] 128 | impl<'a, T> Graph<'a, T> {
[INFO] [stdout]     | ------------------------ method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 155 |     fn get_name_by_idx(&self, idx: usize) -> Option<&String> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `get_name_by_idx` is never used
[INFO] [stdout]   --> src/graph.rs:86:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl<T> ArenaList<T> {
[INFO] [stdout]    | -------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 86 |     fn get_name_by_idx(&self, idx: usize) -> &str {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `save` and `load` are never used
[INFO] [stdout]    --> src/graph.rs:260:8
[INFO] [stdout]     |
[INFO] [stdout] 172 | impl<'a, T> Graph<'a, T> {
[INFO] [stdout]     | ------------------------ methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 260 |     fn save(&self) {}
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 263 |     fn load(&mut self) {}
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `clear` is never used
[INFO] [stdout]   --> src/double_linked_list.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl<T> ArenaList<T> {
[INFO] [stdout]    | -------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn clear(&mut self) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/linked_list.rs:156:14
[INFO] [stdout]     |
[INFO] [stdout] 156 |     fn split(&mut self, mut num: usize) -> LinkedList<T> {
[INFO] [stdout]     |              ^^^^^^^^^                     ^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |              |
[INFO] [stdout]     |              the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 156 |     fn split(&mut self, mut num: usize) -> LinkedList<'_, T> {
[INFO] [stdout]     |                                                       +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing
[INFO] [stdout]    --> src/double_linked_list.rs:133:72
[INFO] [stdout]     |
[INFO] [stdout] 133 |     pub fn from_vec(arena_list: &'a mut ArenaList<T>, vec1: Vec<T>) -> DoubleLinkedList<T> {
[INFO] [stdout]     |                                  -- the lifetime is named here         ^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: consistently use `'a`
[INFO] [stdout]     |
[INFO] [stdout] 133 |     pub fn from_vec(arena_list: &'a mut ArenaList<T>, vec1: Vec<T>) -> DoubleLinkedList<'a, T> {
[INFO] [stdout]     |                                                                                         +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.47s
[INFO] running `Command { std: "docker" "inspect" "eaaa426bab2dadd03f46e1ad3e4693b0c01f9e5f845a261f394d85d95574c014", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "eaaa426bab2dadd03f46e1ad3e4693b0c01f9e5f845a261f394d85d95574c014", kill_on_drop: false }`
[INFO] [stdout] eaaa426bab2dadd03f46e1ad3e4693b0c01f9e5f845a261f394d85d95574c014
