[INFO] fetching crate adjacency-list 0.0.2...
[INFO] checking adjacency-list-0.0.2 against master#ff647322379c48947c196639599067665ff9eb88 for pr-151539-1
[INFO] extracting crate adjacency-list 0.0.2 into /workspace/builds/worker-4-tc1/source
[INFO] started tweaking crates.io crate adjacency-list 0.0.2
[INFO] finished tweaking crates.io crate adjacency-list 0.0.2
[INFO] tweaked toml for crates.io crate adjacency-list 0.0.2 written to /workspace/builds/worker-4-tc1/source/Cargo.toml
[INFO] validating manifest of crates.io crate adjacency-list 0.0.2 on toolchain ff647322379c48947c196639599067665ff9eb88
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ff647322379c48947c196639599067665ff9eb88" "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" "+ff647322379c48947c196639599067665ff9eb88" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]      Locking 28 packages to latest compatible versions
[INFO] [stderr]       Adding graph-types v0.0.12 (available: v0.0.13)
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ff647322379c48947c196639599067665ff9eb88" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded graph-types v0.0.12
[INFO] [stderr]   Downloaded num v0.4.3
[INFO] [stderr]   Downloaded ordered-float v3.9.2
[INFO] [stderr]   Downloaded autocfg v1.5.1
[INFO] [stderr]   Downloaded wolfram_wxf v0.6.6
[INFO] [stderr]   Downloaded num-complex v0.4.6
[INFO] [stderr]   Downloaded integer-encoding v3.0.4
[INFO] [stderr]   Downloaded rawpointer v0.2.1
[INFO] [stderr]   Downloaded matrixmultiply v0.3.10
[INFO] [stderr]   Downloaded ndarray v0.15.6
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,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" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:3a6becf2bc8dde7f3fa57ede90e4f284e72d296796fc446bbb1e2c7cc0530151" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] 8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef
[INFO] running `Command { std: "docker" "start" "8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef" "/opt/rustwide/cargo-home/bin/cargo" "+ff647322379c48947c196639599067665ff9eb88" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "-w" "/opt/rustwide/workdir" "--user" "0:0" "8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef" "/opt/rustwide/cargo-home/bin/cargo" "+ff647322379c48947c196639599067665ff9eb88" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]     Checking graph-types v0.0.12
[INFO] [stderr]     Checking adjacency-list v0.0.2 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused imports: `NodeRangeVisitor` and `NodesVisitor`
[INFO] [stdout]  --> src/sparse_edges/mod.rs:4:89
[INFO] [stdout]   |
[INFO] [stdout] 4 |     Edge, EdgeDirection, EdgeInsertID, EdgeQuery, GraphEngine, GraphKind, MutableGraph, NodeRangeVisitor, NodesVisitor,
[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 imports: `BTreeMap`, `BTreeSet`, and `btree_set::Iter`
[INFO] [stdout]  --> src/sparse_edges/one_way_iter.rs:3:46
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::collections::{btree_map, btree_set, btree_set::Iter, BTreeMap, BTreeSet};
[INFO] [stdout]   |                                              ^^^^^^^^^^^^^^^  ^^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `NodeRangeVisitor` and `NodesVisitor`
[INFO] [stdout]  --> src/sparse_nodes/mod.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 |     NodeRangeVisitor, NodesVisitor,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `NodeRangeVisitor` and `NodesVisitor`
[INFO] [stdout]  --> src/sparse_edges/mod.rs:4:89
[INFO] [stdout]   |
[INFO] [stdout] 4 |     Edge, EdgeDirection, EdgeInsertID, EdgeQuery, GraphEngine, GraphKind, MutableGraph, NodeRangeVisitor, NodesVisitor,
[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 imports: `BTreeMap`, `BTreeSet`, and `btree_set::Iter`
[INFO] [stdout]  --> src/sparse_edges/one_way_iter.rs:3:46
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::collections::{btree_map, btree_set, btree_set::Iter, BTreeMap, BTreeSet};
[INFO] [stdout]   |                                              ^^^^^^^^^^^^^^^  ^^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `NodeRangeVisitor` and `NodesVisitor`
[INFO] [stdout]  --> src/sparse_nodes/mod.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 |     NodeRangeVisitor, NodesVisitor,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/one_way.rs:31:31
[INFO] [stdout]    |
[INFO] [stdout] 31 |     fn get_outgoing(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                               ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/one_way.rs:34:31
[INFO] [stdout]    |
[INFO] [stdout] 34 |     fn get_incoming(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                               ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `from`
[INFO] [stdout]    --> src/sparse_edges/one_way.rs:123:39
[INFO] [stdout]     |
[INFO] [stdout] 123 |     pub(crate) fn find_edge_id(&self, from: u32, goto: u32) -> Result<EdgeID, GraphError> {
[INFO] [stdout]     |                                       ^^^^ help: if this is intentional, prefix it with an underscore: `_from`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `goto`
[INFO] [stdout]    --> src/sparse_edges/one_way.rs:123:50
[INFO] [stdout]     |
[INFO] [stdout] 123 |     pub(crate) fn find_edge_id(&self, from: u32, goto: u32) -> Result<EdgeID, GraphError> {
[INFO] [stdout]     |                                                  ^^^^ help: if this is intentional, prefix it with an underscore: `_goto`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.46s
[INFO] [stdout] warning: unused variable: `id`
[INFO] [stdout]   --> src/sparse_edges/one_way_iter.rs:77:14
[INFO] [stdout]    |
[INFO] [stdout] 77 |         let (id, edge) = self.edges.next()?;
[INFO] [stdout]    |              ^^ help: if this is intentional, prefix it with an underscore: `_id`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `id`
[INFO] [stdout]   --> src/sparse_edges/one_way_iter.rs:84:14
[INFO] [stdout]    |
[INFO] [stdout] 84 |         let (id, edge) = self.edges.next_back()?;
[INFO] [stdout]    |              ^^ help: if this is intentional, prefix it with an underscore: `_id`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:16:24
[INFO] [stdout]    |
[INFO] [stdout] 16 |     fn get_node(&self, node: NodeID) -> Result<NodeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:24:32
[INFO] [stdout]    |
[INFO] [stdout] 24 |     fn all_neighbors(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:28:24
[INFO] [stdout]    |
[INFO] [stdout] 28 |     fn get_edge(&self, edge: EdgeID) -> Result<EdgeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:36:26
[INFO] [stdout]    |
[INFO] [stdout] 36 |     fn get_bridge(&self, edge: EdgeID) -> Result<IndeterminateEdge, GraphError> {
[INFO] [stdout]    |                          ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `from`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:40:30
[INFO] [stdout]    |
[INFO] [stdout] 40 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                              ^^^^ help: if this is intentional, prefix it with an underscore: `_from`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `goto`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:40:44
[INFO] [stdout]    |
[INFO] [stdout] 40 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                                            ^^^^ help: if this is intentional, prefix it with an underscore: `_goto`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node_id`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:50:31
[INFO] [stdout]    |
[INFO] [stdout] 50 |     fn insert_node(&mut self, node_id: usize) -> bool {
[INFO] [stdout]    |                               ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node_id`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:42:24
[INFO] [stdout]    |
[INFO] [stdout] 42 |     fn get_node(&self, node: NodeID) -> Result<NodeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:50:32
[INFO] [stdout]    |
[INFO] [stdout] 50 |     fn all_neighbors(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:54:24
[INFO] [stdout]    |
[INFO] [stdout] 54 |     fn get_edge(&self, edge: graph_types::EdgeID) -> Result<graph_types::EdgeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:62:26
[INFO] [stdout]    |
[INFO] [stdout] 62 |     fn get_bridge(&self, edge: graph_types::EdgeID) -> Result<IndeterminateEdge, GraphError> {
[INFO] [stdout]    |                          ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `from`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:66:30
[INFO] [stdout]    |
[INFO] [stdout] 66 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                              ^^^^ help: if this is intentional, prefix it with an underscore: `_from`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `goto`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:66:44
[INFO] [stdout]    |
[INFO] [stdout] 66 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                                            ^^^^ help: if this is intentional, prefix it with an underscore: `_goto`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `find_edge_id` is never used
[INFO] [stdout]    --> src/sparse_edges/one_way.rs:123:19
[INFO] [stdout]     |
[INFO] [stdout] 122 | impl DiGraphAED {
[INFO] [stdout]     | --------------- method in this implementation
[INFO] [stdout] 123 |     pub(crate) fn find_edge_id(&self, from: u32, goto: u32) -> Result<EdgeID, GraphError> {
[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 `edges` and `target` are never read
[INFO] [stdout]   --> src/sparse_edges/one_way_iter.rs:27:16
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub struct EdgeFirstFindNeighbors<'i> {
[INFO] [stdout]    |            ---------------------- fields in this struct
[INFO] [stdout] 27 |     pub(crate) edges: btree_map::Iter<'i, u32, ShortEdge>,
[INFO] [stdout]    |                ^^^^^
[INFO] [stdout] 28 |     pub(crate) target: u32,
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `EdgeFirstFindNeighbors` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/one_way.rs:31:31
[INFO] [stdout]    |
[INFO] [stdout] 31 |     fn get_outgoing(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                               ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/one_way.rs:34:31
[INFO] [stdout]    |
[INFO] [stdout] 34 |     fn get_incoming(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                               ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `from`
[INFO] [stdout]    --> src/sparse_edges/one_way.rs:123:39
[INFO] [stdout]     |
[INFO] [stdout] 123 |     pub(crate) fn find_edge_id(&self, from: u32, goto: u32) -> Result<EdgeID, GraphError> {
[INFO] [stdout]     |                                       ^^^^ help: if this is intentional, prefix it with an underscore: `_from`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `goto`
[INFO] [stdout]    --> src/sparse_edges/one_way.rs:123:50
[INFO] [stdout]     |
[INFO] [stdout] 123 |     pub(crate) fn find_edge_id(&self, from: u32, goto: u32) -> Result<EdgeID, GraphError> {
[INFO] [stdout]     |                                                  ^^^^ help: if this is intentional, prefix it with an underscore: `_goto`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `id`
[INFO] [stdout]   --> src/sparse_edges/one_way_iter.rs:77:14
[INFO] [stdout]    |
[INFO] [stdout] 77 |         let (id, edge) = self.edges.next()?;
[INFO] [stdout]    |              ^^ help: if this is intentional, prefix it with an underscore: `_id`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `id`
[INFO] [stdout]   --> src/sparse_edges/one_way_iter.rs:84:14
[INFO] [stdout]    |
[INFO] [stdout] 84 |         let (id, edge) = self.edges.next_back()?;
[INFO] [stdout]    |              ^^ help: if this is intentional, prefix it with an underscore: `_id`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:16:24
[INFO] [stdout]    |
[INFO] [stdout] 16 |     fn get_node(&self, node: NodeID) -> Result<NodeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:24:32
[INFO] [stdout]    |
[INFO] [stdout] 24 |     fn all_neighbors(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:28:24
[INFO] [stdout]    |
[INFO] [stdout] 28 |     fn get_edge(&self, edge: EdgeID) -> Result<EdgeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:36:26
[INFO] [stdout]    |
[INFO] [stdout] 36 |     fn get_bridge(&self, edge: EdgeID) -> Result<IndeterminateEdge, GraphError> {
[INFO] [stdout]    |                          ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `from`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:40:30
[INFO] [stdout]    |
[INFO] [stdout] 40 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                              ^^^^ help: if this is intentional, prefix it with an underscore: `_from`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `goto`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:40:44
[INFO] [stdout]    |
[INFO] [stdout] 40 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                                            ^^^^ help: if this is intentional, prefix it with an underscore: `_goto`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node_id`
[INFO] [stdout]   --> src/sparse_edges/two_way.rs:50:31
[INFO] [stdout]    |
[INFO] [stdout] 50 |     fn insert_node(&mut self, node_id: usize) -> bool {
[INFO] [stdout]    |                               ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node_id`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:42:24
[INFO] [stdout]    |
[INFO] [stdout] 42 |     fn get_node(&self, node: NodeID) -> Result<NodeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `node`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:50:32
[INFO] [stdout]    |
[INFO] [stdout] 50 |     fn all_neighbors(&'a self, node: NodeID) -> Self::NeighborIterator {
[INFO] [stdout]    |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:54:24
[INFO] [stdout]    |
[INFO] [stdout] 54 |     fn get_edge(&self, edge: graph_types::EdgeID) -> Result<graph_types::EdgeID, GraphError> {
[INFO] [stdout]    |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edge`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:62:26
[INFO] [stdout]    |
[INFO] [stdout] 62 |     fn get_bridge(&self, edge: graph_types::EdgeID) -> Result<IndeterminateEdge, GraphError> {
[INFO] [stdout]    |                          ^^^^ help: if this is intentional, prefix it with an underscore: `_edge`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `from`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:66:30
[INFO] [stdout]    |
[INFO] [stdout] 66 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                              ^^^^ help: if this is intentional, prefix it with an underscore: `_from`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `goto`
[INFO] [stdout]   --> src/sparse_nodes/mod.rs:66:44
[INFO] [stdout]    |
[INFO] [stdout] 66 |     fn get_bridges(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator {
[INFO] [stdout]    |                                            ^^^^ help: if this is intentional, prefix it with an underscore: `_goto`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `find_edge_id` is never used
[INFO] [stdout]    --> src/sparse_edges/one_way.rs:123:19
[INFO] [stdout]     |
[INFO] [stdout] 122 | impl DiGraphAED {
[INFO] [stdout]     | --------------- method in this implementation
[INFO] [stdout] 123 |     pub(crate) fn find_edge_id(&self, from: u32, goto: u32) -> Result<EdgeID, GraphError> {
[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 `edges` and `target` are never read
[INFO] [stdout]   --> src/sparse_edges/one_way_iter.rs:27:16
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub struct EdgeFirstFindNeighbors<'i> {
[INFO] [stdout]    |            ---------------------- fields in this struct
[INFO] [stdout] 27 |     pub(crate) edges: btree_map::Iter<'i, u32, ShortEdge>,
[INFO] [stdout]    |                ^^^^^
[INFO] [stdout] 28 |     pub(crate) target: u32,
[INFO] [stdout]    |                ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `EdgeFirstFindNeighbors` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef", kill_on_drop: false }`
[INFO] [stdout] 8a4be8b282d61668d474b7e30abe5c1d5ec026b0fbef9cc23a3dbb3b22287eef
