[INFO] cloning repository https://github.com/Lucian-4a25/rust-collections
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Lucian-4a25/rust-collections" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLucian-4a25%2Frust-collections", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLucian-4a25%2Frust-collections'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 5d4532997a77ab2c458d21131f56d2ebae5625a0
[INFO] checking Lucian-4a25/rust-collections/5d4532997a77ab2c458d21131f56d2ebae5625a0 against master#ab869e094a907cc5d19b4080f22eccaf347f1f95 for pr-129604
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLucian-4a25%2Frust-collections" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/Lucian-4a25/rust-collections on toolchain ab869e094a907cc5d19b4080f22eccaf347f1f95
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/Lucian-4a25/rust-collections
[INFO] finished tweaking git repo https://github.com/Lucian-4a25/rust-collections
[INFO] tweaked toml for git repo https://github.com/Lucian-4a25/rust-collections written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/Lucian-4a25/rust-collections already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 762f2486f20d02151d530841856ef9bf82bb9862694af3ac49157750cca69cc3
[INFO] running `Command { std: "docker" "start" "-a" "762f2486f20d02151d530841856ef9bf82bb9862694af3ac49157750cca69cc3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "762f2486f20d02151d530841856ef9bf82bb9862694af3ac49157750cca69cc3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "762f2486f20d02151d530841856ef9bf82bb9862694af3ac49157750cca69cc3", kill_on_drop: false }`
[INFO] [stdout] 762f2486f20d02151d530841856ef9bf82bb9862694af3ac49157750cca69cc3
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 6770c8b765a9c34b1d6e5562bc31aa14ff9c3c0518236b1fae654b05444bf859
[INFO] running `Command { std: "docker" "start" "-a" "6770c8b765a9c34b1d6e5562bc31aa14ff9c3c0518236b1fae654b05444bf859", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.153
[INFO] [stderr]     Checking hashbrown v0.14.0
[INFO] [stderr]     Checking fixedbitset v0.4.2
[INFO] [stderr]     Checking itertools v0.11.0
[INFO] [stderr]     Checking indexmap v2.0.0
[INFO] [stderr]     Checking petgraph v0.6.4
[INFO] [stderr]     Checking getrandom v0.2.13
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking rust-collections v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `IntoNeiborghbors`
[INFO] [stdout]  --> src/graph/algo/simple_paths.rs:2:13
[INFO] [stdout]   |
[INFO] [stdout] 2 |     visit::{IntoNeiborghbors, IntoNeighborsDirected, NodeCount},
[INFO] [stdout]   |             ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VisitMap`
[INFO] [stdout]   --> src/graph/algo/mod.rs:11:77
[INFO] [stdout]    |
[INFO] [stdout] 11 | use super::visit::{IntoNeighborsDirected, IntoNodeIdentifiers, Topological, VisitMap, Visitable};
[INFO] [stdout]    |                                                                             ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap`, `HashSet`, and `hash::Hash`
[INFO] [stdout]   --> src/graph/algo/mod.rs:15:19
[INFO] [stdout]    |
[INFO] [stdout] 15 |     collections::{HashMap, HashSet},
[INFO] [stdout]    |                   ^^^^^^^  ^^^^^^^
[INFO] [stdout] 16 |     hash::Hash,
[INFO] [stdout]    |     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `IntoNeiborghbors`
[INFO] [stdout]  --> src/graph/algo/simple_paths.rs:2:13
[INFO] [stdout]   |
[INFO] [stdout] 2 |     visit::{IntoNeiborghbors, IntoNeighborsDirected, NodeCount},
[INFO] [stdout]   |             ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VisitMap`
[INFO] [stdout]   --> src/graph/algo/mod.rs:11:77
[INFO] [stdout]    |
[INFO] [stdout] 11 | use super::visit::{IntoNeighborsDirected, IntoNodeIdentifiers, Topological, VisitMap, Visitable};
[INFO] [stdout]    |                                                                             ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap`, `HashSet`, and `hash::Hash`
[INFO] [stdout]   --> src/graph/algo/mod.rs:15:19
[INFO] [stdout]    |
[INFO] [stdout] 15 |     collections::{HashMap, HashSet},
[INFO] [stdout]    |                   ^^^^^^^  ^^^^^^^
[INFO] [stdout] 16 |     hash::Hash,
[INFO] [stdout]    |     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/lib.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/lib.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/btreemap_cus.rs:205:17
[INFO] [stdout]     |
[INFO] [stdout] 205 |             let mut new_node_mut = new_node.as_mut();
[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/btreemap_cus.rs:205:17
[INFO] [stdout]     |
[INFO] [stdout] 205 |             let mut new_node_mut = new_node.as_mut();
[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: variant `NonOuter` is never constructed
[INFO] [stdout]    --> src/graph/algo/matching.rs:246:5
[INFO] [stdout]     |
[INFO] [stdout] 241 | enum Label {
[INFO] [stdout]     |      ----- variant in this enum
[INFO] [stdout] ...
[INFO] [stdout] 246 |     NonOuter,
[INFO] [stdout]     |     ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `Label` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 6 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `GraphBase`
[INFO] [stdout]  --> benches/common/factory.rs:3:13
[INFO] [stdout]   |
[INFO] [stdout] 3 |     visit::{GraphBase, NodeIndexable},
[INFO] [stdout]   |             ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rust_collections::graph::visit::IntoNeighborsDirected`
[INFO] [stdout]  --> tests/algo/isomorphism.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 7 | use rust_collections::graph::visit::IntoNeighborsDirected;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Direction`
[INFO] [stdout]  --> tests/algo/isomorphism.rs:8:41
[INFO] [stdout]   |
[INFO] [stdout] 8 | use rust_collections::graph::{Directed, Direction, GraphType, UnDirected};
[INFO] [stdout]   |                                         ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unexpected `cfg` condition value: `stable_graph`
[INFO] [stdout]    --> tests/algo/matching.rs:107:7
[INFO] [stdout]     |
[INFO] [stdout] 107 | #[cfg(feature = "stable_graph")]
[INFO] [stdout]     |       ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove the condition
[INFO] [stdout]     |
[INFO] [stdout]     = note: no expected values for `feature`
[INFO] [stdout]     = help: consider adding `stable_graph` as a feature in `Cargo.toml`
[INFO] [stdout]     = note: see <https://doc.rust-lang.org/nightly/rustc/check-cfg/cargo-specifics.html> for more information about checking conditional configuration
[INFO] [stdout]     = note: `#[warn(unexpected_cfgs)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unexpected `cfg` condition value: `stable_graph`
[INFO] [stdout]    --> tests/algo/matching.rs:132:7
[INFO] [stdout]     |
[INFO] [stdout] 132 | #[cfg(feature = "stable_graph")]
[INFO] [stdout]     |       ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove the condition
[INFO] [stdout]     |
[INFO] [stdout]     = note: no expected values for `feature`
[INFO] [stdout]     = help: consider adding `stable_graph` as a feature in `Cargo.toml`
[INFO] [stdout]     = note: see <https://doc.rust-lang.org/nightly/rustc/check-cfg/cargo-specifics.html> for more information about checking conditional configuration
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variant `NonOuter` is never constructed
[INFO] [stdout]    --> src/graph/algo/matching.rs:246:5
[INFO] [stdout]     |
[INFO] [stdout] 241 | enum Label {
[INFO] [stdout]     |      ----- variant in this enum
[INFO] [stdout] ...
[INFO] [stdout] 246 |     NonOuter,
[INFO] [stdout]     |     ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `Label` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]   --> src/main.rs:12:5
[INFO] [stdout]    |
[INFO] [stdout] 12 | use core::num;
[INFO] [stdout]    |     ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::mem::ManuallyDrop`
[INFO] [stdout]   --> src/main.rs:14:5
[INFO] [stdout]    |
[INFO] [stdout] 14 | use std::mem::ManuallyDrop;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread`
[INFO] [stdout]   --> src/main.rs:15:5
[INFO] [stdout]    |
[INFO] [stdout] 15 | use std::thread;
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `Error`, `Read`, `Seek`, `alloc::Layout`, `fs::File`, `ptr::addr_of_mut`, and `time::Duration`
[INFO] [stdout]   --> src/main.rs:17:5
[INFO] [stdout]    |
[INFO] [stdout] 17 |     alloc::Layout,
[INFO] [stdout]    |     ^^^^^^^^^^^^^
[INFO] [stdout] 18 |     collections::{BTreeMap, HashMap, LinkedList, VecDeque},
[INFO] [stdout] 19 |     fs::File,
[INFO] [stdout]    |     ^^^^^^^^
[INFO] [stdout] 20 |     io::{Error, Read, Seek},
[INFO] [stdout]    |          ^^^^^  ^^^^  ^^^^
[INFO] [stdout] 21 |     mem::MaybeUninit,
[INFO] [stdout] 22 |     ptr::addr_of_mut,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^
[INFO] [stdout] 23 |     time::Duration,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `Directed` and `Direction`
[INFO] [stdout]   --> src/main.rs:26:16
[INFO] [stdout]    |
[INFO] [stdout] 26 | use petgraph::{Directed, Direction};
[INFO] [stdout]    |                ^^^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `is_isomorphism_matching`, `is_isomorphism_semantic_matching`, `isomorphism_matching_iter`, and `isomorphism_semantic_matching_iter`
[INFO] [stdout]  --> src/graph/algo/isomorphism/mod.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 7 |     is_isomorphism_matching, is_isomorphism_semantic_matching, isomorphism_matching_iter,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 8 |     isomorphism_semantic_matching_iter,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `vf2pp::Vf2ppMatcherBuilder`
[INFO] [stdout]   --> src/graph/algo/isomorphism/mod.rs:11:9
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub use vf2pp::Vf2ppMatcherBuilder;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `vf2pp_is_isomorphism_matching`, `vf2pp_is_isomorphism_semantic_matching`, and `vf2pp_isomorphism_semantic_matching_iter`
[INFO] [stdout]   --> src/graph/algo/isomorphism/mod.rs:13:5
[INFO] [stdout]    |
[INFO] [stdout] 13 |     vf2pp_is_isomorphism_matching, vf2pp_is_isomorphism_semantic_matching,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 14 |     vf2pp_isomorphism_semantic_matching_iter,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `IntoNeiborghbors`
[INFO] [stdout]  --> src/graph/algo/simple_paths.rs:2:13
[INFO] [stdout]   |
[INFO] [stdout] 2 |     visit::{IntoNeiborghbors, IntoNeighborsDirected, NodeCount},
[INFO] [stdout]   |             ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VisitMap`
[INFO] [stdout]   --> src/graph/algo/mod.rs:11:77
[INFO] [stdout]    |
[INFO] [stdout] 11 | use super::visit::{IntoNeighborsDirected, IntoNodeIdentifiers, Topological, VisitMap, Visitable};
[INFO] [stdout]    |                                                                             ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap`, `HashSet`, and `hash::Hash`
[INFO] [stdout]   --> src/graph/algo/mod.rs:15:19
[INFO] [stdout]    |
[INFO] [stdout] 15 |     collections::{HashMap, HashSet},
[INFO] [stdout]    |                   ^^^^^^^  ^^^^^^^
[INFO] [stdout] 16 |     hash::Hash,
[INFO] [stdout]    |     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `collections::HashSet`
[INFO] [stdout]  --> src/skip_list.rs:2:26
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::{cmp::Ordering, collections::HashSet, fmt::Debug, ptr::NonNull};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 6 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]   --> src/main.rs:12:5
[INFO] [stdout]    |
[INFO] [stdout] 12 | use core::num;
[INFO] [stdout]    |     ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::mem::ManuallyDrop`
[INFO] [stdout]   --> src/main.rs:14:5
[INFO] [stdout]    |
[INFO] [stdout] 14 | use std::mem::ManuallyDrop;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread`
[INFO] [stdout]   --> src/main.rs:15:5
[INFO] [stdout]    |
[INFO] [stdout] 15 | use std::thread;
[INFO] [stdout]    |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/main.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `alloc::Layout` and `time::Duration`
[INFO] [stdout]   --> src/main.rs:17:5
[INFO] [stdout]    |
[INFO] [stdout] 17 |     alloc::Layout,
[INFO] [stdout]    |     ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     time::Duration,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Direction`
[INFO] [stdout]   --> src/main.rs:26:26
[INFO] [stdout]    |
[INFO] [stdout] 26 | use petgraph::{Directed, Direction};
[INFO] [stdout]    |                          ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `is_isomorphism_matching`, `is_isomorphism_semantic_matching`, `isomorphism_matching_iter`, and `isomorphism_semantic_matching_iter`
[INFO] [stdout]  --> src/graph/algo/isomorphism/mod.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 7 |     is_isomorphism_matching, is_isomorphism_semantic_matching, isomorphism_matching_iter,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 8 |     isomorphism_semantic_matching_iter,
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `vf2pp::Vf2ppMatcherBuilder`
[INFO] [stdout]   --> src/graph/algo/isomorphism/mod.rs:11:9
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub use vf2pp::Vf2ppMatcherBuilder;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `vf2pp_is_isomorphism_matching`, `vf2pp_is_isomorphism_semantic_matching`, and `vf2pp_isomorphism_semantic_matching_iter`
[INFO] [stdout]   --> src/graph/algo/isomorphism/mod.rs:13:5
[INFO] [stdout]    |
[INFO] [stdout] 13 |     vf2pp_is_isomorphism_matching, vf2pp_is_isomorphism_semantic_matching,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 14 |     vf2pp_isomorphism_semantic_matching_iter,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `IntoNeiborghbors`
[INFO] [stdout]  --> src/graph/algo/simple_paths.rs:2:13
[INFO] [stdout]   |
[INFO] [stdout] 2 |     visit::{IntoNeiborghbors, IntoNeighborsDirected, NodeCount},
[INFO] [stdout]   |             ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VisitMap`
[INFO] [stdout]   --> src/graph/algo/mod.rs:11:77
[INFO] [stdout]    |
[INFO] [stdout] 11 | use super::visit::{IntoNeighborsDirected, IntoNodeIdentifiers, Topological, VisitMap, Visitable};
[INFO] [stdout]    |                                                                             ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap`, `HashSet`, and `hash::Hash`
[INFO] [stdout]   --> src/graph/algo/mod.rs:15:19
[INFO] [stdout]    |
[INFO] [stdout] 15 |     collections::{HashMap, HashSet},
[INFO] [stdout]    |                   ^^^^^^^  ^^^^^^^
[INFO] [stdout] 16 |     hash::Hash,
[INFO] [stdout]    |     ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/main.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::io::Write`
[INFO] [stdout]   --> src/main.rs:13:5
[INFO] [stdout]    |
[INFO] [stdout] 13 | use std::io::Write;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/btreemap_cus.rs:205:17
[INFO] [stdout]     |
[INFO] [stdout] 205 |             let mut new_node_mut = new_node.as_mut();
[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: struct `FieldStruct` is never constructed
[INFO] [stdout]    --> src/main.rs:385:8
[INFO] [stdout]     |
[INFO] [stdout] 385 | struct FieldStruct {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_is_isomorphism_matching` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn vf2pp_is_isomorphism_matching<G0, G1>(g0: G0, g1: G1, subgraph: bool) -> bool
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_is_isomorphism_semantic_matching` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn vf2pp_is_isomorphism_semantic_matching<G0, G1, NM, EM>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_isomorphism_semantic_matching_iter` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn vf2pp_isomorphism_semantic_matching_iter<'a, G0, G1, NM, EM>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `is_match` are never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:151:8
[INFO] [stdout]     |
[INFO] [stdout] 133 | / impl<'a, G0, G1, NM, EM> IsomorphismMatcher<'a, G0, G1, NM, EM>
[INFO] [stdout] 134 | | where
[INFO] [stdout] 135 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 136 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 148 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 149 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- associated items in this implementation
[INFO] [stdout] 150 |   {
[INFO] [stdout] 151 |       fn new(vf2pp: VF2PP<G0, G1>, node_matcher: NM, edge_matcher: EM, subgraph: bool) -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 171 |       pub fn is_match(&mut self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:270:8
[INFO] [stdout]     |
[INFO] [stdout] 255 | / impl<G0, G1> VF2PP<G0, G1>
[INFO] [stdout] 256 | | where
[INFO] [stdout] 257 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 258 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 267 | |         + NodeCount
[INFO] [stdout] 268 | |         + GraphProp,
[INFO] [stdout]     | |____________________- associated function in this implementation
[INFO] [stdout] 269 |   {
[INFO] [stdout] 270 |       fn new<F0, F1>(g0: G0, g1: G1, mut label0: F0, mut label1: F1) -> Self
[INFO] [stdout]     |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Vf2ppMatcherBuilder` is never constructed
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:576:12
[INFO] [stdout]     |
[INFO] [stdout] 576 | pub struct Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:587:12
[INFO] [stdout]     |
[INFO] [stdout] 584 | / impl<G0, G1>
[INFO] [stdout] 585 | |     Vf2ppMatcherBuilder<G0, G1, NoNodeLabel, NoNodeLabel, NoSemanticMatch, NoSemanticMatch>
[INFO] [stdout]     | |___________________________________________________________________________________________- associated function in this implementation
[INFO] [stdout] 586 |   {
[INFO] [stdout] 587 |       pub fn new() -> Self
[INFO] [stdout]     |              ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_subgraph` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:611:12
[INFO] [stdout]     |
[INFO] [stdout] 602 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 603 | | where
[INFO] [stdout] 604 | |     G0: GraphBase,
[INFO] [stdout] 605 | |     G1: GraphBase,
[INFO] [stdout] ...   |
[INFO] [stdout] 608 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 609 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 610 |   {
[INFO] [stdout] 611 |       pub fn set_subgraph(mut self, match_subgraph: bool) -> Self {
[INFO] [stdout]     |              ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `build` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:636:12
[INFO] [stdout]     |
[INFO] [stdout] 617 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 618 | | where
[INFO] [stdout] 619 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 620 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 633 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 634 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 635 |   {
[INFO] [stdout] 636 |       pub fn build<'a>(self, g0: G0, g1: G1) -> IsomorphismMatcher<'a, G0, G1, NM, EM> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_label` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:652:12
[INFO] [stdout]     |
[INFO] [stdout] 643 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 644 | | where
[INFO] [stdout] 645 | |     G0: GraphBase + GraphDataAccess,
[INFO] [stdout] 646 | |     G1: GraphBase + GraphDataAccess,
[INFO] [stdout] ...   |
[INFO] [stdout] 649 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 650 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 651 |   {
[INFO] [stdout] 652 |       pub fn set_label<LF0, LF1>(
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_node_matcher` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:679:12
[INFO] [stdout]     |
[INFO] [stdout] 670 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 671 | | where
[INFO] [stdout] 672 | |     G0: GraphDataAccess + IntoEdgeDirected,
[INFO] [stdout] 673 | |     G1: GraphDataAccess + IntoEdgeDirected,
[INFO] [stdout] ...   |
[INFO] [stdout] 676 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 677 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 678 |   {
[INFO] [stdout] 679 |       pub fn set_node_matcher<N>(self, nm: N) -> Vf2ppMatcherBuilder<G0, G1, F0, F1, N, EM>
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_edge_matcher` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:702:12
[INFO] [stdout]     |
[INFO] [stdout] 693 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 694 | | where
[INFO] [stdout] 695 | |     G0: GraphDataAccess + IntoEdgeDirected + Copy,
[INFO] [stdout] 696 | |     G1: GraphDataAccess + IntoEdgeDirected + Copy,
[INFO] [stdout] ...   |
[INFO] [stdout] 699 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 700 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 701 |   {
[INFO] [stdout] 702 |       pub fn set_edge_matcher<E>(self, em: E) -> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, E>
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_shortest_path` is never used
[INFO] [stdout]   --> src/graph/algo/k_shortest_path.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn k_shortest_path<G, F, K>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `greedy_matching` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn greedy_matching<G>(g: G) -> Matching<G>
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs_non_backtracing` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn dfs_non_backtracing<G, F>(g: G, node: G::NodeId, visited: &mut G::Map, mut add_mate: F)
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_matching` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | pub fn maximum_matching<G>(g: G) -> Matching<G>
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `assign_edge_lable` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:145:4
[INFO] [stdout]     |
[INFO] [stdout] 145 | fn assign_edge_lable<G>(
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `augment_path` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:206:4
[INFO] [stdout]     |
[INFO] [stdout] 206 | fn augment_path(outer: usize, target: usize, mate: &mut Vec<Option<usize>>, label: &Vec<Label>) {
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Label` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:241:6
[INFO] [stdout]     |
[INFO] [stdout] 241 | enum Label {
[INFO] [stdout]     |      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `is_outer`, `is_nonouter`, `try_next_outer`, and `try_edge_outer` are never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:250:8
[INFO] [stdout]     |
[INFO] [stdout] 249 | impl Label {
[INFO] [stdout]     | ---------- methods in this implementation
[INFO] [stdout] 250 |     fn is_outer(self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 257 |     fn is_nonouter(self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 261 |     fn try_next_outer(self) -> Option<usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 268 |     fn try_edge_outer(self) -> Option<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Matching` is never constructed
[INFO] [stdout]    --> src/graph/algo/matching.rs:276:12
[INFO] [stdout]     |
[INFO] [stdout] 276 | pub struct Matching<G>
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `is_perfect` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:289:12
[INFO] [stdout]     |
[INFO] [stdout] 285 | / impl<G> Matching<G>
[INFO] [stdout] 286 | | where
[INFO] [stdout] 287 | |     G: NodeCount + GraphBase + Copy,
[INFO] [stdout]     | |____________________________________- method in this implementation
[INFO] [stdout] 288 |   {
[INFO] [stdout] 289 |       pub fn is_perfect(&self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple methods are never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:299:12
[INFO] [stdout]     |
[INFO] [stdout] 295 | / impl<G> Matching<G>
[INFO] [stdout] 296 | | where
[INFO] [stdout] 297 | |     G: NodeIndexable + Copy,
[INFO] [stdout]     | |____________________________- methods in this implementation
[INFO] [stdout] 298 |   {
[INFO] [stdout] 299 |       pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 306 |       pub fn edges(&self) -> MatchedEdges<'_, G> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 314 |       pub fn nodes(&self) -> MatchedNodes<'_, G> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 322 |       pub fn contains_edge(&self, n: G::NodeId, m: G::NodeId) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 329 |       pub fn contains_node(&self, n: G::NodeId) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 333 |       pub fn len(&self) -> usize {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 337 |       pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_simple_paths` is never used
[INFO] [stdout]  --> src/graph/algo/simple_paths.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn all_simple_paths<G, P>(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `print_all_levels` is never used
[INFO] [stdout]   --> src/skip_list.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | / impl<K: Ord + Copy, V> SkipList<K, V>
[INFO] [stdout] 45 | | where
[INFO] [stdout] 46 | |     K: Debug,
[INFO] [stdout] 47 | |     V: Debug,
[INFO] [stdout]    | |_____________- method in this implementation
[INFO] [stdout] 48 |   {
[INFO] [stdout] 49 |       fn print_all_levels(&self) {
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `std::slice::Iter` that must be used
[INFO] [stdout]    --> src/main.rs:350:5
[INFO] [stdout]     |
[INFO] [stdout] 350 |     v.iter();
[INFO] [stdout]     |     ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: iterators are lazy and do nothing unless consumed
[INFO] [stdout]     = note: `#[warn(unused_must_use)]` on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 350 |     let _ = v.iter();
[INFO] [stdout]     |     +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/btreemap_cus.rs:205:17
[INFO] [stdout]     |
[INFO] [stdout] 205 |             let mut new_node_mut = new_node.as_mut();
[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: 42 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `world`
[INFO] [stdout]   --> src/variance.rs:23:17
[INFO] [stdout]    |
[INFO] [stdout] 23 |             let world = String::from("world");
[INFO] [stdout]    |                 ^^^^^ help: if this is intentional, prefix it with an underscore: `_world`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/variance.rs:21:13
[INFO] [stdout]    |
[INFO] [stdout] 21 |         let mut hello: &'static str = "hello";
[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/main.rs:590:9
[INFO] [stdout]     |
[INFO] [stdout] 590 |     let mut a = A { v: Some([8; 10]) };
[INFO] [stdout]     |         ----^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `d`, `d2`, and `d3` are never read
[INFO] [stdout]    --> src/main.rs:183:9
[INFO] [stdout]     |
[INFO] [stdout] 182 |     struct Inner {
[INFO] [stdout]     |            ----- fields in this struct
[INFO] [stdout] 183 |         d: u64,
[INFO] [stdout]     |         ^
[INFO] [stdout] 184 |         d2: u32,
[INFO] [stdout]     |         ^^
[INFO] [stdout] 185 |         d3: u128,
[INFO] [stdout]     |         ^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `seq_num` and `inner` are never read
[INFO] [stdout]    --> src/main.rs:189:9
[INFO] [stdout]     |
[INFO] [stdout] 188 |     struct Data {
[INFO] [stdout]     |            ---- fields in this struct
[INFO] [stdout] 189 |         seq_num: u16,
[INFO] [stdout]     |         ^^^^^^^
[INFO] [stdout] 190 |         inner: Inner,
[INFO] [stdout]     |         ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variants `Empty` and `Occupied` are never constructed
[INFO] [stdout]    --> src/main.rs:201:9
[INFO] [stdout]     |
[INFO] [stdout] 200 |     enum E {
[INFO] [stdout]     |          - variants in this enum
[INFO] [stdout] 201 |         Empty,
[INFO] [stdout]     |         ^^^^^
[INFO] [stdout] 202 |         Occupied(Data),
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `a` is never read
[INFO] [stdout]    --> src/main.rs:467:9
[INFO] [stdout]     |
[INFO] [stdout] 466 |     struct K {
[INFO] [stdout]     |            - field in this struct
[INFO] [stdout] 467 |         a: [Option<u32>; 30],
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `a` is never read
[INFO] [stdout]    --> src/main.rs:471:9
[INFO] [stdout]     |
[INFO] [stdout] 470 |     struct M {
[INFO] [stdout]     |            - field in this struct
[INFO] [stdout] 471 |         a: [MaybeUninit<u32>; 30],
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `0` is never read
[INFO] [stdout]    --> src/main.rs:634:18
[INFO] [stdout]     |
[INFO] [stdout] 634 |     struct Dummy(usize);
[INFO] [stdout]     |            ----- ^^^^^
[INFO] [stdout]     |            |
[INFO] [stdout]     |            field in this struct
[INFO] [stdout]     |
[INFO] [stdout]     = help: consider removing this field
[INFO] [stdout]     = note: `Dummy` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_is_isomorphism_matching` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn vf2pp_is_isomorphism_matching<G0, G1>(g0: G0, g1: G1, subgraph: bool) -> bool
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_is_isomorphism_semantic_matching` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn vf2pp_is_isomorphism_semantic_matching<G0, G1, NM, EM>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_isomorphism_semantic_matching_iter` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn vf2pp_isomorphism_semantic_matching_iter<'a, G0, G1, NM, EM>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `is_match` are never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:151:8
[INFO] [stdout]     |
[INFO] [stdout] 133 | / impl<'a, G0, G1, NM, EM> IsomorphismMatcher<'a, G0, G1, NM, EM>
[INFO] [stdout] 134 | | where
[INFO] [stdout] 135 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 136 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 148 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 149 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- associated items in this implementation
[INFO] [stdout] 150 |   {
[INFO] [stdout] 151 |       fn new(vf2pp: VF2PP<G0, G1>, node_matcher: NM, edge_matcher: EM, subgraph: bool) -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 171 |       pub fn is_match(&mut self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:270:8
[INFO] [stdout]     |
[INFO] [stdout] 255 | / impl<G0, G1> VF2PP<G0, G1>
[INFO] [stdout] 256 | | where
[INFO] [stdout] 257 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 258 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 267 | |         + NodeCount
[INFO] [stdout] 268 | |         + GraphProp,
[INFO] [stdout]     | |____________________- associated function in this implementation
[INFO] [stdout] 269 |   {
[INFO] [stdout] 270 |       fn new<F0, F1>(g0: G0, g1: G1, mut label0: F0, mut label1: F1) -> Self
[INFO] [stdout]     |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Vf2ppMatcherBuilder` is never constructed
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:576:12
[INFO] [stdout]     |
[INFO] [stdout] 576 | pub struct Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:587:12
[INFO] [stdout]     |
[INFO] [stdout] 584 | / impl<G0, G1>
[INFO] [stdout] 585 | |     Vf2ppMatcherBuilder<G0, G1, NoNodeLabel, NoNodeLabel, NoSemanticMatch, NoSemanticMatch>
[INFO] [stdout]     | |___________________________________________________________________________________________- associated function in this implementation
[INFO] [stdout] 586 |   {
[INFO] [stdout] 587 |       pub fn new() -> Self
[INFO] [stdout]     |              ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_subgraph` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:611:12
[INFO] [stdout]     |
[INFO] [stdout] 602 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 603 | | where
[INFO] [stdout] 604 | |     G0: GraphBase,
[INFO] [stdout] 605 | |     G1: GraphBase,
[INFO] [stdout] ...   |
[INFO] [stdout] 608 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 609 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 610 |   {
[INFO] [stdout] 611 |       pub fn set_subgraph(mut self, match_subgraph: bool) -> Self {
[INFO] [stdout]     |              ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `build` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:636:12
[INFO] [stdout]     |
[INFO] [stdout] 617 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 618 | | where
[INFO] [stdout] 619 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 620 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 633 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 634 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 635 |   {
[INFO] [stdout] 636 |       pub fn build<'a>(self, g0: G0, g1: G1) -> IsomorphismMatcher<'a, G0, G1, NM, EM> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_label` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:652:12
[INFO] [stdout]     |
[INFO] [stdout] 643 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 644 | | where
[INFO] [stdout] 645 | |     G0: GraphBase + GraphDataAccess,
[INFO] [stdout] 646 | |     G1: GraphBase + GraphDataAccess,
[INFO] [stdout] ...   |
[INFO] [stdout] 649 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 650 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 651 |   {
[INFO] [stdout] 652 |       pub fn set_label<LF0, LF1>(
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_node_matcher` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:679:12
[INFO] [stdout]     |
[INFO] [stdout] 670 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 671 | | where
[INFO] [stdout] 672 | |     G0: GraphDataAccess + IntoEdgeDirected,
[INFO] [stdout] 673 | |     G1: GraphDataAccess + IntoEdgeDirected,
[INFO] [stdout] ...   |
[INFO] [stdout] 676 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 677 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 678 |   {
[INFO] [stdout] 679 |       pub fn set_node_matcher<N>(self, nm: N) -> Vf2ppMatcherBuilder<G0, G1, F0, F1, N, EM>
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_edge_matcher` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:702:12
[INFO] [stdout]     |
[INFO] [stdout] 693 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 694 | | where
[INFO] [stdout] 695 | |     G0: GraphDataAccess + IntoEdgeDirected + Copy,
[INFO] [stdout] 696 | |     G1: GraphDataAccess + IntoEdgeDirected + Copy,
[INFO] [stdout] ...   |
[INFO] [stdout] 699 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 700 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 701 |   {
[INFO] [stdout] 702 |       pub fn set_edge_matcher<E>(self, em: E) -> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, E>
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_shortest_path` is never used
[INFO] [stdout]   --> src/graph/algo/k_shortest_path.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn k_shortest_path<G, F, K>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `greedy_matching` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn greedy_matching<G>(g: G) -> Matching<G>
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs_non_backtracing` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn dfs_non_backtracing<G, F>(g: G, node: G::NodeId, visited: &mut G::Map, mut add_mate: F)
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_matching` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | pub fn maximum_matching<G>(g: G) -> Matching<G>
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `assign_edge_lable` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:145:4
[INFO] [stdout]     |
[INFO] [stdout] 145 | fn assign_edge_lable<G>(
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `augment_path` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:206:4
[INFO] [stdout]     |
[INFO] [stdout] 206 | fn augment_path(outer: usize, target: usize, mate: &mut Vec<Option<usize>>, label: &Vec<Label>) {
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Label` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:241:6
[INFO] [stdout]     |
[INFO] [stdout] 241 | enum Label {
[INFO] [stdout]     |      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `is_outer`, `is_nonouter`, `try_next_outer`, and `try_edge_outer` are never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:250:8
[INFO] [stdout]     |
[INFO] [stdout] 249 | impl Label {
[INFO] [stdout]     | ---------- methods in this implementation
[INFO] [stdout] 250 |     fn is_outer(self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 257 |     fn is_nonouter(self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 261 |     fn try_next_outer(self) -> Option<usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 268 |     fn try_edge_outer(self) -> Option<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Matching` is never constructed
[INFO] [stdout]    --> src/graph/algo/matching.rs:276:12
[INFO] [stdout]     |
[INFO] [stdout] 276 | pub struct Matching<G>
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `is_perfect` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:289:12
[INFO] [stdout]     |
[INFO] [stdout] 285 | / impl<G> Matching<G>
[INFO] [stdout] 286 | | where
[INFO] [stdout] 287 | |     G: NodeCount + GraphBase + Copy,
[INFO] [stdout]     | |____________________________________- method in this implementation
[INFO] [stdout] 288 |   {
[INFO] [stdout] 289 |       pub fn is_perfect(&self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple methods are never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:299:12
[INFO] [stdout]     |
[INFO] [stdout] 295 | / impl<G> Matching<G>
[INFO] [stdout] 296 | | where
[INFO] [stdout] 297 | |     G: NodeIndexable + Copy,
[INFO] [stdout]     | |____________________________- methods in this implementation
[INFO] [stdout] 298 |   {
[INFO] [stdout] 299 |       pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 306 |       pub fn edges(&self) -> MatchedEdges<'_, G> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 314 |       pub fn nodes(&self) -> MatchedNodes<'_, G> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 322 |       pub fn contains_edge(&self, n: G::NodeId, m: G::NodeId) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 329 |       pub fn contains_node(&self, n: G::NodeId) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 333 |       pub fn len(&self) -> usize {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 337 |       pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_simple_paths` is never used
[INFO] [stdout]  --> src/graph/algo/simple_paths.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn all_simple_paths<G, P>(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `std::slice::Iter` that must be used
[INFO] [stdout]    --> src/main.rs:350:5
[INFO] [stdout]     |
[INFO] [stdout] 350 |     v.iter();
[INFO] [stdout]     |     ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: iterators are lazy and do nothing unless consumed
[INFO] [stdout]     = note: `#[warn(unused_must_use)]` on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 350 |     let _ = v.iter();
[INFO] [stdout]     |     +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `Result` that must be used
[INFO] [stdout]    --> src/main.rs:443:5
[INFO] [stdout]     |
[INFO] [stdout] 443 |     fs.seek(std::io::SeekFrom::Start(1));
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 443 |     let _ = fs.seek(std::io::SeekFrom::Start(1));
[INFO] [stdout]     |     +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `Result` that must be used
[INFO] [stdout]    --> src/main.rs:444:5
[INFO] [stdout]     |
[INFO] [stdout] 444 |     fs.read_exact(&mut buffer);
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 444 |     let _ = fs.read_exact(&mut buffer);
[INFO] [stdout]     |     +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 49 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 7.84s
[INFO] running `Command { std: "docker" "inspect" "6770c8b765a9c34b1d6e5562bc31aa14ff9c3c0518236b1fae654b05444bf859", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6770c8b765a9c34b1d6e5562bc31aa14ff9c3c0518236b1fae654b05444bf859", kill_on_drop: false }`
[INFO] [stdout] 6770c8b765a9c34b1d6e5562bc31aa14ff9c3c0518236b1fae654b05444bf859