[INFO] fetching crate rust-algo 0.2.1... [INFO] testing rust-algo-0.2.1 against try#8de4c7234dd9b97c9d76b58671343fdbbc9a433e+target=x86_64-unknown-linux-musl for musl_upgrade_1_2_5_with_libc_patch_0 [INFO] extracting crate rust-algo 0.2.1 into /workspace/builds/worker-1-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-1-tc1/source/Cargo.toml [INFO] validating manifest of crates.io crate rust-algo 0.2.1 on toolchain 8de4c7234dd9b97c9d76b58671343fdbbc9a433e [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "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" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "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" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 3fc755a4deb2ad59e1808cec1296706265bba0437a5022c10388906146bebd12 [INFO] running `Command { std: "docker" "start" "-a" "3fc755a4deb2ad59e1808cec1296706265bba0437a5022c10388906146bebd12", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "3fc755a4deb2ad59e1808cec1296706265bba0437a5022c10388906146bebd12", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "3fc755a4deb2ad59e1808cec1296706265bba0437a5022c10388906146bebd12", kill_on_drop: false }` [INFO] [stdout] 3fc755a4deb2ad59e1808cec1296706265bba0437a5022c10388906146bebd12 [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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "build" "--frozen" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] a799c36ab55492ff50bd48859df2bc207fd591602e3e90f560d50035aab02f2c [INFO] running `Command { std: "docker" "start" "-a" "a799c36ab55492ff50bd48859df2bc207fd591602e3e90f560d50035aab02f2c", kill_on_drop: false }` [INFO] [stderr] Compiling 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)]` 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)]` 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)]` 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 ArenaList { [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) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` 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, [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, vec1: Vec) -> 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 { [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 { [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 { [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 { [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 ArenaList { [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) -> 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) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn push_by_vec(&mut self, vec: Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn from_vec(arena_list: &'a mut ArenaList, vec: Vec) -> 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 { [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 { [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 { [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 ArenaList { [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) -> 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> { [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 { [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 { [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 ArenaList { [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 { [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) -> 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 { [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, max_level: usize) -> HashMap> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 286 | fn get_shortest(&self, src_idx: usize, dst_idx: usize, max_level: usize) -> Option { [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 ArenaList { [INFO] [stdout] | -------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 27 | fn clear(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/linked_list.rs:156:14 [INFO] [stdout] | [INFO] [stdout] 156 | fn split(&mut self, mut num: usize) -> LinkedList { [INFO] [stdout] | ^^^^^^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 156 | fn split(&mut self, mut num: usize) -> LinkedList<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/double_linked_list.rs:133:34 [INFO] [stdout] | [INFO] [stdout] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList { [INFO] [stdout] | ^^ this lifetime flows to the output ------------------- the lifetime gets resolved as `'a` [INFO] [stdout] | [INFO] [stdout] help: one option is to consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList<'a, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.29s [INFO] running `Command { std: "docker" "inspect" "a799c36ab55492ff50bd48859df2bc207fd591602e3e90f560d50035aab02f2c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a799c36ab55492ff50bd48859df2bc207fd591602e3e90f560d50035aab02f2c", kill_on_drop: false }` [INFO] [stdout] a799c36ab55492ff50bd48859df2bc207fd591602e3e90f560d50035aab02f2c [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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--no-run" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] dedd6988b409f8d032f4a862cf03dc259adf44ba2ddae43018e24c32db66e821 [INFO] running `Command { std: "docker" "start" "-a" "dedd6988b409f8d032f4a862cf03dc259adf44ba2ddae43018e24c32db66e821", kill_on_drop: false }` [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)]` 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)]` 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)]` 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 ArenaList { [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) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` 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, [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, vec1: Vec) -> 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 { [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 { [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 { [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 { [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 ArenaList { [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) -> 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) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn push_by_vec(&mut self, vec: Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn from_vec(arena_list: &'a mut ArenaList, vec: Vec) -> 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 { [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 { [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 { [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 ArenaList { [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) -> 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> { [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 { [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 { [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 ArenaList { [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 { [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) -> 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 { [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, max_level: usize) -> HashMap> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 286 | fn get_shortest(&self, src_idx: usize, dst_idx: usize, max_level: usize) -> Option { [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 ArenaList { [INFO] [stdout] | -------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 27 | fn clear(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/linked_list.rs:156:14 [INFO] [stdout] | [INFO] [stdout] 156 | fn split(&mut self, mut num: usize) -> LinkedList { [INFO] [stdout] | ^^^^^^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 156 | fn split(&mut self, mut num: usize) -> LinkedList<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/double_linked_list.rs:133:34 [INFO] [stdout] | [INFO] [stdout] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList { [INFO] [stdout] | ^^ this lifetime flows to the output ------------------- the lifetime gets resolved as `'a` [INFO] [stdout] | [INFO] [stdout] help: one option is to consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList<'a, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling rust-algo v0.2.1 (/opt/rustwide/workdir) [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)]` on by default [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)]` 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: 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)]` on by default [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)]` 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)]` 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)]` 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] --> 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)]` 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 { [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 ArenaList { [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 { [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 ArenaList { [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 ArenaList { [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 ArenaList { [INFO] [stdout] | -------------------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 27 | fn clear(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/linked_list.rs:156:14 [INFO] [stdout] | [INFO] [stdout] 156 | fn split(&mut self, mut num: usize) -> LinkedList { [INFO] [stdout] | ^^^^^^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 156 | fn split(&mut self, mut num: usize) -> LinkedList<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/double_linked_list.rs:133:34 [INFO] [stdout] | [INFO] [stdout] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList { [INFO] [stdout] | ^^ this lifetime flows to the output ------------------- the lifetime gets resolved as `'a` [INFO] [stdout] | [INFO] [stdout] help: one option is to consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList<'a, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 1.32s [INFO] running `Command { std: "docker" "inspect" "dedd6988b409f8d032f4a862cf03dc259adf44ba2ddae43018e24c32db66e821", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "dedd6988b409f8d032f4a862cf03dc259adf44ba2ddae43018e24c32db66e821", kill_on_drop: false }` [INFO] [stdout] dedd6988b409f8d032f4a862cf03dc259adf44ba2ddae43018e24c32db66e821 [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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 96fa6bbebfa43990a65dbfec8a518aeffb688fe973d1eaee53a484d1839d341b [INFO] running `Command { std: "docker" "start" "-a" "96fa6bbebfa43990a65dbfec8a518aeffb688fe973d1eaee53a484d1839d341b", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `std::process::id` [INFO] [stderr] --> src/history/graph.rs:26:5 [INFO] [stderr] | [INFO] [stderr] 26 | use std::process::id; [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `VecDeque` [INFO] [stderr] --> src/graph.rs:24:42 [INFO] [stderr] | [INFO] [stderr] 24 | use std::collections::{HashMap, HashSet, VecDeque}; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: value assigned to `curr_idx` is never read [INFO] [stderr] --> src/linked_list.rs:118:25 [INFO] [stderr] | [INFO] [stderr] 118 | curr_idx = new_idx; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/double_linked_list.rs:60:13 [INFO] [stderr] | [INFO] [stderr] 60 | let mut node_to_del = self.nodes.swap_remove(idx); [INFO] [stderr] | ----^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/double_linked_list.rs:125:13 [INFO] [stderr] | [INFO] [stderr] 125 | let mut res = Self { [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/double_linked_list.rs:134:13 [INFO] [stderr] | [INFO] [stderr] 134 | let mut res = Self { [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: associated items `new` and `make_node` are never used [INFO] [stderr] --> src/linked_list.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 21 | impl ArenaList { [INFO] [stderr] | -------------------- associated items in this implementation [INFO] [stderr] 22 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 31 | fn make_node(&mut self, data: Option) -> usize { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: fields `root` and `owner` are never read [INFO] [stderr] --> src/linked_list.rs:50:5 [INFO] [stderr] | [INFO] [stderr] 49 | pub struct LinkedList<'a, T> { [INFO] [stderr] | ---------- fields in this struct [INFO] [stderr] 50 | root: usize, [INFO] [stderr] | ^^^^ [INFO] [stderr] 51 | //根节点id [INFO] [stderr] 52 | owner: &'a mut ArenaList, [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `from_vec`, `clear`, `to_vec`, `get`, `insert`, and `del` are never used [INFO] [stderr] --> src/linked_list.rs:56:8 [INFO] [stderr] | [INFO] [stderr] 55 | impl<'a, T> LinkedList<'a, T> { [INFO] [stderr] | ----------------------------- associated items in this implementation [INFO] [stderr] 56 | fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 71 | fn clear() {} [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 74 | fn to_vec(&self) -> Vec<&T> { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 93 | fn get(&self, mut num: usize) -> &Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 109 | fn insert(&mut self, mut num: usize, data: T) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 130 | fn del(&mut self, mut num: usize) -> bool { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: method `split` is never used [INFO] [stderr] --> src/linked_list.rs:156:8 [INFO] [stderr] | [INFO] [stderr] 153 | impl<'a, T> LinkedList<'a, T> { [INFO] [stderr] | ----------------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 156 | fn split(&mut self, mut num: usize) -> LinkedList { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `ArenaList` is never constructed [INFO] [stderr] --> src/history/linked_list.rs:11:12 [INFO] [stderr] | [INFO] [stderr] 11 | pub struct ArenaList { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `NodeInfo` is never constructed [INFO] [stderr] --> src/history/linked_list.rs:17:12 [INFO] [stderr] | [INFO] [stderr] 17 | pub struct NodeInfo { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Node` is never constructed [INFO] [stderr] --> src/history/linked_list.rs:23:12 [INFO] [stderr] | [INFO] [stderr] 23 | pub struct Node<'a, T> { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `make_node`, `compact`, and `clear` are never used [INFO] [stderr] --> src/history/linked_list.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 29 | impl ArenaList { [INFO] [stderr] | -------------------- associated items in this implementation [INFO] [stderr] 30 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 39 | fn make_node(&mut self, data: Option) -> usize { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 45 | fn compact(&mut self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 57 | fn clear(&mut self) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/history/linked_list.rs:65:8 [INFO] [stderr] | [INFO] [stderr] 64 | impl<'a, T> Node<'a, T> { [INFO] [stderr] | ----------------------- associated items in this implementation [INFO] [stderr] 65 | fn init_with_dummy(arena_list: &'a mut ArenaList) -> Self { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 73 | fn push_by_vec(&mut self, vec: Vec) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 81 | fn from_vec(arena_list: &'a mut ArenaList, vec: Vec) -> Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 87 | fn to_vec(&self) -> Vec<&T> { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 102 | fn insert(&mut self, mut idx: usize, val: T) -> bool { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 123 | fn get(&self, mut idx: usize) -> &Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 139 | fn del(&mut self, mut idx: usize) -> bool { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Node` is never constructed [INFO] [stderr] --> src/history/graph.rs:29:12 [INFO] [stderr] | [INFO] [stderr] 29 | pub struct Node { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `ArenaList` is never constructed [INFO] [stderr] --> src/history/graph.rs:36:12 [INFO] [stderr] | [INFO] [stderr] 36 | pub struct ArenaList { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/history/graph.rs:47:8 [INFO] [stderr] | [INFO] [stderr] 46 | impl ArenaList { [INFO] [stderr] | -------------------- associated items in this implementation [INFO] [stderr] 47 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 55 | fn clear(&mut self) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 62 | fn make_or_get_node(&mut self, name: &str, data: T) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 79 | fn get_idx_by_name(&self, name: &str) -> Option<&usize> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 84 | fn add_next_idx(&mut self, src_idx: usize, dst_idx: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 96 | fn del_node_by_idx(&mut self, idx: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 110 | fn del_edge_by_idx(&mut self, src_idx: usize, dst_idx: usize) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 118 | fn compact(&mut self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Graph` is never constructed [INFO] [stderr] --> src/history/graph.rs:124:12 [INFO] [stderr] | [INFO] [stderr] 124 | pub struct Graph<'a, T> { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/history/graph.rs:129:8 [INFO] [stderr] | [INFO] [stderr] 128 | impl<'a, T> Graph<'a, T> { [INFO] [stderr] | ------------------------ associated items in this implementation [INFO] [stderr] 129 | fn new(arena_list: &'a mut ArenaList) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 136 | fn add_node(&mut self, name: &str, data: T) -> usize { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 142 | fn add_edge(&mut self, src_name: &str, src_data: T, dst_name: &str, dst_data: T) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 150 | fn get_node_by_idx(&self, idx: usize) -> Option<&Node> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 155 | fn get_name_by_idx(&self, idx: usize) -> Option<&String> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 162 | fn get_idx_by_name(&self, name: &str) -> Option<&usize> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 167 | fn get_edges(&self) -> Vec<(usize, usize)> { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 183 | fn print_edges(&self) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 201 | fn del_node_by_idx(&mut self, idx: usize) -> bool { self.owner.del_node_by_idx(idx) } [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] 202 | // 删除边 [INFO] [stderr] 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] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 206 | fn del_node_by_name(&mut self, name: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 214 | fn del_edge_by_name(&mut self, src_name: &str, dst_name: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Node` is never constructed [INFO] [stderr] --> src/graph.rs:27:12 [INFO] [stderr] | [INFO] [stderr] 27 | pub struct Node { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `ArenaList` is never constructed [INFO] [stderr] --> src/graph.rs:35:12 [INFO] [stderr] | [INFO] [stderr] 35 | pub struct ArenaList { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/graph.rs:44:8 [INFO] [stderr] | [INFO] [stderr] 43 | impl ArenaList { [INFO] [stderr] | -------------------- associated items in this implementation [INFO] [stderr] 44 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 51 | fn clear(&mut self) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 57 | fn add_node(&mut self, name: &str, data: T) -> usize { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 78 | fn get_node(&self, idx: usize) -> &Node { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 83 | fn get_idx_by_name(&self, name: &str) -> Option<&usize> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 86 | fn get_name_by_idx(&self, idx: usize) -> &str { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 90 | fn add_edge(&mut self, src_idx: usize, dst_idx: usize) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 96 | fn del_edge(&mut self, src_idx: usize, dst_idx: usize) -> bool { [INFO] [stdout] [INFO] [stderr] | ^^^^^^^^ [INFO] [stdout] running 6 tests [INFO] [stderr] ... [INFO] [stderr] 103 | fn del_node(&mut self, idx: usize) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Graph` is never constructed [INFO] [stderr] --> src/graph.rs:168:12 [INFO] [stderr] | [INFO] [stderr] 168 | pub struct Graph<'a, T> { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: multiple associated items are never used [INFO] [stderr] --> src/graph.rs:173:8 [INFO] [stderr] | [INFO] [stderr] 172 | impl<'a, T> Graph<'a, T> { [INFO] [stderr] | ------------------------ associated items in this implementation [INFO] [stderr] 173 | fn new(arena_list: &'a mut ArenaList) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 180 | fn add_node(&mut self, name: &str, data: T) -> usize { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 185 | fn add_edge(&mut self, src_idx: usize, dst_idx: usize) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 190 | fn add_node_and_edge(&mut self, src_name: &str, src_data: T, dst_name: &str, dst_data: T) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 198 | fn get_node_by_idx(&self, idx: usize) -> &Node { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 202 | fn get_name_by_idx(&self, idx: usize) -> &String { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 206 | fn get_idx_by_name(&self, name: &str) -> Option<&usize> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 212 | fn get_all_edges(&self) -> Vec<(usize, usize)> { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 223 | fn print_nodes(&self) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 227 | fn print_edges(&self) { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 236 | fn del_node_by_idx(&mut self, idx: usize) -> bool { self.owner.del_node(idx) } [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] 237 | // 删除边 [INFO] [stderr] 238 | fn del_edge_by_idx(&mut self, src_idx: usize, dst_idx: usize) -> bool { self.owner.del_edge(src_idx, dst_idx) } [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 241 | fn del_node_by_name(&mut self, name: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 249 | fn del_edge_by_name(&mut self, src_name: &str, dst_name: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 257 | fn clear(&mut self) { self.owner.clear() } [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 260 | fn save(&self) {} [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 263 | fn load(&mut self) {} [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `get_downstream` and `get_shortest` are never used [INFO] [stderr] --> src/graph.rs:268:8 [INFO] [stderr] | [INFO] [stderr] 266 | impl<'a, T> Graph<'a, T> { [INFO] [stderr] | ------------------------ methods in this implementation [INFO] [stderr] 267 | // 找到某个节点的全部下游节点。返回的数据结构是 {level: [idx1, idx2, ...]} 的 HashMap，存放的是下游层数、节点号 [INFO] [stderr] 268 | fn get_downstream(&self, batch_idx: Vec, max_level: usize) -> HashMap> { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 286 | fn get_shortest(&self, src_idx: usize, dst_idx: usize, max_level: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `clear` is never used [INFO] [stderr] --> src/double_linked_list.rs:27:8 [INFO] [stderr] | [INFO] [stderr] 19 | impl ArenaList { [INFO] [stderr] | -------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 27 | fn clear(&mut self) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/linked_list.rs:156:14 [INFO] [stderr] | [INFO] [stderr] 156 | fn split(&mut self, mut num: usize) -> LinkedList { [INFO] [stderr] | ^^^^^^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stderr] | | [INFO] [stderr] | this lifetime flows to the output [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stderr] | [INFO] [stderr] 156 | fn split(&mut self, mut num: usize) -> LinkedList<'_, T> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/double_linked_list.rs:133:34 [INFO] [stderr] | [INFO] [stderr] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList { [INFO] [stderr] | ^^ this lifetime flows to the output ------------------- the lifetime gets resolved as `'a` [INFO] [stderr] | [INFO] [stderr] help: one option is to consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 133 | pub fn from_vec(arena_list: &'a mut ArenaList, vec1: Vec) -> DoubleLinkedList<'a, T> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: `rust-algo` (lib) generated 29 warnings (run `cargo fix --lib -p rust-algo` to apply 7 suggestions) [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> tests/test_double_linked_list.rs:7:9 [INFO] [stderr] | [INFO] [stderr] 7 | let mut double_linked_list = DoubleLinkedList::new(&mut arena_list); [INFO] [stderr] | ----^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused import: `rust_algo::linked_list` [INFO] [stderr] --> tests/test_linked_list.rs:1:5 [INFO] [stderr] | [INFO] [stderr] 1 | use rust_algo::linked_list; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `rust-algo` (test "test_double_linked_list") generated 1 warning (run `cargo fix --test "test_double_linked_list"` to apply 1 suggestion) [INFO] [stderr] warning: `rust-algo` (test "test_linked_list") generated 1 warning (run `cargo fix --test "test_linked_list"` to apply 1 suggestion) [INFO] [stderr] warning: unused imports: `HashMap` and `HashSet` [INFO] [stderr] --> src/graph.rs:308:28 [INFO] [stderr] | [INFO] [stderr] 308 | use std::collections::{HashMap, HashSet}; [INFO] [stderr] | ^^^^^^^ ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/linked_list.rs:203:13 [INFO] [stderr] | [INFO] [stderr] 203 | let mut linked_list2 = linked_list1.split(3); [INFO] [stderr] | ----^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `edges` [INFO] [stderr] --> src/history/graph.rs:266:13 [INFO] [stderr] | [INFO] [stderr] 266 | let edges = graph.get_edges(); [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `edges` [INFO] [stderr] --> src/graph.rs:347:13 [INFO] [stderr] | [INFO] [stderr] 347 | let edges = graph.get_all_edges(); [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/double_linked_list.rs:60:13 [INFO] [stderr] | [INFO] [stderr] 60 | let mut node_to_del = self.nodes.swap_remove(idx); [INFO] [stderr] | ----^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: associated function `clear` is never used [INFO] [stderr] --> src/linked_list.rs:71:8 [INFO] [stderr] | [INFO] [stderr] 55 | impl<'a, T> LinkedList<'a, T> { [INFO] [stderr] | ----------------------------- associated function in this implementation [INFO] [stderr] ... [INFO] [stderr] 71 | fn clear() {} [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: field `len` is never read [INFO] [stderr] --> src/history/linked_list.rs:14:5 [INFO] [stderr] | [INFO] [stderr] 11 | pub struct ArenaList { [INFO] [stderr] | --------- field in this struct [INFO] [stderr] ... [INFO] [stderr] 14 | len: usize, [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `compact` and `clear` are never used [INFO] [stderr] --> src/history/linked_list.rs:45:8 [INFO] [stderr] | [INFO] [stderr] 29 | impl ArenaList { [INFO] [stderr] | -------------------- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 45 | fn compact(&mut self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 57 | fn clear(&mut self) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field `data` is never read [INFO] [stderr] --> src/history/graph.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 29 | pub struct Node { [INFO] [stderr] | ---- field in this struct [INFO] [stderr] 30 | name: String, [INFO] [stderr] 31 | data: T, [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `clear` and `compact` are never used [INFO] [stderr] --> src/history/graph.rs:55:8 [INFO] [stderr] | [INFO] [stderr] 46 | impl ArenaList { [INFO] [stderr] | -------------------- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 55 | fn clear(&mut self) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 118 | fn compact(&mut self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `get_name_by_idx` is never used [INFO] [stderr] --> src/history/graph.rs:155:8 [INFO] [stderr] | [INFO] [stderr] 128 | impl<'a, T> Graph<'a, T> { [INFO] [stderr] | ------------------------ method in this implementation [INFO] [stderr] ... [INFO] [stderr] 155 | fn get_name_by_idx(&self, idx: usize) -> Option<&String> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: method `get_name_by_idx` is never used [INFO] [stderr] --> src/graph.rs:86:8 [INFO] [stderr] | [INFO] [stderr] 43 | impl ArenaList { [INFO] [stderr] | -------------------- method in this implementation [INFO] [stderr] ... [INFO] [stderr] 86 | fn get_name_by_idx(&self, idx: usize) -> &str { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `save` and `load` are never used [INFO] [stderr] --> src/graph.rs:260:8 [INFO] [stderr] | [INFO] [stderr] 172 | impl<'a, T> Graph<'a, T> { [INFO] [stderr] | ------------------------ methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 260 | fn save(&self) {} [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 263 | fn load(&mut self) {} [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: `rust-algo` (lib test) generated 21 warnings (8 duplicates) (run `cargo fix --lib -p rust-algo --tests` to apply 3 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.03s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/rust_algo-a3bbeba86f4b411b) [INFO] [stdout] test graph::tests::test1 ... ok [INFO] [stdout] test linked_list::tests::test1 ... ok [INFO] [stdout] test graph::tests::test2 ... ok [INFO] [stdout] test history::graph::tests::test1 ... ok [INFO] [stdout] test linked_list::tests::test2 ... ok [INFO] [stdout] test history::linked_list::tests::test2 ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 6 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s [INFO] [stdout] [INFO] [stderr] Running tests/test_double_linked_list.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/test_double_linked_list-e1fd226438d1ce4b) [INFO] [stdout] [INFO] [stderr] Running tests/test_linked_list.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/test_linked_list-51d8d2e2db560e95) [INFO] [stdout] running 1 test [INFO] [stdout] test func1 ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] running 1 test [INFO] [stdout] test func1 ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "96fa6bbebfa43990a65dbfec8a518aeffb688fe973d1eaee53a484d1839d341b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "96fa6bbebfa43990a65dbfec8a518aeffb688fe973d1eaee53a484d1839d341b", kill_on_drop: false }` [INFO] [stdout] 96fa6bbebfa43990a65dbfec8a518aeffb688fe973d1eaee53a484d1839d341b